This article announces the completion of the classification of rank 4 locally projective polytopes and their quotients. There are seventeen universal locally projective polytopes (nine nondegenerate). Amongst their 441 quotients are a further four (nonuniversal) regular polytopes, and 152 nonregular but section regular…
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,695 papers · 148 categories
Trend · papers per month
48 results for “polytope projection”
Efficiently projects points onto polytopes, especially useful in web-scale applications.
problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.
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…
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.
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 .
Moment polytope of toric exponential families is a projection of a simplex.
problem Understanding the geometry of exponential families in finite sample spaces.
method Toric torification and projection of higher-dimensional simplices.
result Moment polytope is a projection of a higher-dimensional simplex.
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.
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.
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.
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.
Chow stability is one notion of Mumford's Geometric Invariant Theory for studying the moduli space of polarized varieties. Kapranov, Sturmfels and Zelevinsky detected that Chow stability of polarized toric varieties is determined by its inherent {\it secondary polytope}, which is a polytope whose vertices correspond to…
A method models nonlinear dynamics from data using barycentric coordinates and memory.
problem Modeling complex dynamical systems from data.
method SPA for data projection, barycentric coordinates, delay-embedding theorem for memory.
result Stable models of chaotic dynamics and attractors are reproduced.
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.
An Efficient Triangulation of math.CO
We create a minimal triangulation of 5D real projective space.
problem Tackling the minimal triangulation of 5D real projective space.
method Constructing a 6-dimensional polytope with a highly symmetric automorphism group.
result Our construction uses the fewest number of vertices (24) for a triangulation of 5D real projective space.
We propose in this paper a general framework for deriving loss functions for structured prediction. In our framework, the user chooses a convex set including the output space and provides an oracle for projecting onto that set. Given that oracle, our framework automatically generates a corresponding convex and smooth l…
Given a smooth projective toric variety of complex dimension , Fang-Liu-Treumann-Zaslow \cite{FLTZ} showed that there is a quasi-embedding of the differential graded (dg) derived category of coherent sheaves into the dg derived category of constructible sheaves on a torus . Recently, K…
The paper derives a formula for Chow weights of toric blow-ups.
problem Chow weights of toric blow-ups.
method Combinatorial formula derived from toric manifold and Delzant polytope.
result Explicit formula for Chow weights of blow-ups.
Ehrhart's conjecture proposes a sharp upper bound on the volume of a convex body whose barycenter is its only interior lattice point. Recently, Berman and Berndtsson proved this conjecture for a class of rational polytopes including reflexive polytopes. In particular, they showed that the complex projective space has t…
Hypernom is a virtual reality game. The cells of a regular 4D polytope are radially projected to S^3, the sphere in 4D space, then stereographically projected to 3D space where they are viewed in the headset. The orientation of the headset is given by an element of the group SO(3), which is also a space that is double …
The projection body operator Π, which associates with every convex body in Euclidean space Rn its projection body, is a continuous valuation, it is invariant under translations and equivariant under rotations. It is also well known that Π maps the set of polytopes in Rn into itself. We show that Π is the only non-trivi…
Theory developed for Hilbert geometry over valued fields, linking real and non-Archimedean geometries.
problem Understanding Hilbert geometry over general valued fields and their limits.
method Developed a theory of Hilbert geometry over general ordered valued fields, proving ultralimit results.
result Ultralimit of rescaled real Hilbert geometries is isometric to a non-Archimedean Hilbert metric space.
Established a correspondence for toric fibrations using Delzant polytopes.
problem Existence of extremal Kähler metrics on toric fibrations.
method Using weighted constant scalar curvature Kähler metrics and uniform K-stability.
result Equivalence between extremal metrics and weighted uniform K-stability of Delzant polytopes.
A Coxeter -orbifold is an -dimensional orbifold based on a polytope with silvered boundary facets. Each pair of adjacent facets meet on a ridge of some order , whose neighborhood is locally modeled on modulo the dihedral group of order generated by two reflections. For , we study…
New examples found of complex manifolds with special metrics.
problem Existence of Kähler-Einstein metrics on certain complex manifolds.
method Using Hultgren's polytope formulation, constructing explicit examples of toric Fano manifolds.
result Found examples of projective bundles that admit coupled Kähler-Einstein metrics but no ordinary Kähler-Einstein metrics.
The amplituhedra arise as images of the totally nonnegative Grassmannians by projections that are induced by linear maps. They were introduced in Physics by Arkani-Hamed \& Trnka (Journal of High Energy Physics, 2014) as model spaces that should provide a better understanding of the scattering amplitudes of quantum fie…
Lasso is a widely used regression technique to find sparse representations. When the dimension of the feature space and the number of samples are extremely large, solving the Lasso problem remains challenging. To improve the efficiency of solving large-scale Lasso problems, El Ghaoui and his colleagues have proposed th…
We show that the complex projective space has maximal degree (volume) among all n-dimensional Kahler-Einstein Fano manifolds admitting a holomorphic C^*-action with a finite number of fixed points. The toric version of this result, translated to the realm of convex geometry, thus confirms Ehrhart's volume conjecture fo…
We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be viewed as a version of the Viro gluing theorem, relating topology of algebraic hyper…
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.
Neural Polytopescs.LG
Neural networks approximate unit spheres as polytopes.
problem Approximating unit spheres with neural networks.
method Using ReLU activation in neural networks to generate polytopes.
result Neural networks can approximate unit spheres as polytopes.
The study classifies all compact hyperbolic polytopes with eight facets.
problem Classifying compact hyperbolic Coxeter four-polytopes with specific numbers of facets.
method Complete classification through mathematical analysis.
result The complete classification of compact hyperbolic Coxeter four-polytopes with eight facets.
A theorem of Delzant states that any symplectic manifold $(M,\om)$ of dimension , equipped with an effective Hamiltonian action of the standard -torus $\T^n = \R^{n}/2π\Z^n$, is a smooth projective toric variety completely determined (as a Hamiltonian $\T^n$-space) by the image of the moment map , a …
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.
Faces of quasi-arithmetic Coxeter polytopes are also quasi-arithmetic.
problem Characterizing faces of quasi-arithmetic Coxeter polytopes.
method Proof of quasi-arithmetic property of faces and sufficient condition for arithmetic faces.
result Lower-dimensional faces of quasi-arithmetic Coxeter polytopes are quasi-arithmetic.
The study classifies all compact 5D polytopes with 9 facets.
problem Classifying compact hyperbolic Coxeter polytopes.
method Complete classification through mathematical analysis.
result A complete list of compact hyperbolic Coxeter 5D polytopes with 9 facets.
The study classifies 331 specific 4D polytopes with 7 facets.
problem Classifying finite-volume hyperbolic Coxeter 4D polytopes.
method Complete classification through exhaustive search.
result 331 unique polytopes with 7 facets identified.
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.
Given a lattice L of R^n, a polytope D is called a Delaunay polytope in L if the set of its vertices is S\cap L where S is a sphere having no lattice points in its interior. D is called perfect if the only ellipsoid in R^n that contains S\cap L is exactly S. For a vector v of the Leech lattice Λ_{24} we define Λ_{24}(v…
Conditional gradients constitute a class of projection-free first-order algorithms for smooth convex optimization. As such, they are frequently used in solving smooth convex optimization problems over polytopes, for which the computational cost of orthogonal projections would be prohibitive. However, they do not enjoy …
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.
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.
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.
The article studies factorization structures in geometry and their applications to cones and polytopes.
problem Understanding and characterizing factorization structures in geometry.
method Comprehensive study of factorization structures, including structure theory, construction of compatible polytopes and cones, and derivation of generalised Gale's evenness condition.
result Established generalised Vandermonde identities and found examples of Delzant and rational Delzant compatible polytopes.
New methods classify hyperbolic polytopes with up to 40 facets.
problem Classifying compact hyperbolic Coxeter polytopes with specific facet counts.
method New combinatorial method via point set order types.
result Proves existence of a compact hyperbolic Coxeter 29-polytope with at least 40 facets.
Rotation intertwining maps from the set of convex bodies in Rn into itself that are continuous linear operators with respect to Minkowski and Blaschke addition are investigated. The main focus is on Blaschke-Minkowski homomorphisms. We show that such maps are represented by a spherical convolution operator. An applicat…
The paper explains how to parameterize facets of moment polytopes in real symplectic geometry.
problem Understanding the moment polytopes in real symplectic geometry.
method Parameterizing equations of facets of Delta(Z) in terms of real Ressayre's pairs of Z.
result Parameterization of facets of moment polytopes explained.
Linear optimization is many times algorithmically simpler than non-linear convex optimization. Linear optimization over matroid polytopes, matching polytopes and path polytopes are example of problems for which we have simple and efficient combinatorial algorithms, but whose non-linear convex counterpart is harder and …
We introduce two operations named biflip and puzzle-move on simple polytopes producing polytopes with diffeomorphic moment-angle manifolds.