相关论文: Radii of regular polytopes
We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…
In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…
Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions of Minkowski sums of simplices support minimal cellular resolutions. They asked if the regularity condition can be removed. We give an…
We give a characterization of closed, simply connected, rationally elliptic 6-manifolds in terms of their rational cohomology rings and a partial classification of their real cohomology rings. We classify rational, real and complex homotopy…
To an $\mathbb{R}$-tree in the boundary of Outer space, we associate two simplices: the simplex of projective length measures, and the simplex of projective dual currents. For both kinds of simplices, we estimate the dimension of maximal…
We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…
The present paper aims to solve some problems proposed by Lassak about the reduced spherical polygons. The main result is to show that the regular spherical n-gon has the minimal perimeter among all reduced spherical polygons of fixed…
It is known that every closed curve of length \leq 4 in R^n (n>0) can be surrounded by a sphere of radius 1, and that this is the best bound. Letting S denote the circle of circumference 4, with the arc-length metric, we here express this…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
We discuss the notions of circumradius, inradius, diameter, and minimum width in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space…
In 1973, J. Moser proposed that his Twist Theorem could be used to show that orbits of the outer billiards map on a sufficiently smooth closed curve were always bounded. Five years later Moser asked the same question for a convex polygon.…
A simplex is the convex hull of $n+1$ points in $\mathbb{R}^{n}$ which form an affine basis. A regular simplex $\Delta^n$ is a simplex with sides of the same length. We consider the billiard flow inside a regular simplex of $\mathbb{R}^n$.…
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…
In this paper, the gravitational field equations for static spherically symmetric perfect fluid models with a polytropic equation of state, $p=k\rho^{1+1/n}$, are recast into two complementary 3-dimensional {\it regular} systems of ordinary…
We investigate small covers and quasitoric over the duals of neighborly simplicial polytopes with small number of vertices in dimensions $4$, $5$, $6$ and $7$. In the most of the considered cases we obtain the complete classification of…
We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
We study ordered configuration spaces of $n$ hard discs inside a unit disc, and how the topology changes with the radius $r$ of the hard discs. We describe the full homotopy type of this space for all radii when $n = 4$ and exhibit…