A027638 -id:A027638 - cp's OEIS frontend

A003956 Order of complex Clifford group of degree 2^n arising in quantum coding theory.

8, 192, 92160, 743178240, 97029351014400, 203286581427673497600, 6819500449352277792129024000, 3660967964237442812098963052691456000, 31446995505814020383166371418359014222725120000

Offset: 0

N. J. A. Sloane and Peter Shor

T. D. Noe, Table of n, a(n) for n = 0..20
Simon Burton, Elijah Durso-Sabina, and Natalie C. Brown, Genons, Double Covers and Fault-tolerant Clifford Gates, arXiv:2406.09951 [quant-ph], 2024. See p. 18.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Quantum error correction via codes over GF(4), arXiv:quant-ph/9608006, 1996-1997; IEEE Trans. Inform. Theory, 44 (1998), 1369-1387.
G. Nebe, E. M. Rains, and N. J. A. Sloane, The invariants of the Clifford groups, arXiv:math/0001038 [math.CO], 2000; Des. Codes Crypt. 24 (2001), 99-121.
G. Nebe, E. M. Rains, and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
Edwin Pednault, An alternative approach to optimal wire cutting without ancilla qubits, arXiv:2303.08287 [quant-ph], 2023.
Tefjol Pllaha, Olav Tirkkonen, and Robert Calderbank, Binary Subspace Chirps, arXiv:2102.12384 [cs.IT], 2021.
Bernhard Runge, Codes and Siegel modular forms, Discrete Math. 148 (1996), 175-204.
Peter Selinger, Generators and relations for n-qubit Clifford operators, arXiv:1310.6813 [quant-ph], 2013; Log. Methods Comput. Sci. 11 (2:10) (2015), 1-17, doi:10.2168/LMCS-11(2:10)2015.
Index entries for sequences related to groups.

Cf. A001309, A014116, A014115, A027672, A100221.

Equals twice A027638.

List([0..10], n-> 2^((n+1)^2 +2)*Product([1..n], j-> 4^j -1) ); # G. C. Greubel, Sep 24 2019

[n eq 0 select 8 else 2^((n+1)^2+2)*(&*[4^j-1: j in [1..n]]): n in [0..10]]; // G. C. Greubel, Sep 24 2019

a(n):= 2^(n^2+2*n+3)*mul(4^j-1, j=1..n); seq(a(n), n=0..10); # modified by G. C. Greubel, Sep 24 2019

Table[2^(n^2+2n+3) Product[4^j-1,{j,n}],{n,0,10}] (* Harvey P. Dale, Nov 03 2017 *)

vector(11, n, 2^(n^2 +2)*prod(j=1,n-1, 4^j-1) ) \\ G. C. Greubel, Sep 24 2019

from math import prod
def A003956(n): return prod((1<Chai Wah Wu, Jun 20 2022

[2^((n+1)^2 +2)*product(4^j -1 for j in (1..n)) for n in (0..10)] # G. C. Greubel, Sep 24 2019

From Amiram Eldar, Jul 06 2025: (Start)
a(n) = 2^(n^2+2*n+3) * Product_{k=1..n} (4^k-1).
a(n) ~ c * 2^(2*n^2+3*n+3), where c = A100221. (End)

A027672 Molien series for unitary 16-dimensional full Siegel modular group H_4 of order 48514675507200.

Original entry on oeis.org

1, 0, 1, 1, 2, 3, 7, 7, 19, 27, 52, 87, 172, 279, 550, 960, 1782, 3183, 5845, 10288, 18508, 32284, 56345, 96473, 164157, 274194, 454518, 741321, 1196924, 1906123, 3003750, 4673470, 7198311, 10959836, 16523847, 24654860, 36447873, 53369530, 77478005, 111498073

Offset: 0

N. J. A. Sloane

			1+x^8+x^12+2*x^16+3*x^20+7*x^24+7*x^28+19*x^32+27*x^36+O(x^40).

Ray Chandler, Table of n, a(n) for n = 0..1000
Ray Chandler, Mathematica program
G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
M. Oura, The dimension formula for the ring of code polynomials in genus 4, Osaka J. Math. 34 (1997), 53-72.
Bernhard Runge, On Siegel modular forms, part II, Nagoya Math. J. 138, 179-197 (1995).
Index entries for linear recurrences with constant coefficients, order 168.
Index entries for Molien series
Index entries for sequences related to modular groups

Cf. A027633, A027638, A051354.

Mathematica
```
(* See link for Mathematica program. *)
```

Oura gives an explicit formula for the Molien series.

A027633 Molien series for full 8 X 8 Siegel modular group H_3 of order 371589120.

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 5, 4, 9, 10, 16, 19, 31, 34, 53, 64, 89, 109, 152, 179, 245, 296, 384, 467, 601, 716, 911, 1090, 1351, 1614, 1986, 2342, 2856, 3364, 4037, 4742, 5653, 6578, 7791, 9036, 10592, 12243, 14268, 16380, 18990, 21724, 24999

Offset: 0

N. J. A. Sloane

			1 + x^4 + x^6 + 2*x^8 + 2*x^10 + 5*x^12 + 4*x^14 + 9*x^16 + 10*x^18 + 16*x^20 + ...

Jean-François Alcover, Table of n, a(n) for n = 0..999
B. Runge, On Siegel modular forms II, Nagoya Math. J., 138 (1995), 179-197.
Index entries for Molien series
Index entries for sequences related to modular groups
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 1, -1, 2, -1, -1, 1, -2, 0, 0, -2, 2, 0, -1, 3, -1, 1, 2, -3, 2, 0, -3, 3, -3, 0, 3, -4, 3, 0, -3, 3, -3, 0, 2, -3, 2, 1, -1, 3, -1, 0, 2, -2, 0, 0, -2, 1, -1, -1, 2, -1, 1, 0, 0, 1, -1).

Cf. A027672, A027638. Bisection gives A039946.

R. = PowerSeriesRing(ZZ,40);
g = 1 + x^4 + x^10 + 3*x^16 - x^18 + 3*x^20 + 2*x^22 + 2*x^24 + 3*x^26 + 4*x^28 + 2*x^30 + 7*x^32 + 3*x^34 + 7*x^36 + 5*x^38 + 9*x^40 + 6*x^42 + 10*x^44 + 8*x^46 + 9*x^50 + 7*x^54 - x^2 + 12*x^52 + 10*x^48 + 7*x^56;
f = g + x^112*g(1/x);
h = f(x)*(1 + x^2)/((1 - x^4)*(1 - x^8)*(1 - x^12)^2*(1 - x^14)*(1 - x^18)*(1 - x^20)*(1 - x^30));
[h.list()[2*i] for i in range(20)] # Andy Huchala, Mar 02 2022

Reference gives explicit formula for Molien series.
Molien series is f(x)*(1 + x^2)/((1 - x^4)*(1 - x^8)*(1 - x^12)^2*(1 - x^14)*(1 - x^18)*(1 - x^20)*(1 - x^30)),
where f(x) = g(x) + x^112*g(1/x), g(x) = 1 + x^4 + x^10 + 3*x^16 - x^18 + 3*x^20 + 2*x^22 + 2*x^24 + 3*x^26 + 4*x^28 + 2*x^30 + 7*x^32 + 3*x^34 + 7*x^36 + 5*x^38 + 9*x^40 + 6*x^42 + 10*x^44 + 8*x^46 + 9*x^50 + 7*x^54 - x^2 + 12*x^52 + 10*x^48 + 7*x^56.

cp's OEIS Frontend

A003956 Order of complex Clifford group of degree 2^n arising in quantum coding theory.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

A027672 Molien series for unitary 16-dimensional full Siegel modular group H_4 of order 48514675507200.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A027633 Molien series for full 8 X 8 Siegel modular group H_3 of order 371589120.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Sage

Formula