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

Trend · papers per month

481115 · Mar 202319922001200920172026
48 results for Thurstons polytope

We show that link Floer homology detects the Thurston norm of a link complement. As an application, we show that the Thurston polytope of an alternating link is dual to the Newton polytope of its multi-variable Alexander polynomial. To illustrate these techniques, we also compute the Thurston polytopes of several speci…

2006-01-25abs ↗pdf ↗

In this paper we use Heegaard Floer link homology to determine the dual Thurston polytope for pretzel links of the form P(-2r_1-1, 2q_1, -2q_2, 2r_2+1) where r_i and q_i are positive integers. We apply this result to determine the Thurston norms of spanning surfaces for the individual link components, and we explicitly…

2006-09-16abs ↗pdf ↗

We define the Thurston-Bennequin polytope of a two-component link as the convex hull of all pairs of integers that arise as framings of a Legendrian representative. The main result of this paper is a description of the Thurston-Bennequin polytope for two-bridge links. As an application, we construct non-quasipositive s…

2009-10-02abs ↗pdf ↗

The Thurston norm is derived from polytopes and applied to group cohomology.

problem Understanding the structure of finitely generated torsion-free groups.
method Using the Strong Atiyah Conjecture and L2L^2-Betti numbers, the Thurston norm is defined and related to polytopes.
result The Thurston norm is a seminorm on the first cohomology group of a group with real coefficients.

In 1976 Thurston associated to a 33-manifold NN a marked polytope in H1(N;R),H_1(N;\mathbb{R}), which measures the minimal complexity of surfaces representing homology classes and determines all fibered classes in H1(N;R)H^1(N;\mathbb{R}). Recently the first and the last author associated to a presentation ππ with two generato…

2015-07-20abs ↗pdf ↗

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 ↗

Study of measured laminations on surfaces using Newton polytopes and Poisson brackets.

problem Understanding the space of measured laminations on surfaces from a valuative perspective.
method Introducing Newton polytopes for character variety functions, defining tangent spaces, and identifying symplectic structures.
result Trace functions have unit coefficients at the extremal points of their Newton polytopes.

We compute different versions of link Floer homology HFLHFL^{-} and HFL^\widehat{HFL} for any LL-space link with two components. The main approach is to compute the hh-function of the filtered chain complex which is determined by the Alexander polynomials of every sublink of the LL-space link. As an application, Thurst…

2017-04-08abs ↗pdf ↗

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.

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 ↗

New Thurston norm defined for a specific type of groups using L2L^2-invariants.

problem Measuring splitting complexity of integral characters in coherent right-angled Artin groups.
method Defining splitting complexity via L2L^2-Euler characteristic and using Friedl--Lück's L2L^2-polytope.
result A Thurston-type semi-norm defined for measuring splitting complexity of integral characters.

Given an L2L^2-acyclic connected finite CWCW-complex, we define its universal L2L^2-torsion in terms of the chain complex of its universal covering. It takes values in the weak Whitehead group Whw(G)\operatorname{Wh}^w(G). We study its main properties such as homotopy invariance, sum formula, product formula and Poincaré d…

2016-09-25abs ↗pdf ↗

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by non-negative integer weights, 14 for each 3-simplex, that describe how many copies o…

2007-06-05abs ↗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.

In this paper, we generalize the work of the second author and prove a grading shifting property, in sutured monopole and instanton Floer theories, for general balanced sutured manifolds. This result has a few consequences. First, we offer an algorithm that computes the Floer homologies of a family of sutured handle-bo…

2019-10-23abs ↗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 ↗

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.

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.

The paper classifies compact hyperbolic Coxeter polytopes and improves upper bounds.

problem Classifying compact hyperbolic Coxeter polytopes and understanding their combinatorial properties.
method Study of imes0 imes_0-products of Lannér diagrams, proving superhyperbolic properties, and analyzing Lannér subdiagrams.
result Improved upper bounds on the dimension of compact hyperbolic Coxeter polytopes.