Does there exist a 5-dimensional centrally symmetric self-dual polytope?
2026-03-27 14:21:29.1774621289
Bumbble Comm
On
Existence of 5-d centrally symmetric self-dual polytope
202 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
1
Bumbble Comm
On
The simplex is the only regular self dual polytope in dim $\ge 5$, see e.g. wikipedia Did you mean this?
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in FIBONACCI-NUMBERS
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Fibonacci sequence and golden ratio
- Induction proof of Fibonacci numbers
- Fibonacci sequence and divisibility.
- Fibonacci numbers mod $p$
- A proof regarding the Fibonacci Sequence.
- Congruencies for Fibonacci numbers
- Is every $N$th Fibonacci number where $N$ is divisible by $5$ itself divisible by $5$
- Proof involving Fibonacci number and binomial coefficient
Related Questions in POLYTOPES
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Can we really move disks around a compact surface like this?
- The permutations of (1,1,0,0), (-1,1,0,0), (-1,-1,0,0) are vertices of a polytope.
- Smoothness of a polytope
- Schlegel diagram and d-diagram
- How to find the "interior boundary" for a set of points?
- Simplicial polytope in $\mathbb{R}^n$ with $n+2$ vertices
- What are some examples of 2-polytope/3-polytope that are not simple?
- Contraction of oriented matroid as related to polytope?
- Finding the vertices of linear image of the $n$-simplex
Related Questions in TRANSPOSE
- Vectorization and transpose: how are $\text{vec}(W^T)$ and $\text{vec}(W)$ related?
- What can we say about two bases A and B for which the conversion matrix to a third base C is the transpose of the other
- Decomposition of the product of matrices
- Interpretation of transpose of a linear application from a matricial product point of view
- Derivative involving trace and Kronecker product
- What does a matrix multiplied by its transpose tell me about the matrix's inverse?
- Proving similarity of $A$ and $A^T$
- What does it mean when you say a matrix of of a linear transformation is relative to a standard basis?
- Matrix equation $Z - {}^t Z =c A Z$
- Prove that the characteristic polynmial of a skew mapping satisfies $c(-\lambda) = (-1)^n c(\lambda)$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I recently discovered a 5-dimensional centrally symmetric, self-dual polytope, and I am not aware of anyone else discussing it, so I decided to ask & answer this question in the affirmative. I phrased the question this way because the 4-dimensional 24-cell is famously regular, centrally symmetric and self-dual. If nothing else, this answer might be useful for cocktail party banter: “I was reading the other day about a 5-dimensional polytope that’s both centrally symmetric and self-dual. Of course, it’s not regular.”
The tridiagonal Birkhoff polytope $TB_{d+1}$ is a d-polytope. It has been noted (footnote 1) that $TB_{d+1}$ is combinatorially equivalent to the Fibonacci d-polytope (of order 2) $FP_d$ (2); i.e., the 0/1 d-polytope whose vertices have no consecutive pair of 1s. (Hereinafter just called $FP_d$.) This equivalence results from the fact that a tridiagonal permutation matrix is determined by its superdiagonal.
I call the subject polytope $JCS_5$. Its construction begins by embedding $FP_4$ in the hyperplane $x_5$ = 1. So, the first 8 vertices are:
$v_1$: (0, 0, 0, 0, 1)
$v_2$: (1, 0, 0, 0, 1)
$v_3$: (1, 0, 1, 0, 1)
$v_4$: (0, 1, 0, 0, 1)
$v_5$: (1, 0, 0, 1, 1)
$v_6$: (0, 0, 1, 0, 1)
$v_7$: (0, 1, 0, 1, 1)
$v_8$: (0, 0, 0, 1, 1)
Then, let $v_{8+i}$ = -$v_i$ for i = 1 to 8. By construction, the convex hull of this vertex set is a centrally symmetric polytope, and the 16 vertices identified are polytope vertices.
The first 8 facets of the form $f_i$ $\cdot$ x = 1 are:
$f_1$: (0, 0, 0, 0, 1)
$f_2$: (-2, -2, 0, 0, 1)
$f_3$: (-2, 0, 0, 0, 1)
$f_4$: (0, -2, 0, 0, 1)
$f_5$: (0, -2, -2, 0, 1)
$f_6$: (0, 0, -2, 0, 1)
$f_7$: (0, 0, 0, -2, 1)
$f_8$: (0, 0, -2, -2, 1)
The last 8 facets are given by $f_{8+i}$ = -$f_i$ for i = 1 to 8.
The ordering of the vertices and facets was chosen to produce a nicely transposable facet-vertex incidence matrix M:
By applying the following permutation to the columns of $M$:
(2 3 6 8 7 4) (10 11 14 16 15 12);
And the following permutation to the rows:
(2 6 7) (3 8 4) (10 14 15) (11 16 12);
You obtain the transpose of $M$; $M^T$. Per (2), this implies that $JCS_5$ is self-dual.
The f-vector of $JCS_5$ is (16, 64, 98, 64, 16). Eight of the 16 facets of $JCS_5$ are of type $FP_4$ (facets 1, 4, 5, 6, 9, 11, 12 and 13), and the other eight are of a type I call $J_4$. The seven facets of $FP_4$ are two triangular prisms, four pyramids, and a tetrahedron. The nine facets of $J_4$ are an octahedron, four pyramids and four tetrahedra. $J_4$ is the combinatorial type called the ‘special 0/1 polytope P’ in (3).
$J_d$ is constructed by beginning with $FP_{d-1}$ (having $F_{d+1}$ vertices, where $F_i$ is the Fibonacci sequence) embedded in $x_d$ = 1. This polytope has four facets of the type $FP_{d-2}$ (having $F_d$ vertices). (These facets are given by $x_1$ = 0, $x_{d-1}$ = 0, $x_1$ + $x_2$ = 1, and $x_{d-2}$ + $x_{d-1}$ = 1.) The inverses of the vertices of one of these facets are added, and the convex hull taken, obtaining $J_d$, a d-polytope with $F_{d+2}$ vertices.
Based on low dimensional results, it appears that:
(1) da Fonseca, C.M., “Some open questions on the Fibonacci polytope”, Linear and Multilinear Algebra, Volume 59, Issue 3, March 2011
(2) Tiwary, H.R., Elbassioniy, K., “On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism”, SCG ’08, June 9-11, 2008
(3) Baumeister, B.; Haase, C.; Nill, B.; Paffenholz, A.; “On permuation polytopes”, Adv. Math. 222 (2009) pp. 431-452