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!)
A334304 Number of distinct acyclic orientations of the edges of an n-dimensional cube with complete graphs as facets. 2
1, 1, 3, 501 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Take the edge graph of an n-dimensional cube and replace each of its (n-1) dimensional facets with a complete graph. The edges of this graph are then oriented so that no cycles are formed. a(n) is the number of different ways to do this with results that are not rotations of reflections of each other.

For n<=3, a(n) is the number of reference elements needed when using the finite element method for an n-dimensional problem with tensor product cells if the orientations of the mesh entities are derived from a low-to-high ordering of the vertex numbers.

LINKS

Table of n, a(n) for n=0..3.

Matthew Scroggs, Python code to calculate A334304

Matthew W. Scroggs, Jørgen S. Dokken, Chris N. Richardson, Garth N. Wells, Construction of arbitrary order finite element degree-of-freedom maps on polygonal and polyhedral cell meshes, arXiv:2102.11901 [math.NA], 2021.

Eric Weisstein's World of Mathematics, 16-Cell (the n=3 graph).

FORMULA

A334248(n) <= a(n) <= A000142(2^n).

EXAMPLE

For n=2, the n-dimensional cube is a square, and the (n-1)-dimensional facets are the edges of the square. Replacing the edges with complete graphs on 2 vertices does not change the graph.

There are 3 distinct (under rotations and reflections) acyclic orientations of the edges of this graph:

*->-*    *->-*    *-<-*

|   |    |   |    |   |

^   ^    ^   v    ^   v

|   |    |   |    |   |

*->-*    *->-*    *->-*

Therefore a(2) = 3.

For n=3, the n-dimensional cube is a cube, and the (n-1)-dimensional facets are the faces of the cube. Replacing the faces with complete graphs on 4 vertices gives the graph that is the edges of a cube with diagonal edges added to each face (the "16-cell"). a(3) is the number of distinct acyclic orientations of this graph.

CROSSREFS

A334248 is the number of distinct acyclic orientations of a n-cube (without the addition of complete graphs). A000012 is the number of reference elements needed when using the finite element method for an n-dimensional problem with simplectic cells.

Sequence in context: A057632 A245245 A024045 * A255017 A160362 A155852

Adjacent sequences:  A334301 A334302 A334303 * A334305 A334306 A334307

KEYWORD

nonn,more

AUTHOR

Matthew Scroggs, Apr 22 2020

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 July 31 02:04 EDT 2021. Contains 346366 sequences. (Running on oeis4.)