Research
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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for neighborly cubical polytopes

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 44, 55, 66 and 77. 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…

2017-04-19abs ↗pdf ↗

We investigate polyhedral 2k2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it kk-Hamiltonian} if it contains the full kk-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…

2008-09-24abs ↗pdf ↗

Generalizing a result (the case k=1k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k+12k + 1 belongs to the generalized Walkup class Kk(2k+1){\cal K}_k(2k + 1), i.e., all its vertex links are kk-stacked spheres. This is surprising since the kk-stacked spheres minimize the face-vecto…

2012-07-21abs ↗pdf ↗

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 …

2009-11-26abs ↗pdf ↗

For d2d\geq 2, Walkup's class $\Kd$ consists of the dd-dimensional simplicial complexes whose vertex-links are stacked (d1)(d-1)-spheres. Recently Lutz, Sulanke and Swartz have shown that all F\mathbb{F}-orientable triangulated dd-manifolds satisfy the inequality (f0d12)(d+22)β1\binom{f_0-d-1}{2} \geq \binom{d+2}{2}β_1 for $d\geq …

2012-07-31abs ↗pdf ↗

A submanifold MRNM \subset R^N is rr-neighborly if for any rr points in MM there is a hyperplane, supporting MM and touching it at exactly these rr points. We prove that the minimal dimension Δ(k,r)Δ(k,r) of the Euclidean space, containing a stably rr-neighborly submanifold, is asymptotically not smaller than 2krk2kr-k.

2014-07-27abs ↗pdf ↗

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 dd-manifold KK, satisfies the inequality (f0(K)d12)(d+22)β1(K;Z2)\binom{f_0(K)-d-1}{2}\geq \binom{d+2}{2}β_1(K;\mathbb{Z}_2) for d3d\geq 3. The triangulated dd-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…

2013-06-24abs ↗pdf ↗

We survey basic properties and bounds for qq-equivelar and dd-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for qq-equivelar and dd-covered triangulations. We identify all orientable and non-orientable surfaces MM of Euler characteristic 0>χ(M)2300>χ(M)\geq -230 which ad…

2010-01-15abs ↗pdf ↗

We give an explicit construction of vertex-transitive tight triangulations of dd-manifolds for d2d\geq 2. More explicitly, for each d2d\geq 2, we construct two (d2+5d+5)(d^2+5d+5)-vertex neighborly triangulated dd-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated …

2012-10-03abs ↗pdf ↗

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…

2015-06-01abs ↗pdf ↗

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…

2000-10-07abs ↗pdf ↗

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 d4d \geqslant 4.

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…

2007-05-27abs ↗pdf ↗

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 …

2010-04-06abs ↗pdf ↗

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…

2009-07-04abs ↗pdf ↗

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.

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.

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.

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 …

2018-02-20abs ↗pdf ↗

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.