|
|
A060638
|
|
Triangle T(n,k) (0 <= k <= n) giving number of edges in the "flip graph" whose nodes are tilings of the k-dimensional zonotope constructed from n vectors.
|
|
16
|
|
|
0, 1, 0, 4, 1, 0, 12, 6, 1, 0, 32, 36, 8, 1, 0, 80, 240, 100, 10, 1, 0, 192, 1800, 2144, 264, 12, 1, 0, 448, 15120, 80360, 22624, 672, 14, 1, 0, 1024, 141120
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
The zonotope Z(n,k) is the projection of the n-dimensional hypercube onto the k-dimensional space and the tiles are the projections of the k-dimensional faces of the hypercube.
|
|
REFERENCES
|
A. Bjorner, M. Las Vergnas, B. Sturmfels, N. White and G. M. Ziegler, Oriented Matroids, Encyclopedia of Mathematics 46, Second Edition, Cambridge University Press, 1999
Victor Reiner, The generalized Baues problem, in New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996-1997), 293-336, Math. Sci. Res. Inst. Publ., 38, Cambridge Univ. Press, Cambridge, 1999.
|
|
LINKS
|
|
|
EXAMPLE
|
0
1 0
4 1 0
12 6 1 0
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|