# Tagged Questions

**4**

votes

**1**answer

175 views

### Zoll Flat Finsler tori and convex bodies on a starry night

The starry night. The "celestial sphere" is given by set of non-zero vectors in $\mathbb{R}^n$ modulo positive dilations (i.e., $v \equiv w$ if $v = \lambda w$ for some $ \lambda > 0$) and the ...

**9**

votes

**1**answer

299 views

### Needle probing for a convex body

Suppose there is an unknown closed convex body $K$ of
volume vol$(K) = V$ inside the
unit cube $[-\frac{1}{2}, \frac{1}{2}]^d$ in $\mathbb{R}^d$.
You are permitted to probe with a (one-dimensional)
...

**8**

votes

**0**answers

172 views

### Does there always exist a self dual polytope that contains a given polytope contained in its dual?

Suppose a polytope $P$ is contained in its dual polytope $\tilde{P}$. Does there always exist a polytope $Q$ that contains $P$ and is self dual $Q=\tilde{Q}$? Is there any bound on the minimal number ...

**4**

votes

**1**answer

185 views

### Extreme rays in the cone of (semi)metrics

How many extreme rays are there on the polytopal cone formed by all semimetrics on a set with $n$ elements?
Some background. Given a set $X$ with $n$ elements, the set of all semimetrics
$d:X \times ...

**2**

votes

**2**answers

308 views

### Convex upper bound on a linear-fractional function

I have a function of the form $f(x,y) = \frac{x}{c+y}$ where $c$ is a positive constant, $c \ge x \ge 0$, and $y \ge 0$. I would like to find a convex upper-bound for this function. Is there a ...

**8**

votes

**1**answer

537 views

### Approximating a convex function by a piecewise linear function

Suppose I have a Lipschitz-continuous convex function $f:\mathbb{R}^n\rightarrow \mathbb{R}$. I wish to approximate it on the unit ball by a piecewise-linear function $g:\mathbb{R}^n\rightarrow ...

**4**

votes

**2**answers

287 views

### Realization spaces for regular convex polytopes

Q1.
Are there convex polytopes combinatorially equivalent to each of the regular polytopes
that are realized with integer vertex coordinates?
...

**11**

votes

**1**answer

347 views

### Can all convex polytopes be realized with vertices on surface of convex body?

The following question was asked by me on Mathematics.SE. Unfortunately, no one answered it so I thought I might give it a try one level higher. Below the line you can find the slightly edited ...

**4**

votes

**1**answer

223 views

### Is it possible to sample uniformly on the surface of a high-dimensional polytope?

There are some pretty simple methods to do uniform sampling on the surface of high-dimensional spheres or cubes.
Are there any methods that sample uniformly on the surface of a high-dimensional ...

**2**

votes

**0**answers

221 views

### Minimum solid angle and aspect ratio of an $n$-simplex

In computational geometry and other fields, it is of interest to have degeneracy measures for shapes of simplices, which quantitatively seperate the regular simplex from degenerate simplices.
In two ...

**2**

votes

**2**answers

237 views

### Vertex-transitive polytopes in any dimension with any number of vertices?

Given positive integers $d$ and $v$ with $v \geq d+1$, does there always exist a (convex) vertex-transitive $d$-polytope with $v$ vertices? It seems that the answer should be "obviously" true, but I ...

**5**

votes

**2**answers

521 views

### Finding the convex combination of vertices which yields an inner point of a polytope

Given a convex polytope $P\in \mathbb{R}^n$, and a point $x\in P$, Caratheodory's theorem gives us that there exists a set of at most $n+1$ vertices of $P$, such that $x$ is a convex combination of ...

**1**

vote

**0**answers

137 views

### When is the conical hull of a finite set of vectors a subset of the space? (and tilings)

Consider a hypercube in n-dimensions, and take some projection down to an m-dimensional subspace. Now take all vertices and m-1 dimensional facets visible from some direction outside the projection. ...

**3**

votes

**0**answers

143 views

### An isoperimetric inequality for “order” polytopes

I am looking for an isoperimetric inequality for order-like polytopes.
An order polytope $K\in \mathbb{R}^n$ is defined by a set of linear inequaities:
$$ \forall i \; 0\leq x_i \leq 1 $$
and
$ ...

**7**

votes

**2**answers

427 views

### When does every point in the volume of a polytope lie along a chord between its edges?

Consider the 3-simplex, or tetrahedron, in 3-space. Regardless of the positions of the vertices, every point in the volume defined by the triangular faces of the polytope's skeleton graph can lie ...

**8**

votes

**1**answer

1k views

### About the surface area vs. volume of polytopes

Given a convex body $K\in\mathbb{R}^n$, represented by a set of linear inequalities (intersection of halfspaces), I am interested in understanding how much of its volume can be close to its perimeter ...

**0**

votes

**0**answers

324 views

### Upper and Lower Bounds of the Total Surface Area of Convex Polytopes that Partition a Hypercube

Let $C$ be a hypercube in $\mathbb{R}^D$ with edge length of $L$. Let $\mathcal{P}_1,\ldots,\mathcal{P}_K$ be $K$ convex polytopes that partition $C$. Let $S_k$ be the surface area of the polytope ...

**2**

votes

**2**answers

471 views

### Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center

Does this already exist in literature? The closest Ive been able to find is circumscribe intersection of two ellipsoids with a common center by W. Kahan ...

**2**

votes

**1**answer

281 views

### Angle btween Coordinate Vector and Normal Vector of Facet in a Convex Polytope, Asking for a Counterexample

Definitions
Let $\mathcal{C}$ be a convex polytope in $\mathbb{R}^{D}$ with $K$-facets
$F_{1},\ldots,F_{K}$. I denote the normal vector of the $k^\mathrm{th}$ facet as
...

**7**

votes

**3**answers

623 views

### Not quite regular polyhedra

Take a naive interpretation of regular polyhedra:
All vertices (including epsilon ball) congruent
All edges congruent
All faces congruent
We can now find interesting families by removing one ...

**5**

votes

**1**answer

296 views

### Recovering a polyhedron from its tumble-density profile

Imagine a white convex polyhedron $P$ tumbling randomly about its fixed center of gravity (c.g.)
$c$ against a blue background.
A long-exposure photo would show pure white in a neighborhood of $c$
...

**8**

votes

**1**answer

580 views

### Optimal 8-vertex isoperimetric polyhedron?

I know from Marcel Berger's
Geometry Revealed:
A Jacob's Ladder to Modern Higher Geometry
(p.531)
that it is not yet established which polyhedron in $\mathbb{R}^3$
on 8 vertices achieves the optimal ...

**7**

votes

**2**answers

651 views

### Regular polygon shadows of convex polyhedra

Fix a finite subset $S$ of the natural numbers $\mathbb{N}$, each element $\ge 3$.
Is there a convex polyhedron $P$ that has among its shadows
regular $n$-gons for each $n \in S$? Does such a ...

**14**

votes

**1**answer

572 views

### Totally rational polytopes

Define a convex polytope in $\mathbb{R}^d$ as
totally rational (my terminology)
if its vertex coordinates are rational, its edge lengths
are rational, its two-dimensional face areas are rational, ...

**12**

votes

**3**answers

633 views

### Is there a midsphere theorem for 4-polytopes?

The (remarkable) midsphere theorem says that each combinatorial
type of convex polyhedron may be realized by one all of whose edges are
tangent to a sphere
(and the realization is unique if the center ...

**4**

votes

**1**answer

390 views

### Embed the intersection of an n-dimensional unit $L_1$ sphere and a hyperplane into an (n-1)-dimensional unit $L_1$ sphere.

In $\mathbb{R}^n$, given an unit $L_1$ sphere $\mathcal{B}_n: |x_1|+|x_2|+\ldots+|x_n|\leq 1$ and a hyperplane $\mathcal{P}: a_1x_1+a_2x_2+\ldots+a_nx_n=0$. Does there always exist a rotation such ...

**7**

votes

**1**answer

355 views

### The volume of the “unit ball” in $\mathbb{R}^{m\times n}$ with respect to the cut norm

This question is inspired by the question “ε-nets with respect to the cut norm” by the user Aaron, which had been reposted to cstheory.stackexchange.com.
The cut norm ||A||C of a matrix A=(aij)∈ℝm×n ...

**8**

votes

**2**answers

326 views

### Do singular values of a point set determine its shape?

Suppose I have $k$ points in $d$ dimensions. Let A be a $k\times d$ matrix with $i$th row giving the coordinates of $i$th point. Do singular values of this matrix have an interpretation as some kind ...

**2**

votes

**3**answers

317 views

### Can we uniquely define a graph to have the topology of a polytope via proper edge length selection?

I'll ask you to consider a situation wherein one has a series of edges for a graph, $(e_1, e_2, ..., e_N) \in E$, each with a specifiable length $(l_1, l_2, ..., l_N) \in L$, and the goal is to insure ...

**43**

votes

**8**answers

5k views

### Fair but irregular polyhedral dice

I am interested in determining a collection of geometric conditions that will guarantee that a convex polyhedron
of $n$ faces is a fair die in the sense that, upon random rolling, it has an equal ...

**11**

votes

**5**answers

1k views

### On the number of Archimedean solids

Does anyone know of any good resources for the proof of the number of Archimedean solids (also known as semiregular polyhedra)?
I have seen a couple of algebraic discussions but no true proof. Also, ...

**11**

votes

**2**answers

800 views

### Are the Platonic solids shadows of 4-polytopes?

Say that a 3D shadow of a 4-polytope is a parallel projection to 3-space, not necessarily orthogonal to that 3-space (that would make it an orthogonal projection).
I am wondering if each of the five ...

**9**

votes

**2**answers

1k views

### How many non-equivalent sections of a regular 7-simplex?

Suppose we have a regular 7-simplex in $\mathbb{R}^8$ defined by vertices <1,0,0,...,0>, <0,1,0,..,0>,...,<0,...,0,1>. A section is a 3-dimensional linear subspace of $\mathbb{R}^8$ that ...

**5**

votes

**1**answer

635 views

### Which (semi)regular polyhedra are combinations of two others?

The convex combination of convex polytopes is a convex polytope.
An example in $\mathbb{R}^2$ is that a regular octagon
can be obtained as $\frac{1}{2} S + \frac{1}{2} S'$,
where $S$ is a square and ...

**3**

votes

**1**answer

336 views

### Connections between a polytope's symmetry group and the existence of periodic orbits

Given an $n$-dimensional convex polytope $P$, one may set into motion a point-mass, starting on one of the facets of $P$, which travels along a straight trajectory inside $P$ except on collision with ...

**11**

votes

**5**answers

723 views

### A characterization of convexity

While doing some research on polytopes I came to the following question. Maybe it's already somewhere but anyway I'll post it here.
Let $X\subset \mathbb{R}^3$ be such that, for every plane $P$, ...

**5**

votes

**6**answers

869 views

### Database of polyhedra

As part of many hobbies (origami, sculpting, construction toys) I often find myself building polyhedra from regular polygons. I am intimately familiar with all of the Archimedean and Platonic solids, ...

**1**

vote

**1**answer

375 views

### Is the direction of the longest line of a polytope unique?

The question pertains to a polytope that is generated by the intersection of an affine subspace with a hypercube in $p$ dimensions.
The affine subspace is given by:
$X \mbox{ u} = y$
where
$u$ ...

**3**

votes

**1**answer

319 views

### Convex n-polytope general position vectors to general position vectors of tetrahedron.

I asked this question in a comment to this question, but got no response. I thought that perhaps it needed more exposure, so I made it a question in itself.
Define a set of general position vectors ...

**0**

votes

**2**answers

1k views

### Break Polyhedron into Tetrahedron

Given a polyhedron consists of a list of vertices (v), a list of edges (e), and a list of surfaces connecting those edges (...

**7**

votes

**2**answers

572 views

### What is known about polyhedra nets that allow overlapping?

It is an open problem that the net of any convex polyhedron can be unfolded onto a flat plane with no overlapping. Is anything known if we allow x faces to overlap? For example, is it known if any ...

**3**

votes

**3**answers

266 views

### Are there infinite sets of stellations of polyhedra?

Lists of stellations of polyhedrons are given particular rules like in the book The Fifty Nine Icosahedra which follows "Miller's Rules".
There seems to be no "correct" ruleset to use, so more ...