login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325014 Array read by descending antidiagonals: A(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthoplex using up to k colors. 11
0, 1, 0, 3, 0, 0, 6, 3, 1, 0, 10, 15, 66, 94, 0, 15, 45, 920, 97974, 1047816, 0, 21, 105, 6350, 10700090, 481141220994, 400140831558512, 0, 28, 210, 29505, 390081800, 4802390808840576, 74515656021475803734579625, 527471421741473576372948457251328, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Also called cross polytope and hyperoctahedron. For n=1, the figure is a line segment with two vertices. For n=2 the figure is a square with four edges. For n=3 the figure is an octahedron with eight triangular faces. For n=4, the figure is a 16-cell with sixteen tetrahedral facets. The Schläfli symbol, {3,...,3,4}, of the regular n-dimensional orthoplex (n>1) consists of n-2 threes followed by a four. Each of its 2^n facets is an (n-1)-dimensional simplex. The chiral colorings of its facets come in pairs, each the reflection of the other.

Also the number of chiral pairs of colorings of the vertices of a regular n-dimensional orthotope (cube) using up to k colors.

LINKS

Robert A. Russell, Table of n, a(n) for n = 1..78

E. M. Palmer and R. W. Robinson, Enumeration under two representations of the wreath product, Acta Math., 131 (1973), 123-143.

Wikipedia, Cross-polytope

FORMULA

The algorithm used in the Mathematica program below assigns each permutation of the axes to a partition of n. It then determines the number of permutations for each partition and the cycle index for each partition.

A(k,n) = A325012(n,k) - A325013(n,k) = (A325012(n,k) - A325015(n,k)) / 2 = A325013(n,k) - A325015(n,k).

A(n,k) = Sum_{j=2..2^n} A325018(n,j) * binomial(k,j).

EXAMPLE

Array begins with A(1,1):

0  1     3        6        10         15          21           28 ...

0  0     3       15        45        105         210          378 ...

0  1    66      920      6350      29505      106036       317856 ...

0 94 97974 10700090 390081800 7280687610 86121007714 730895668104 ...

For A(2,3)=3, each square has one of the three colors on two adjacent edges.

MATHEMATICA

a48[n_] := a48[n] = DivisorSum[NestWhile[#/2&, n, EvenQ], MoebiusMu[#]2^(n/#)&]/(2n); (* A000048 *)

a37[n_] := a37[n] = DivisorSum[n, MoebiusMu[n/#]2^#&]/n; (* A001037 *)

CI0[{n_Integer}] := CI0[{n}] = CI[Transpose[If[EvenQ[n], p2 = IntegerExponent[n, 2]; sub = Divisors[n/2^p2]; {2^(p2+1) sub, a48 /@ (2^p2 sub) }, sub = Divisors[n]; {sub, a37 /@ sub}]]] 2^(n-1); (* even perm. *)

CI1[{n_Integer}] := CI1[{n}] = CI[sub = Divisors[n]; Transpose[If[EvenQ[n], {sub, a37 /@ sub}, {2 sub, a48 /@ sub}]]] 2^(n-1); (* odd perm. *)

compress[x : {{_, _} ...}] := (s = Sort[x]; For[i = Length[s], i > 1, i -= 1, If[s[[i, 1]]==s[[i-1, 1]], s[[i-1, 2]] += s[[i, 2]]; s = Delete[s, i], Null]]; s)

cix[{a_, b_}, {c_, d_}] := {LCM[a, c], (a b c d)/LCM[a, c]};

Unprotect[Times]; Times[CI[a_List], CI[b_List]] :=  (* combine *) CI[compress[Flatten[Outer[cix, a, b, 1], 1]]]; Protect[Times];

CI0[p_List] := CI0[p] = Expand[CI0[Drop[p, -1]] CI0[{Last[p]}] + CI1[Drop[p, -1]] CI1[{Last[p]}]]

CI1[p_List] := CI1[p] = Expand[CI0[Drop[p, -1]] CI1[{Last[p]}] + CI1[Drop[p, -1]] CI0[{Last[p]}]]

pc[p_List] := Module[{ci, mb}, mb = DeleteDuplicates[p]; ci = Count[p, #] & /@ mb; n!/(Times @@ (ci!) Times @@ (mb^ci))] (* partition count *)

row[n_Integer] := row[n] = Factor[(Total[((CI0[#] - CI1[#]) pc[#]) & /@ IntegerPartitions[n]])/(n! 2^n)] /. CI[l_List] :> j^(Total[l][[2]])

array[n_, k_] := row[n] /. j -> k

Table[array[n, d-n+1], {d, 1, 10}, {n, 1, d}] // Flatten

CROSSREFS

Cf. A325012 (oriented), A325013 (unoriented), A325015 (achiral), A325018 (exactly k colors).

Other n-dimensional polytopes: A007318(k,n+1) (simplex), A325006 (orthotope).

Rows 1-2 are A161680, A050534.

Cf. A000048, A001037.

Sequence in context: A048962 A135028 A325006 * A343992 A275689 A322015

Adjacent sequences:  A325011 A325012 A325013 * A325015 A325016 A325017

KEYWORD

nonn,tabl,easy

AUTHOR

Robert A. Russell, May 27 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 10:32 EDT 2021. Contains 345098 sequences. (Running on oeis4.)