Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes sharing a common facet is convex. We prove that the real projective structure on…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “convex polytopes”
Smooth approximations bound dihedral angles of convex polytopes.
problem Bounding dihedral angles of convex polytopes.
method Approximating polytopes with smooth hypersurfaces and using geometric relations.
result Established lower bounds on dihedral angles.
Diffeomorphisms of convex polytopes form a Lie group.
problem Understanding transformations of convex polytopes.
method Forming a Lie group from diffeomorphisms of convex polytopes.
result The group of diffeomorphisms of a convex polytope is a regular Lie group.
Contact manifolds' momentum polytopes are convex.
problem Understanding the structure of contact manifolds.
method Using isomorphism to toric varieties.
result Momentum polytopes of contact manifolds are convex.
Unique floating and buoyancy surfaces identify convex polytopes.
problem Identifying convex polytopes from their flotation and buoyancy surfaces.
method Proving uniqueness of surfaces for polytopes with uniform or prescribed density.
result Floating and buoyancy surfaces uniquely determine convex polytopes.
The study proves curvature rigidity for convex polytopes.
problem Proving curvature rigidity for convex polytopes.
method Using Fredholm theory for Dirac operators and a theorem of Fefferman and Phong.
result Scalar curvature rigidity theorem for convex polytopes proved.
Researchers prove rigidity of convex polytopes in hyperbolic space using spinor techniques.
problem Proving rigidity of convex polytopes in hyperbolic space.
method Spinor techniques and recent smoothing constructions of Brendle-Wang.
result Scalar curvature rigidity for parabolic convex polytopes in hyperbolic space.
We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes…
Polytopes in high dimensions have at least 2n+4 normals.
problem Understanding normals to convex polytopes in high dimensions.
method Proved for generic simple polytopes in R^n, n>3.
result Each polytope contains a point with at least 2n+4 normals.
The study confirms conjectures about normals to convex polytopes in 3D space.
problem Concurrent normals problem for convex polytopes in 3D.
method Analyzes the PL concurrent normals problem for convex polytopes, proving conjectures for specific cases.
result Polytopes in 3D have points with 10 normals from interior points, confirmed for all tetrahedra and triangular prisms.
New method uses random convex polytopes to measure representation quality.
problem Measuring the quality of deep learning representations.
method Random Polytope Descriptor method based on random convex polytopes.
result Regularization in autoencoders can degrade out-of-distribution detection.
We show that any compact convex simple lattice polytope is the moment polytope of a Kähler-Einstein orbifold, unique up to orbifold covering and homothety. We extend the Wang-Zhu Theorem \cite{WZ} giving the existence of a Kähler-Ricci soliton on any toric monotone manifold on any compact convex simple labelled polytop…
Smooth deformation space of Coxeter polytopes proven for orderable orbifolds.
problem Proving smoothness of deformation space for Coxeter polytopes.
method Analyzing natural map into realization space.
result Deformation space of Coxeter 3-polytopes is smooth.
A note on Kalai's Conjecturemath.CO
The paper proves a convex polytope conjecture with specific symmetry conditions.
problem Proving Kalai's 3^d conjecture for centrally symmetric polytopes.
method Using hyperplanes with orthogonal normal vectors to prove the conjecture.
result The conjecture is proven if the polytope is symmetric about multiple hyperplanes.
Proof of Gromov's theorem on convex polytopes with acute angles.
problem Gromov's conjecture on extremal scalar curvature of convex polytopes.
method Smoothing construction using Dirac operator techniques.
result Detailed proof of Gromov's theorem.
Analyzes vector fields in polytope decompositions, proving curve finiteness.
problem Analyzing vector fields in polytope decompositions.
method Proves integral curves are chopped into finitely many pieces by polytope decompositions.
result Finiteness of edge flips in discrete Yamabe flow.
We prove that the Hilbert Geometry of a convex set is bi-lipschitz equivalent to a normed vector space if and only if the convex is a polytope.
Convex polytope trees expand decision trees with interpretable boundaries.
problem High accuracy often requires many nodes in decision trees, reducing interpretability.
method CPT uses logical disjunction of weighted linear decision-makers, geometrically a convex polytope.
result CPT achieves high accuracy with fewer nodes compared to existing methods.
The paper studies deformation spaces of Coxeter truncation polytopes.
problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension .
Examines nonrational polytopes and fans in toric geometry.
problem Understanding nonrational convex polytopes and fans in toric geometry.
method Discussion and interrelation of recent developments.
result Exploration of nonrational polytopes and fans in toric geometry.
Optimal weight windows are found by projecting the origin onto a convex polytope.
problem Finding the best weight windows for a weighted moving average smoother.
method Formulated as a quadratic program and projection onto a convex polytope.
result Optimal weight windows are symmetrical and decrease in weight away from the center.
Proves rigidity for specific initial data sets under the dominant energy condition.
problem Rigidity of initial data sets with boundary and convex polytopes.
method Solution of boundary value problems for Dirac operators and approximations by manifolds with smooth boundary.
result Proves rigidity for compact smooth spin manifolds and convex polytopes under the dominant energy condition.
This paper is a survey on the Lickorish type construction of some kind of closed manifolds over simple convex polytopes. Inspired by Lickorish's theorem, we propose a method to describe certain families of manifolds over simple convex polytopes with torus action. Under this construction, many classical classification r…
Study on volumes of random inscribed polytopes in projective geometries.
problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
Finite volume Coxeter polytopes are quasiperfect and related to finite covolume reflection groups.
problem Characterizing finite volume Coxeter polytopes and their relation to reflection groups.
method Analyzing Coxeter polytopes and their volumes within Vinberg domains.
result Finite covolume reflection groups are characterized by the Vinberg domain.
It is shown that the Hilbert metric on the interior of a convex polytope is bilipschitz to a normed vector space of the same dimension.
Proves stability in Weyl polytopes using optimal transport.
problem Stability of Weyl polytopes under optimal transport.
method Optimal transport stability for reflexive Weyl polytopes.
result Weak metric SYZ conjecture holds for Delzant reflexive Weyl polytopes.
We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and combinatorial structure. Our results are applied in spherical and hyperbolic space. This…
If we fix the angles at the vertices of a convex planar -gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of edge lengths form a convex polytope of dimension , each facet of which consists of those -gons in which…
Minimal triangulations of spheres map almost linearly to boundaries of high-dimensional polytopes.
problem Finding the minimum number of vertices for triangulations of spheres that map to high-dimensional boundaries.
method Analyzing triangulations of -spheres and their maps to boundaries of -simplexes, focusing on .
result The function is almost linear in as .
The study finds all possible 3D polytopes in Riemannian 3-manifolds with positive scalar curvature.
problem Understanding the combinatorial types of 3D polytopes in specific Riemannian manifolds.
method Analysis of mean curvature convex Riemannian polyhedra with non-obtuse dihedral angles in positive scalar curvature 3-manifolds.
result Determination of combinatorial types of 3D simple convex polytopes.
Generalizes rigidity of scalar curvature for convex domains.
problem Rigidity of scalar curvature for convex domains.
method Harmonic spinors on convex domains with boundary conditions constructed by Brendle.
result Rigidity results on comparison of scalar curvature and scaled mean curvature on the boundary for any convex domain.
The paper proves consistency of archetypal analysis for multivariate data.
problem Finding optimal archetype points for multivariate data.
method Uses convex polytope to summarize data, proving consistency under specific distribution assumptions.
result Archetype points converge to optimal solution under certain conditions.
Proves weight polytope matches with energy vectors in toric varieties.
problem Understanding the relationship between weight polytopes and energy functionals in toric varieties.
method Combines two slope formulas of K-energy in the toric setting.
result Weight polytope of Hurwitz form matches with convex hull of characteristic vectors.
The study broadens the concept of cyclic polytopes to Veronese polytopes.
problem Extending the framework of cyclic polytopes to a broader class of polytopes.
method Described facial structure and combinatorial characterisation of facets via σ-parity alternating sequences.
result Established a bijective correspondence between combinatorial types of Veronese polytopes and partitions of finite sets.
Reconstructing polytopes with fixed facet directions from support function evaluations.
problem Reconstructing polytopes with known facet directions from limited data.
method Least-squares estimate via convex quadratic program, combinatorial characterization for uniqueness, algorithm convergence.
result The least-squares estimate for a fixed simplicial normal fan is a convex quadratic program, and the solution is unique under certain conditions.
In this paper, we investigate the topology of a class of non-Kähler compact complex manifolds generalizing that of Hopf and Calabi-Eckmann manifolds. These manifolds are diffeomorphic to special systems of real quadrics in which are invariant with respect to the natural action of the real torus $(\Bbb S^1)^n…
Study real projective structures on a specific Coxeter orbifold.
problem Characterize real projective structures on a noncompact Coxeter orbifold.
method Embedding and extending a Coxeter quadrilateral, perturbing to form a convex polytope, and analyzing the deformation space.
result Determine the detailed properties of the deformation space of real projective structures on the orbifold.
Unified cosmological and Einstein polytope theories.
problem Unified understanding of cosmological and Einstein polytope theories.
method Unified combinatorial perspective of cosmological and Einstein polytope theories.
result Unified construction of cosmological and Einstein polytope theories.
Least Squares Estimators are suboptimal for 5D convex functions.
problem Suboptimality of Least Squares Estimators in estimating multidimensional convex functions.
method Analysis of natural subclasses of convex functions in random and fixed design settings.
result Risk of LSE is while minimax risk is for .
Sharp bounds found for various risk measures using generalized FGM copulas.
problem Finding sharp bounds for risk measures in high dimensions.
method Proved that generalized FGM copulas form a convex polytope, used this structure to find bounds for risk measures.
result Sharp analytical bounds for convex risk measures in the class of generalized FGM copulas.
Fast algorithm for online optimization on transport polytopes.
problem Optimizing convex objectives on transport polytopes.
method Mirror Sinkhorn algorithm combining Sinkhorn scaling and mirror descent.
result Robust and efficient online optimization for convex objectives.
Consider a Hamiltonian action of a compact Lie group on a compact symplectic manifold. A theorem of Kirwan's says that the image of the momentum mapping intersects the positive Weyl chamber in a convex polytope. I present a new proof of Kirwan's theorem, which gives explicit information on how the vertices of the polyt…
Generalized gradient flows in Hadamard manifolds and convex optimization on entanglement polytopesmath.OC
Paper addresses optimization on Hadamard manifolds, generalizing gradient flow.
problem Optimization of convex functions on Hadamard manifolds.
method Introduces a generalized gradient flow to minimize .
result Gradient flow attains infimum in limit for basic manifolds.
Toric Quasifoldsmath.SG
Toric quasifolds extend toric geometry to non-rational polytopes.
problem Extending toric geometry to non-rational polytopes.
method Introduced toric quasifolds to solve symplectic extension problem.
result Illustrated toric quasifolds and their atlases.
We prove the theorem mentioned in the title, for , where . The case of the simplex was known previously. Also, the case was settled, but there the infimum was some well-defined function of the side lengths. We also consider the cases of spherical and hyperbolic -spaces. There we give s…
Researchers prove finiteness of integral representations on specific polytopes.
problem Proving finiteness of integral representations on 2-perfect truncation polytopes.
method Analyzing the geometric component of the deformation space of properly convex real projective structures on Coxeter orbifolds.
result Contains only finitely many integral representations.
We call complex quasifold of dimension k a space that is locally isomorphic to the quotient of an open subset of the space C^k by the holomorphic action of a discrete group; the analogue of a complex torus in this setting is called a complex quasitorus. We associate to each simple polytope, rational or not, a family of…