New cube complexes disprove Kalai's conjecture about sphere facets.
problem Disproving Kalai's conjecture about the number of facets of cubical spheres.
method Constructing cube complexes homeomorphic to the d-sphere with n vertices and Ω(n^(5/4)) facets.
result The conjecture is disproved for all d≥3 and n sufficiently large.
The article provides formulas for the number of terms in connected sums of sphere products associated with dual-neighborly polytopes.
problem Understanding the number of terms in the connected sums of sphere products associated with dual-neighborly polytopes.
method Combinatorial operations and formulas for the number of terms in the connected sums of sphere products.
result Formulas for the number of terms in the connected sums of sphere products associated with dual-neighborly polytopes.
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 small covers. The lifting conjecture in all cases is verified to be true. The probl…
We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it k-Hamiltonian} if it contains the full k-skeleton of the polytope. Since the case of the cube is well known and since the case of a simplex was also previously studied (these are so…
Generalizing a result (the case k=1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k+1 belongs to the generalized Walkup class Kk(2k+1), i.e., all its vertex links are k-stacked spheres. This is surprising since the k-stacked spheres minimize the face-vecto…
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be …
For d≥2, Walkup's class $\Kd$ consists of the d-dimensional simplicial complexes whose vertex-links are stacked (d−1)-spheres. Recently Lutz, Sulanke and Swartz have shown that all F-orientable triangulated d-manifolds satisfy the inequality (2f0−d−1)≥(2d+2)β1 for $d\geq …
A submanifold M⊂RN is r-neighborly if for any r points in M there is a hyperplane, supporting M and touching it at exactly these r points. We prove that the minimal dimension Δ(k,r) of the Euclidean space, containing a stably r-neighborly submanifold, is asymptotically not smaller than 2kr−k.
The study examines the topology of complements of polytopal skeletons.
problem Characterizing topological properties of polytopal complexes and their skeletons.
method Constructing a long exact sequence relating homologies of skeleton complements and links of faces.
result Characterizations of Cohen-Macaulay and Leray complexes, stacked balls, and neighbourly spheres in terms of skeleton complements.
A triangulated d-manifold K, satisfies the inequality (2f0(K)−d−1)≥(2d+2)β1(K;Z2) for d≥3. The triangulated d-manifolds that meet the bound with equality are called {\em tight neighborly}. In this paper, we present tight neighborly triangulations of 4-manifolds on 15 vertic…
We survey basic properties and bounds for q-equivelar and d-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for q-equivelar and d-covered triangulations. We identify all orientable and non-orientable surfaces M of Euler characteristic 0>χ(M)≥−230 which ad…
We give an explicit construction of vertex-transitive tight triangulations of d-manifolds for d≥2. More explicitly, for each d≥2, we construct two (d2+5d+5)-vertex neighborly triangulated d-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated …
Study Weinstein structures on toric divisors' complements.
problem Understanding Weinstein structures on toric divisors' complements.
method Define a partially-centered condition on Delzant polytopes, develop an algorithm for Weinstein handlebody diagrams.
result Explicit Weinstein structures for complements of smoothed toric divisors.
Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known tight triangulated manifolds are stacked. It is known that locally stacked tight t…
Generalizes moment-angle manifolds to arbitrary nice manifolds with corners.
problem Computing cohomology groups and rings for moment-angle manifolds.
method Stable decomposition, rim-cubicalization, partial diagonal maps, polyhedral product.
result Derived formulas for integral cohomology groups and rings of moment-angle manifolds.
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of simplicial and cubical subdivisions of manifolds and, especially, spheres. We describe…
3-manifold triangulations are Golod and tight, proven through a topological characterization.
problem Understanding Golodness and tightness in 3-manifold triangulations.
method Topological characterization of a polyhedral product for a tight-neighborly manifold triangulation.
result Golodness and tightness are equivalent for 3-manifold triangulations.
We present and apply a method for disproving the existence of polyhedral immersions in R3 of certain triangulations on non-orientable surfaces. In particular, it is proved that neither of the two vertex-minimal, neighborly 9-vertex triangulations of the non-orientable surface of genus 5 are realizable as im…
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.
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 d⩾4. 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.
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.
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…
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a lower bound on the number of quadrilaterals of normal surfaces depending on the …
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.
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.
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.
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…
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.
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.
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.
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.
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.
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.
We introduce two operations named biflip and puzzle-move on simple polytopes producing polytopes with diffeomorphic moment-angle manifolds.
Proves necessity of at least log2(n) layers to compute maximum of n numbers.
problem Computing the maximum of n numbers with ReLU neural networks.
method Uses lattice polytopes and duality with Newton polytopes to prove depth lower bounds.
result Proves that log2(n) hidden layers are necessary and sufficient.
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.
The study of symmetries in manifolds derived from colored polytopes.
problem Existence and types of symmetries in rational homology 3-spheres.
method Analysis of hyperbolic manifolds and right-angled polytopes.
result Described how to create colorings with specific symmetries.
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.
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.
We study the Newton polytopes of determinants of square matrices defined over rings of twisted Laurent polynomials. We prove that such Newton polytopes are single polytopes (rather than formal differences of two polytopes); this result can be seen as analogous to the fact that determinants of matrices over commutative …
Geometric constraints help classify hyperbolic polytopes.
problem Classifying reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
method Established geometric constraints on compact Coxeter polytopes in hyperbolic spaces.
result Geometric constraints are useful for classifying hyperbolic polytopes.
New noncompact Coxeter polytopes found in various dimensions.
problem Classifying and constructing noncompact hyperbolic Coxeter polytopes.
method Maximal-cusp density and noncompact analog of Bogachev-Douba-Raimbault's argument.
result Infinitely many pairwise incommensurable noncompact Coxeter polytopes in dimensions 4-9.
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.