Related papers: Hunting for reduced polytopes
We show that 3-dimensional polyhedral manifolds with nonnegative curvature in the sense of Alexandrov can be approximated by nonnegatively curved 3-dimensional Riemannian manifolds.
The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and…
We extend to the anisotropic setting the existence of solutions for the Kirchhoff-Plateau problem and its dimensional reduction.
In this paper, based on the theory of surfaces in the four-dimensional Euclidean space which generalizes the theory of surfaces in three-dimensional Euclidean space, beside other results, we will give a characterization of points on…
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…
We consider the focusing cubic NLS in the exterior $\Omega$ of a smooth, compact, strictly convex obstacle in three dimensions. We prove that the threshold for global existence and scattering is the same as for the problem posed on…
This paper concentrates on the homogeneous (conformal) model of Euclidean space (Horosphere) with subspaces that intuitively correspond to Euclidean geometric objects in three dimensions. Mathematical details of the construction and…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.
We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…
We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set $S$ of points into some space-efficient data structure such that when a query range $Q$ is specified, the…
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…
An important problem in gas and fluid dynamics is to understand the behavior of vacuum states, namely the behavior of the system in the presence of vacuum. In particular, physical vacuum, in which the boundary moves with a nontrivial finite…
We study possible Lie and non-classical reductions of multidimensional wave equations and the special classes of possible reduced equations - their symmetries and equivalence classes. Such investigation allows to find many new conditional…
We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…
The Kneser-Poulsen conjecture says that if a finite collection of balls in a d-dimensional Euclidean space is rearranged so that the distance between each pair of centers does not get smaller, then the volume of the union of these balls…