相关论文: Radii of regular polytopes

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.

We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.

We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…

In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron…

It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…

In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in…

In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.

For any odd prime $p$ and any integer $N\ge 0$, let $\mathcal{V}(p,N)$ be the set of vertices of the cyclotomic box $\mathscr{B} = \mathscr{B}(p,N)$ of edge size $2N$ and centered at the origin $O$ of the ring of integers…

Take $A$ to be a regular quadratic algebra of global dimension three. We observe that there are examples of $A$ containing a dimension three regular cubic algebra $C$. If $B$ is another dimension three regular quadratic algebra, also…

We study the geometry of Outer Space $CV_n$ in regard of the asymmetric Lipschitz metric via envelopes, that is the set of all geodesics between two points. In the simplicial structure of $CV_n$ the envelopes are polytopes. We construct a…

This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…

K3 polytopes appear in complements of tropical quartic surfaces. They are dual to regular unimodular central triangulations of reflexive polytopes in the fourth dilation of the standard tetrahedron. Exploring these combinatorial objects, we…

In (the surface of) a convex polytope P^3 in R^4, an area-minimizing surface avoids the vertices of P and crosses the edges orthogonally. In a smooth Riemannian manifold M with a group of isometries G, an area-minimizing G-invariant…

There is a basic paradigm, called here the radius of well-posedness, which quantifies the "distance" from a given well-posed problem to the set of ill-posed problems of the same kind. In variational analysis, well-posedness is often…

This paper considers the radii functionals (circumradius, inradius, and diameter) as well as the Minkowski asymmetry for general (possibly non-symmetric) gauge bodies. A generalization of the concentricity inequality (which states that the…