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

20406080 · May 202619922001200920172026
48 results for polytope decompositions

This paper solves a problem in 3D geometry by defining a canonical partition for certain manifolds.

problem Building an explicit canonical decomposition for orientable 3-manifolds defined by vector-colourings of 3-polytopes.
method Analysis of results from previous studies on similar problems.
result A complete answer to the problem of decomposing orientable 3-manifolds defined by vector-colourings of 3-polytopes.

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 paper examines topological features of ReLU networks and their relation to decision boundaries and training loss.

problem Understanding the topological structure of ReLU neural network activation patterns.
method Polytope decomposition of feature space, Fiedler partition of dual graph, homology computation of cellular decomposition.
result The Fiedler partition of the dual graph correlates with decision boundaries in binary classification tasks, and similar patterns in training loss and polyhedral cell-count emerge in regression tasks.

New examples of Calabi-Yau metrics on cones with irregular smooth links.

problem Finding new Calabi-Yau metrics on cones with irregular smooth links.
method Explicit computation of Reeb field and Minkowski decompositions of toric Calabi-Yau cones.
result Examples of complete Calabi-Yau metrics on cones with irregular smooth links.

We present a constructive proof that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope βkβ^k into closed surfaces of genus g1g \leq 1, each with a transitive automorphism group given by the vertex transitive Z2k\mathbb{Z}_{2k}-action on βkβ^k. Furthermore we show that for each $k \equiv …

2010-09-14abs ↗pdf ↗

We study algebraic structures (LL_\infty and AA_\infty-algebras) introduced by Gaiotto, Moore and Witten in their recent work devoted to certain supersymmetric 2-dimensional massive field theories. We show that such structures can be systematically produced in any number of dimensions by using the geometry of seconda…

2014-08-12abs ↗pdf ↗

We introduce a novel mechanism to tighten the local polytope relaxation for MAP inference in Markov random fields with low state space variables. We consider a surjection of the variables to a set of hyper-variables and apply the local polytope relaxation over these hyper-variables. The state space of each individual h…

2018-05-13abs ↗pdf ↗

We produce a one-parameter family of coordinates {Ψh}hR\{Ψ_h\}_{h\in\mathbb{R}} of the decorated Teichmüller space of an ideally triangulated punctured surface (S,T)(S,T) with negative Euler characteristic, which is a deformation of Penner's simplicial coordinate \cite{P1}. If h0h\geqslant0, the decorated Teichmüller space in…

2010-11-07abs ↗pdf ↗

The moduli space of Riemann surfaces with at least two punctures can be decomposed into a cell complex by using a particular family of ribbon graphs called Nakamura graphs. We distinguish the moduli space with all punctures labelled from that with a single labelled puncture. In both cases, we describe a cell decomposit…

2015-07-10abs ↗pdf ↗

Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent simplicial complexes and polytopes. In this paper, we formalize incidence tensors,…

2019-05-27abs ↗pdf ↗

In this paper, we extend the theory of sutured Floer homology developed by the author. We first prove an adjunction inequality, and then define a polytope P(M,g) in H^2(M,\partial M; R) that is spanned by the Spin^c-structures which support non-zero Floer homology groups. If (M,g) --> (M',g') is a taut surface decompos…

2008-02-24abs ↗pdf ↗

Constructs combinatorial 2D topological field theories from cyclic A-infinity algebras.

problem Developing a combinatorial framework for 2D topological field theories.
method Using triangulations and polygonal decompositions, constructing cochains on a CW complex.
result Existence of combinatorial 2D topological field theories based on cyclic A-infinity algebras.

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.

For closed 3-manifolds, Heegaard Floer homology is related to the Thurston norm through results due to Ozsváth and Szabó, Ni, and Hedden. For example, given a closed 3-manifold Y, there is a bijection between vertices of the HF^+(Y) polytope carrying the group Z and the faces of the Thurston norm unit ball that corresp…

2012-05-02abs ↗pdf ↗

A famous construction of Gelfand, Kapranov and Zelevinsky associates to each finite point configuration ARdA \subset \mathbb{R}^d a polyhedral fan, which stratifies the space of weight vectors by the combinatorial types of regular subdivisions of AA. That fan arises as the normal fan of a convex polytope. In a complete…

2017-08-29abs ↗pdf ↗

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.

We describe the basic Dolbealut cohomology algebra of the canonical foliation on a class of complex manifolds with a torus symmetry group. This class includes complex moment-angle manifolds, LVM- and LVMB-manifolds and, in most generality, complex manifolds with a maximal holomorphic torus action. We also provide a dga…

2019-08-18abs ↗pdf ↗

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 ↗

This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface or triangulation. Two applications of these bounds are given. First, the minima…

2014-11-24abs ↗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 ↗

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 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 ↗