Questions tagged [convex-polytopes]
Convex polytopes are the convex hulls of a finite set of points in Euclidean spaces. They have rich combinatorial, arithmetic, and metrical theory, and are related to toric varieties and to linear programming
916
questions
0
votes
1
answer
76
views
Convex sets via fixed point equations
I have an equation of the general form
$$ X = S \cup T X $$
where $S \subset \mathbb R^n$ is a convex polytope (given by its bounding hyperplanes), $T\colon \mathbb R^n \to \mathbb R^n$ is a linear ...
4
votes
1
answer
278
views
Intrinsic definition of a cone in a normal fan
Let $P\subseteq \mathbb{R}^n$ be a full dimensional polytope. Let us assume that $P$ has a facet description with the following inequalities:
$$ \left<x,u_F\right> \geq -a_F$$
where $u_F\in \...
10
votes
1
answer
294
views
Is a convex polyhedron determined by its edge lengths and angular defects?
Let's consider 3-dimensional convex polyhedra $P\subset\Bbb R^3$.
The angular defect at a vertex $v$ is $2\pi$ minus the sum of the interior angles of the incident faces at $v$.
Question:
Is a ...
1
vote
0
answers
37
views
Polyhedra inscribed in a sphere with mutually non-congruent, equal area faces
Two constrained versions of the main question given in this post: Polyhedrons with mutually non-congruent faces, all of equal area. An earlier post that could be related: Cutting a spherical surface ...
1
vote
0
answers
92
views
Homeomorphism between interiors of simplex and permutohedron
The $n$-dimensional permutohedron $P_n$ is a polytope whose facets (i.e.\ codimension $1$ faces) are in 1-to-1 correspondence with all faces (of codimension${}\geq 1$) of the $n$-simplex $\Delta_n$, ...
6
votes
2
answers
1k
views
Extreme points of transportation polytope
I'm interested in $n \times m$ joint probability tables with prescribed row and column marginals. Such tables form a convex set known as the transportation polytope. What are the extreme points of ...
16
votes
0
answers
288
views
Realization spaces of 3-dimensional polytopes with fixed face areas
It is a well-know result (Steinitz, 1922) that the realization space of 3-dimensional convex polytopes with fixed combinatorics is contractible.
A proof of this theorem can be found for instance in ...
7
votes
3
answers
599
views
A continuous version of Carathéodory's convex hull theorem
A well-known theorem of Caratheodory states that any point in the convex hull of a set $X\subset R^n$ lies in the convex hull of at most $n+1$ points of $X$. I am wondering about a version of this ...
0
votes
0
answers
61
views
Using Ehrhart polynomials to count primes?
As indicated below, one could use the Ehrhart polynomials of the simplex in number theory.
Here are the questions without context first:
Questions:
The sum $$\sum_{k=0}^t (-1)^k ( \operatorname{...
6
votes
0
answers
186
views
Zero-one pairings between sets of vectors
Let
$A\subseteq V$ and
$B\subseteq V^\star$
be spanning sets in
a finite-dimensional real vector space $V$ and
its dual $V^\star$.
Suppose that
$$
\langle b,a\rangle\in\lbrace0,1\rbrace
$$
for all
$a\...
19
votes
2
answers
7k
views
How many vertices can a convex polytope have?
One has an $n$-dimensional convex polytope $P$ represented by an intersection of half-spaces:
\begin{equation}H_i = \{ (x_1,x_2, \ldots,x_n) \in \mathbb{R}^n \mid \sum_{j=1}^n a_{ij} x_j \ge a_{i0}, \...
3
votes
0
answers
92
views
Does there exist a finite-volume hyperbolic Coxeter polytope with these properties?
I searched for a finite-volume, hyperbolic Coxeter polytope of dimension $n \geq 4$ with the following properties $a$ and $b$.
$a$) It has exactly one ideal vertex;
$b$) if a bounded facet and an ...
3
votes
0
answers
88
views
Sampling uniformly from the convex cone
Let $n$ vectors of dimension $d$ (e.g., $n = 100$, $d = 10000$), each with infinity norm of $1$, be given. The conic combination of those $n$ vectors generates a convex cone.
How to uniformly sample ...
2
votes
0
answers
59
views
Eulerian polynomial from Bruhat interval - h* of something?
Let $\sigma \in S_n$ be a fixed permutation.
Consider the polynomial
$$
P_{\sigma}(t) = \sum_{\substack{\pi \in S_n \\ \pi \leq \sigma}} t^{\textrm{des}(\pi)}
$$
where $\leq$ denotes Bruhat order, and ...
16
votes
1
answer
705
views
Inequalities for marginals of distribution on hyperplane
Let $H = \{ (a,b,c) \in \mathbb{Z}_{\geq 0}^3 : a+b+c=n \}$. If we have a probability distribution on $H$, we can take its marginals onto the $a$, $b$ and $c$ variables and obtain three probability ...
11
votes
1
answer
514
views
How to correctly state Cauchy's rigidity theorem?
Cauchy's rigidity theorem is usually cites briefly as
Any two (convex, 3-dimensional) polyhedra with pairwise congruent faces are themselves congruent.
As a more formal generalization to general ...
0
votes
1
answer
163
views
Density of the set of convex polygons in the Banach-Mazur distance
Is the set of convex polygons dense in the set of convex domains in $\mathbb{R}^2$, for the Banach-Mazur distance?
Any insight for a negative or positive answer is very much welcome!
3
votes
0
answers
49
views
Volume of all Voronoi cells in n-dimensional bounded space
How can one find the volume of all Voronoi cells (bounded and unbounded) in an $n$-dimensional bounded space? For instance, consider an $N$-dimensional space (hypercube) with bounds on each dimension ...
0
votes
0
answers
54
views
existence of moment maps for non-nef toric varieties
The noncompact toric variety $X_1 = \operatorname{Tot} \mathcal{O}(-1) + \mathcal{O}(-1) \to \mathbb{CP}^1$, the total space of the sum of two line bundles over the complex line, is defined as the ...
2
votes
0
answers
123
views
How to sample uniformly over a polytope knowing its vertex presentation?
Say that a convex polytope $P$ is presented as $P = \mathrm{Conv}(v_1, \dots , v_m)$.
I would like to sample over $P$, without generating the facet presentation of the polytope.
How can I do that?
I ...
4
votes
2
answers
210
views
On faces of polytopes
$\newcommand\ext{\operatorname{ext}}\newcommand\R{\mathbb R}$Let $A$ be a convex polytope in $\R^n$ with nonempty interior.
Consider the closed convex cone
$$K_A:=\{(l,t)\in(\R^n)'\times\R\colon\, l(x)...
2
votes
1
answer
145
views
Conic hull of a rectangle
I have a simple question that appeared in research: For a rectangle $S :=[a_1,b_1] \times[a_2,b_2] \times \dots \times [a_n,b_n] \subset \mathbb{R}^n$. Let $p_0 = (a_1,a_2,\dots,a_n)$, and define $p_i ...
4
votes
1
answer
171
views
Denominators of rational polytopes in terms of hyperplane coefficients
Let $\mathcal{P}$ be a convex polytope in $\mathbb{R}^n$ given in the form $\mathcal{P} = \{ x \in \mathbb{R}^n\colon A x\leq b \}$. Suppose that the entries of $A$ and $b$ are integers. Then it is ...
3
votes
0
answers
120
views
Does this construct Platonic solids?
Consider $\mathrm{O}(3)\curvearrowright\mathbb{R}^3$. Let $\Gamma\subseteq\mathrm{O}(3)$ be a finite group. Let $x\in \mathbb{R}^3\setminus\{0\}$ be a point such that $\mathrm{Stab}_\Gamma(x)$ has ...
2
votes
0
answers
45
views
Estimating the Hausdorff distance of parallel facets of convex polytopes
Background
Let $\mathcal{K}_P^n$ denote the class of open, convex, $n$-dimensional polytopes in $\mathbb{R}^n$ containing the origin. For each $K\in \mathcal{K}_P^n$, its gauge function $f_*:\mathbb{R}...
0
votes
0
answers
62
views
Looking for a homogeneous function with some properties
I'm looking for a 1-homogeneous function $\pi \colon \mathbb{R}^n_{\geq 0} \to \mathbb{R}$ satisfying the following properties:
1) $\pi$ is not concave. This is equivalent to the fact that there ...
4
votes
1
answer
279
views
Does Kalai's $3^d$ conjecture hold for simplicial spheres?
Kalai's $3^d$ conjecture asserts that every centrally symmetric $d$-polytope has at least $3^d$ non-empty faces. This is open in general, but has been proven for simplicial polytopes.
Question: Does ...
3
votes
1
answer
34
views
A converse question about the polyhedrality under linear mapping
It is quite well known that for any polyhedral set $K$ and any linear mapping $A$, the set $AK$ is polyhedral and hence closed. I am more curious about the converse problem, namely:
Suppose $K$ is a ...
2
votes
1
answer
111
views
Is the problem of vertex enumeration from an H-representation of a polytope NP-hard?
According to the Wikipedia page on the issue, the vertex enumeration problem is NP-hard.
However, double description and reverse linear search are algorithms listed to solve the problem. Moreover, ...
10
votes
1
answer
3k
views
Computionally efficient vertex enumeration for (convex) polytopes
Let $P \subseteq \mathbb{R}^d$ be an $\mathcal{H}$-polytope. The vertex enumeration problem asks for the set of vertices $V$ of $P$. Theoretically, the vertex enumeration problem for $P$ can be ...
6
votes
2
answers
237
views
"Minimal" connected matroids
I'm interested in connected matroids $M$ on the ground set $[n]$ for which there is no connected matroid on $[n]$ of the same rank but with a strictly smaller set of bases (by inclusion). Equivalently,...
0
votes
0
answers
88
views
Which polytopes can be folded to an edge?
While playing with bar-and-joint linkages, I noticed that the skeleton of a regular 3-dimensional cube can be folded to a single edge (this can be achieved by first flexing the cube to bring it to a ...
3
votes
1
answer
99
views
Does a matroid base polytope contain its circumcenter?
Let $(X,\mathcal B)$ be a matroid on the ground set $X=(x_1,...,x_n)$ and with set of bases $\mathcal B$, and let $P\subset\Bbb R^n$ be its matroid base polytope (i.e. the convex hull of the ...
1
vote
0
answers
135
views
References/applications/context for certain polytopes
First, let's consider an almost trivial notion. With any subspace $V\subset \mathbb R^n$ we associate a convex polytope $P(V)\subset V^*$ as follows. Each of the $n$ coordinates in $\mathbb R^n$ is a ...
9
votes
2
answers
312
views
Are there centrally-symmetric self-dual polytopes in dimension $d> 4$?
A convex polytope $P\subset\Bbb R^d$ is centrally symmetric if $-P=P$. It is self-dual (or better, self-polar?) if its polar dual $P^\circ$ is congruent to $P$, that is, there is a map $X\in\mathrm O(\...
1
vote
2
answers
369
views
Algorithm to find a facet of a polyhedron given the vertices?
I have a set of points $X=\{x_1,\ldots,x_N\}$ on the unit sphere in $\mathbb{R}^d$ ($N>d\ge 3$). What is an algorithm to find any facet of the polyhedron whose vertices are $X$?
The set $X$ has ...
8
votes
2
answers
336
views
Permutohedron and triangulation of cube via Eulerian numbers
The $h$-vector of the (simplicial complex given by the boundary of the polytope dual to the) permutohedron is the sequence of Eulerian numbers $A(n,k)=\#\{w\in S_n\colon \mathrm{des}(w)=k\}$.
Example: ...
0
votes
0
answers
37
views
Basis of monoid of integral vectors
Suppose that $M\in\mathbb{Z}^{n\times k}$ is a matrix of rank $k<n$. How can I obtain a set of vectors $b_1,\ldots,b_k\in\mathbb{Z}^k$ (if exists) such that each row of $M$ is a non-negative ...
1
vote
0
answers
156
views
Membership test of convex set
Let $K$ be a compact convex subset of $R^n$ which has some positive gaussian measure, say at least 1/2. For each nonzero vector $u \in R^n$, we
define another compact convex set $K * u$ in the ...
10
votes
2
answers
790
views
Largest regular $k$-simplex inscribed in a $d$-cube, $k < d$
The largest (by edge length) regular simplex inscribed in a unit cube
is well known in $\mathbb{R}^2$ and $\mathbb{R}^3$:
Image sources:
left: NMSU,
right: Mathworld.
A recent Amer ...
34
votes
16
answers
7k
views
Generalizations of the Birkhoff-von Neumann Theorem
The famous Birkhoff-von Neumann theorem asserts that every doubly stochastic matrix can be written as a convex combination of permutation matrices.
The question is to point out different ...
0
votes
1
answer
89
views
On the extreme points of two convex sets
Let $A$ and $B$ be two compact convex sets (which may be assumed to be polytopes) in $\mathbb R^n$ such that $A\cap B\ne\emptyset$. Is it then always true that either $A\cap\text{ext}B\ne\emptyset$ ...
1
vote
0
answers
59
views
$\psi_2$ marginals of the permutahedron?
Let $K$ be a convex body.
I in particular care about the permutahedron.
I will view this as being the convex hull of all coordinate-wise permutations of the vector
$$v = \frac{1}{2n+2}(-n, -n+2,\dots, ...
1
vote
0
answers
71
views
Factorising a multivariate polynomial, in terms of products of linear polynomials, using blowups
I am considering multivariate polynomials of the form
$$f(x,y)=x^a\,y^b\,p(x,y)^c$$
(and similarly for higher dimensions). I am trying to transform these polynomials into the generic form
$$\widetilde{...
9
votes
1
answer
791
views
Combinatorics for the action of Virasoro / Kac–Schwarz operators: partition polynomials of free probability theory
In the background sections below, I establish the relations among characterizations of the action of Virasoro / Kac–Schwarz operators of 2D gravity models presented in terms of Laurent series by ...
9
votes
1
answer
302
views
The convex hull of Schur polynomial evaluations
Let $r\leq n$ and $d$ be positive integers. A probability vector is a vector of non-negative entries that sum to 1. For each probability vector $\lambda$ of length $n$, let
$$s(\lambda)=(\dim[\pi] \...
0
votes
0
answers
22
views
Reference on high dimensional polytopes with E8 symmetry
I'm starting to work with high dimensional polytopes. I am interested in uniform polytopes of 16-dimension and of 8-dimension (especially Elte and Gosset polytopes that have E8 symmetry).
...
2
votes
0
answers
63
views
Sampling theorems for partition polynomials (associahedra, noncrossing partitions / parking functions)
Define the associahedra partition polynomial
$$
\begin{split}
A(x) &= 1 + A_1(u_1) z + A_2(u_1,u_2) z^2 + A_3(u_1,u_2,u_3) z^3 + \cdots\\
& \qquad\qquad = 1 + \sum_{n \geq 1} A_n(u_1,...,u_n) ...
0
votes
1
answer
114
views
How can I find the hyperplane passing through a 600-cell
I have a 600-cell, whose coordinates are given by
$$\begin{array}{ccc}
\text{8 vertices} & \left(0,0,0,\pm1\right) & \text{all permutations,}\\
\text{16 vertices} & \frac{1}{2}\left(\pm1,\...
2
votes
2
answers
1k
views
Mathematical tools appropriate to analyse convex polyhedra
What mathematical tools (means: set of areas of mathematical knowledge) are appropriate to begin with to analyse (to enumerate face vectors associated with polyhedron, to calculate the combinatorial ...