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…
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.
Trend · papers per month
My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.
Proves necessity of at least log2(n) layers to compute maximum of n numbers.
In his seminal 1951 paper "Extreme forms" Coxeter \cite{cox51} observed that for one can add vectors to the perfect lattice $\sfA_9$ so that the resulting perfect lattice, called $\sfA_9^2$ by Coxeter, has exactly the same set of minimal vectors. An inhomogeneous analog of the notion of perfect lattice is tha…
Geometric constraints help classify hyperbolic polytopes.
We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This involves constructing explicit complete acyclic Morse matchings on the face lattice of…
We introduce a new discrete system that arises from ellipsoidal billiards and is closely related to the double reflection nets. The system is defined on the lattice of a uniform honeycomb consisting of rectified hypercubes and cross polytopes. In the -dimensional case, the lattice is regular and it incorporates dyna…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a par…
Fast BATLLNN speeds up verification of TLL NNs by 400x.
The paper examines deformations of simple dotted graphs made of circles.
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…
We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced 4-polytopes: 4-simplices, "tetrahedral diamonds" and 4-parallelotopes. We propose …
This paper begins with an observation that the isospectral leaves of the signed Toda lattice as well as the Toda flow itself may be constructed from the Tomei manifolds by cutting and pasting along certain chamber walls inside a polytope. It is also observed through examples that although there is some freedom in this …
For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain.
In this article we describe cell decompositions of the moduli space of Riemann surfaces and their relationship to a Hurwitz problem. The cells possess natural linear structures and with respect to this they can be described as rational convex polytopes which come equipped with natural integer points and a volume form. …
One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed 3-manifold M associated with a connected negative definite plumbing graph G. It conn…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but non-linear and non-convex constraint. The main results of this paper are significan…
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…
Using techniques from the theories of convex polytopes, lattice paths, and indirect influences on directed manifolds, we construct continuous analogues for the binomial coefficients and the Catalan numbers. Our approach for constructing these analogues can be applied to a wide variety of combinatorial sequences. As an …
The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma modules (or GVM's) of a semisimple Lie algebra $\lie g$. In particular, we exten…
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…
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these matchings to classify every subcomplex whose reduced homology groups are concentra…
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first identify the lamination space of a graph embedded on that surface as a lattice pol…
We show that the Cappell-Shaneson version of Pick's theorem for simple lattice polytopes is a consequence of a general relation between characteristic numbers of virtual submanifolds dual to the characteristic classes of a stably almost complex manifold. This relation is analogous to the miraculous cancellation formula…
Researchers compute the index of a specific operator on contact manifolds.
New examples of Calabi-Yau metrics on cones with irregular smooth links.
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this matching along with discrete Morse theory and some topological techniques to cl…
By applying Seifert's algorithm to a special alternating diagram of a link L, one obtains a Seifert surface F of L. We show that the support of the sutured Floer homology of the sutured manifold complementary to F is affine isomorphic to the set of lattice points given as hypertrees in a certain hypergraph that is natu…
This paper announces results on the behavior of some important algebraic and topological invariants --- Euler characteristic, arithmetic genus, and their intersection homology analogues; the signature, etc. --- and their associated characteristic classes, under morphisms of projective algebraic varieties. The formulas …
The present paper originated from a problem in Financial Mathematics concerned with calculating the value of a European call option based on multiple assets each following the binomial model. The model led to an interesting family of polytopes associated with the power-set and pa…
Researchers compute large quantum invariants for 3-manifolds.
New method uses reinforcement learning to sample from complex data structures efficiently.
The study broadens the concept of cyclic polytopes to Veronese polytopes.
We study the problem of finding the smallest such that every element of an exponential family can be written as a mixture of elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding th…
The paper studies deformation spaces of Coxeter truncation polytopes.
Neural networks approximate unit spheres as polytopes.
The study classifies all compact hyperbolic polytopes with eight facets.
Proves stability in Weyl polytopes using optimal transport.
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…
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…
The study classifies all compact 5D polytopes with 9 facets.
Smooth deformation space of Coxeter polytopes proven for orderable orbifolds.
The study classifies 331 specific 4D polytopes with 7 facets.
Contact manifolds' momentum polytopes are convex.
Smooth approximations bound dihedral angles of convex polytopes.
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
Examines nonrational polytopes and fans in toric geometry.