Questions tagged [polytopes]
The polytopes tag has no usage guidance.
60
questions
3
votes
1answer
55 views
Reference for “every 5-dimensional polytope has a 3-gonal or 4-gonal face”
It seems to be folklore that every 5-dimensional convex polytope has a 3-gonal or 4-gonal face of dimension two. I was not able to track down a source for that claim.
Alternatively, I would be ...
3
votes
1answer
123 views
Is there a 4-polytope without 3-gonal and 4-gonal faces, other than the 120-cell?
The question is in the title:
Question: Is there any 4-dimensional polytope without 3-gonal and 4-gonal faces (of dimension two), other than the 120-cell?
I consider only convex polytopes (convex ...
1
vote
0answers
53 views
Polytopes with large dihedral angles
The regular $d$-simplex has dihedral angle $\arccos(1/d)<90^\circ$, and the $d$-cube has dihedral angle exactly $90^\circ$.
The maximal dihedral angle of a prism over a $(d-1)$-simplex is also $90^\...
4
votes
0answers
42 views
If all 2-faces of a polytope are $2n$-gons, is the edge-graph bipartite?
This question on MSE has not received a satisfying answer. It can be summarized as follows:
Question: Is is true that the edge-graph of a (convex) polytope is bipartite if and only if all 2-faces ...
2
votes
0answers
54 views
Uniquely describing a polytopal complex by prescribing the local structure around its vertices
Let $C$ be a $d$-dimensional (abstract) polytopal complex.
Most of what I say below could be asked in this general setting, but for a start, let's further restrict to simple polytopal spheres, that is,...
26
votes
7answers
2k views
Why are we interested in permutahedra, associahedra, cyclohedra, …?
The following families of polytopes have received a lot of attention:
permutahedra,
associahedra,
cyclohedra,
...
My question is simple: Why?
As I understand, at least the latter two were ...
1
vote
1answer
107 views
The Fano plane, stericated 6-simplex, and pentallated 6-simplex
According to this link:
https://en.wikipedia.org/wiki/Stericated_6-simplexes
the stericated 5-simplex "scal" has 105 vertices defined as permutations of (0,0,1,1,1,1,2).
In the course of my team's ...
2
votes
0answers
54 views
A matrix that commutes with all symmetries of a vertex-transitive polytope
Let $P\subset\Bbb R^d$ be a vertex-transitive polytope aka. an orbit polytope.
Can there be a matrix $T\in\mathrm{SO}(\Bbb R^d)$ that commutes with all symmetries in $\mathrm{Aut}(P)\subset\mathrm O(\...
0
votes
0answers
38 views
Every point in a regular polytope has its own antipodal point or antipodal face
I apologize for using non-common language. When this problem comes to my mind, it seems quite easy but It's not.
Maybe It can be rewritten as,
There exists a unique facet containing the most far ...
5
votes
1answer
197 views
Classification of vertex-transitive zonotopes
Zonotopes are convex polytopes that can be defined in several equivalent ways:
parallel projections of cubes,
Minkowsi sums of line segments,
only centrally symmetric faces,
...
I wonder whether ...
3
votes
2answers
113 views
4-polytopes with only one kind of regular facet
Is there a neat way to show (or a reference that already proves) that
the 4-cube is the only convex 4-polytope in which all facets are regular 3-cubes?
the 24-cell is the only convex 4-polytope in ...
0
votes
0answers
24 views
Set system of supports of vertices of a polytope written in equational form (reference request)
Let $P \subseteq \mathbb{R}^n$ be a polytope defined by $Ax = b, x \geq 0$ (that is, $P$ is in equational form). For any $v \in \mathbb{R}^n$, let $\text{supp}(v) = \{ i : v_i \not = 0\}$. Let $V(P)$ ...
2
votes
1answer
131 views
Are there any more polytopes whose 2-faces are identical 4-gons?
What are examples for convex polytope $P\subset \Bbb R^d,d\ge 3$ for which holds
$P$ is 2-face transitive (that is, all 2-faces are equivalent under the symmetries of $P$), and
all 2-faces of $P$ are ...
2
votes
0answers
118 views
The topological complexity of polytopes
Polytopes arise naturally when modelling fundamental structures in Biology such as RNA and proteins [1,2]. Recently, it occurred to me that a complexity measure on the topology of polytopes might be ...
6
votes
2answers
180 views
Is there any edge- but not vertex-transitive polytope in $d\ge 4$ dimensions?
I consider convex polytopes $P\subset\Bbb R^d$. The polytope is called vertex- resp. edge-transitive, if any vertex resp. edge can be mapped to any other by a symmetry of the polytope.
I am looking ...
0
votes
0answers
44 views
Realizing 0/1-polytopes with shortest possible edge lengths
Has there been something written about the following question?
Question: Given a 0/1-polytope, what is the shortest edge lengths with which this polytope can be realized as a 0/1-polytope.
The ...
3
votes
0answers
45 views
Matroids which are transitive on minimal basis exchanges
I am looking for matroids in which all minimal basis exchanges look the same, that is, the matroid is transitive on these. Let me explain what I mean by that.
Consider a finite matroid $M$. Define a ...
4
votes
0answers
77 views
Edges of the contact polytope of the Leech lattice
Let $P\subset\Bbb R^{24}$ be the contact polytope of the Leech lattice, that is, $P$ is the convex hull of the 196,560 shortest vectors of $\Lambda_{24}$.
Question: What are the edges of $P$?
Let'...
1
vote
2answers
75 views
Products of polytopes and the normals of their facets
I need to compute the normals of the facets of certain polytopes that can be represented as products of polytopes in smaller dimensions.
Searching the bibliography I found that the facets of the ...
2
votes
1answer
115 views
Number of bitangents to convex polytopes
Let me state my question prior to defining terms:
Q. Let $P_1$ and $P_2$ be disjoint convex polytopes
in $\mathbb{R}^d$ of $n$ vertices each.
What is the maximum number of distinct bitangent
...
2
votes
0answers
27 views
When do projection maps of polyhedra factor?
Given three polyhedra $P$, $Q$, and $R$ in dimensions $a$, $b$, and $c$ respectively, with $a\leq b\leq c$, with the additional condition that: $P=\pi_1(Q)=\pi_2(R)$, where $\pi_1$ and $\pi_2$ are ...
3
votes
1answer
144 views
On decomposition of polytopes
Given $m$ number of convex polytopes each with $v$ vertices and described by $h$ hyperplane inequalities in $\mathbb R^t$ are there operations on these polytopes that combine then to give an $v^{\...
1
vote
0answers
34 views
Covering a simplex efficiently by efficiently describable polytopes?
Take a standard simplex or cube in $\mathbb R^n$.
Is there a way to cover it with $O(poly(\log n))$ convex polytopes each describable by only $O(poly(\log n))$ half-plane inequalities?
If not what ...
1
vote
0answers
118 views
Is there a method to cut a hypercube into disjoint cubes [closed]
Since Borsuk conjecture hold for centrally symmetric convex sets in $\mathbb{R}^n$
so we can cut a hypercube into at least $n+1$ disjoint parts.
Is there a method how can one do that?
1
vote
1answer
90 views
Projections of particular simplex yielding boundary of a regular polygon?
What is the maximum $m$ such that there is a simplex with $n$ vertex points in $n-1$ dimensions whose projection yields boundary of a regular $m$-gon on $2D$ plane?
6
votes
0answers
86 views
Tiling with Horn's polytopes
Let $n\ge2$ be an integer. Consider the hyperplane $H_n$ of ${\mathbb R}^n$ defined by the equation $x_1+\cdots+x_n=0$ and then the sector $P_n\subset H_n$ defined by the inequalities $x_1\le\cdots\le ...
1
vote
0answers
31 views
What separates a cyclic polytope from a projective polytope?
I am having trouble understanding the difference between a cyclic polytope and a convex projective polytope as positive geometries.
The link https://arxiv.org/pdf/1703.04541.pdf is the source of ...
2
votes
0answers
38 views
Efficient $H$ representation of matrices with distinct cyclic shift permuted entries
Given points $v_1,\dots,v_n\in\mathbb Z^n$ in codimesion $1$ hyperplane $x_1+\dots+x_n=t$ with $0\leq x_{i}$ and a cyclic shift permutation $\sigma$ where
$v_1,\dots,v_n$ when written as columns of ...
4
votes
1answer
1k views
What does it mean polynomials share Newton polytope?
I have trouble understanding the connection between polynomials and Newton polytopes. I will try to make a short introduction to my problem and hope you will catch on. In the end I will ask questions.
...
7
votes
2answers
171 views
“Totally transitive” polytopes which are not regular
Is it possible to have an abstract polytope which is vertex-transitive, edge-transitive, face-transitive, etc. (individually transitive on faces of each particular dimension) and yet not flag-...
4
votes
0answers
84 views
Reference for this fact about perturbed polytopes?
Let $K \subset \mathbb{R}^n$ be a polytope (i.e., an intersection of finitely many halfspaces that has finite volume) and consider $F(K) := \int_K \|x\|^2\, {\rm d}x$, where $\|\cdot\|$ is the ...
6
votes
1answer
1k views
Approximation of convex hull in high dimension
What are efficient methods (polytime) to compute an approximation of the convex hull in high dimension (say, $30000$) for a given set of points?
Edit:
I am looking for an algorithm for getting the ...
1
vote
1answer
107 views
Derive a vertex representation of a permutohedron from its linear-inequalities form
Let us define the $n$-permutohedron $P_n$ as the set of all $x\in\mathbb{Q}^n$ such that
$$\sum_{i=1}^n x_i = \binom{n{+}1}{2}\ \ \ \land\ \ \ \forall\,\text{nonempty}\ S\subsetneq\mathbb{N}_n\colon\ ...
1
vote
0answers
39 views
Non-negative polynomials $f(p), p\in P$ from Polynomial ideal where $P$ compact polytope?
Partially related to Non-negative Polynomials from Polynomial Ideal? where focus on graph theory but now I want to understand more generally how to determine non-negativity in more general case.
A. ...
1
vote
0answers
83 views
Existence of polytope
Does there exist a polytope in dimensional d consisting of $k>d+1$ faces satisfying that every d faces intersect? I tried 3 dimensional cases, and it seems negative. But is it all negative for any ...
3
votes
0answers
677 views
Testing if a point is inside a convex polytope formed by halfspaces in n-dimension
Assume we have a convex polytope that is formed by the intersection of $k$-halfspaces in $\mathbb{R}^{n}$.
$$
a_{0,0}x^{n-1} + {a}_{0,1}x^{n-2} + ... a_{0,n-1} \leq 0
$$
$$
a_{1,0}x^{n-1} + {a}_{1,...
2
votes
1answer
244 views
Digital topology, animal problem, 2-sphere and torus
I have the following question relating digital topology, surfaces, particularly $S^2$ and torus.
Can a body $B$ constructed with cubes (without cavities or tunnels) and with frontier homeomorphic to ...
11
votes
1answer
342 views
Nonperiodic points of piecewise-linear homeomorphisms
Suppose $K$ is a compact polytope and $T$ is a piecewise-linear homeomorphism from $K$ to itself. Suppose also that $T$ is not of finite order (that is, for no $n \geq 1$ is it the case that $T^n(x)=x$...
1
vote
1answer
193 views
Linear map of Zonotopes [closed]
Consider a linear system with a map $A: \mathbb{R}^n \rightarrow
\mathbb{R}^m$ such that $y = A x$ with $n \geq m$
The input space $x$ is constrained by a zonotope set $\mathcal{X}
\subseteq \mathbb{...
4
votes
2answers
216 views
Build a topological polytope with a specified CW-structure
I am a topologist and not quite familiar with the tools for building a polytope. I would like to build some topological polytope which is an somewhere in between permutohedron and associahedron which ...
2
votes
1answer
115 views
Volume of a polytope with relaxed constraints
Consider a polytope in $n$ dimensions defined by a set of linear constraints:
$$P = \{x \in \mathbb{R}^n : Ax \leq b\}$$
where A is some $m \times n$ constraint matrix, and $b = (b_1,\ldots,b_m)$ is ...
1
vote
0answers
82 views
Does the set of points minimizing their distance to a multiset of convex polytopes result in a polytope?
Let $\mathbb{R}^n$ be a normed affine space of finite dimension $n$, and $d : \mathbb{R}^n \times \mathbb{R}^n \mapsto \mathbb{R}^+$ be the distance derived from the norm under consideration. A convex ...
2
votes
1answer
225 views
Polytopes generated as the convex hull of the orbit of a finite reflection group acting on a given vector
Consider a finite reflection group acting on $\mathbb{R}^N$. Pick a vector $x \in \mathbb{R}^N$ and look at the convex hull of its orbit. This is a polytope.
There are some interesting particular ...
6
votes
1answer
550 views
Generalized permutahedron and random polytopes
The Birkhoff polytope $B_n$ is defined as the convex hull of the set of permutation matrices, which gives us the set of doubly stochastic matrices. A concept which is intimately related is that of the ...
8
votes
1answer
149 views
Labeled polytopes
In a "problem of a week" contest in my school, I gave the following problem to students: we assign to each vertex of a cube a number $1$ or $-1$. And we associate to each face the product of the ...
2
votes
1answer
143 views
Estimates on the number of vertices of reflexive polytopes
Suppose $M \cong \mathbb{Z}^n$ is a rank $n$ lattice, with dual lattice $N$. Suppose $\Delta$ is a full dimensional lattice polytope (i.e. convex hull of finite lattice points) in $M$. Then $\Delta$ ...
17
votes
1answer
747 views
An NP-hard $n$ fold integral
We are given rational numbers $[c_1, c_2, \ldots, c_n]$ and $v$ from the interval $[0,1]$.
Consider the $n$-fold integral
$$
J = \int_{\theta_1 \in I_1, \theta_2 \in I_2 \ldots, \theta_n \in I_n} d\...
2
votes
2answers
1k views
non-convex Polytope definition
I have a simple question. I read that given a vector space $N_{\mathbb{R}}$ over $\mathbb{R}$,
we can define a convex polytope in the following way:
$$P:= \Big\{ \sum_{u\in S} \mu_u u \,\Big| \, \...
7
votes
1answer
425 views
Does every simplicial polytope have a topology-preserving contractible edge?
An edge of a triangulated manifold is said to be contractible if it may be contracted to a vertex without modifying the topological type of the underlying manifold. Otherwise, the edge is ...
5
votes
4answers
762 views
Who knows this convex polytope?
I hope this is not too trivial for this forum. I was wondering if someone has come across this polytope.
You start with the rhombic dodecahedron, subdivide it into four parallellepipeds,
and then ...
