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

65130194259 · Jun 202019922001200920172026
48 results for combinatorial types

We construct 2^{Ω(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves that asymptotically, there are far more combinatorial types of triangulated 3-spheres …

2002-11-30abs ↗pdf ↗

Real Lagrangians in toric manifolds are classified by combinatorial data.

problem Classifying real Lagrangian submanifolds in toric symplectic manifolds.
method Established a real analog of the Delzant construction.
result Real Lagrangians in toric del Pezzo surfaces have all possible diffeomorphism types.

In this paper we provide a new Bennequin-type inequality for the Rasmussen- Beliakova-Wehrli invariant, featuring the numerical transverse braid invariants (the c-invariants) introduced by the author. From the Bennequin type-inequality, and a combinatorial bound on the value of the c-invariants, we deduce a new computa…

2017-07-11abs ↗pdf ↗

In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family exists. In addition, we substantially extend the classification of combinatorial…

2011-12-05abs ↗pdf ↗

Let a AA be the 1-skeleton of a triangulated topological annulus. We establish bounds on the combinatorial modulus of a refinement AA', formed by attaching new vertices and edges to AA, that depend only on the refinement and not on the structure of AA itself. This immediately applies to showing that a disk triangul…

2006-08-25abs ↗pdf ↗

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a number of known results. New results include a combinatorial characterization of c…

2012-08-30abs ↗pdf ↗

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

2019-08-11abs ↗pdf ↗

The paper finds hyperbolic metrics on surfaces with boundary using combinatorial curvature flows.

problem Finding hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.
method Introducing combinatorial Ricci flow and combinatorial Calabi flow for generalized circle packings.
result Proves longtime existence and global convergence of combinatorial curvature flows.

Goussarov, Polyak, and Viro proved that finite type invariants of knots are ``finitely multi-local'', meaning that on a knot diagram, sums of quantities, defined by local information, determine the value of the knot invariant. The result implies the existence of Gauss diagram combinatorial formulas for finite type inva…

2007-11-26abs ↗pdf ↗

Advances combinatorial complexes for better modeling of hierarchical and set-type relations.

problem Lack of effective modeling for complex hierarchical and set-type relations in high-dimensional data.
method Introduces combinatorial complexes as a bridge between cell complexes and hypergraphs, emphasizing their different types of relations.
result Combining set-type and hierarchical relations in a single model can be advantageous in learning tasks.

We study the moduli space of euclidean structures with cone points on a surface, and describe a decomposition into cells each of which corresponds to a given combinatorial type of Delaunay tessellation. We use some of the ideas to study hyperbolic structures on three-dimensional manifolds

1999-07-06abs ↗pdf ↗

Bounded-type 3-manifolds arise as combinatorially bounded gluings of irreducible 3-manifolds chosen from a finite list. We prove effective hyperbolization and effective rigidity for a broad class of 3-manifolds of bounded type and large gluing heights. Specifically, we show the existence and uniqueness of hyperbolic me…

2013-12-09abs ↗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.

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the Alexander Invariant and certain invariants of combinatorial line arrangements a…

2004-03-31abs ↗pdf ↗

In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain complex, and Laplacian operates this defferential forms. Then we construct the Bochne…

2017-03-24abs ↗pdf ↗

Floer constructs homology from flow lines in generalized dynamical systems and combinatorial vector fields.

problem Computing homology in discrete and smooth dynamical systems.
method Counting flow lines between orbits and critical points.
result Directly recovers Z2\mathbb{Z}_2 homology from flow lines.

It is shown that for any piecewise-linear closed orientable manifold of odd dimension there exists an invariantly defined metric on the determinant line of cohomology with coefficients in an arbitrary flat bundle E over the manifold (E is not required to be unimodular). The construction of this metric (called Poincare …

1996-07-01abs ↗pdf ↗

We combinatorially describe the 22-category of singular cobordisms, called (rank one) foams, which governs the functorial version of Khovanov homology. As an application we topologically realize the type D\mathrm{D} arc algebra using this singular cobordism construction.

2016-11-22abs ↗pdf ↗

We prove that the complement of any affine 2-arrangement in R^d is minimal, that is, it is homotopy equivalent to a cell complex with as many i-cells as its i-th rational Betti number. For the proof, we provide a Lefschetz-type hyperplane theorem for complements of 2-arrangements, and introduce Alexander duality for co…

2012-11-06abs ↗pdf ↗

We determine an explicit presentation by generators and relations of the cohomology algebra H(P2C,C)H^*(\mathbb P^2\setminus C,\mathbb C) of the complement to an algebraic curve CC in the complex projective plane P2\mathbb P^2, via the study of log-resolution logarithmic forms on P2\mathbb P^2. As a first consequence, we de…

2007-11-13abs ↗pdf ↗

New combinatorial model for Milnor fibration using oriented matroids.

problem Understanding the homotopy type of Milnor fibers of complexified real arrangements.
method Introducing a poset quasi-fibration based on a subdivision of the Salvetti complex and an oriented matroid.
result Homotopy type of Milnor fiber depends only on the combinatorial structure of the oriented matroid.

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain combinatorial types. These formulas generalize the calculation of a linking number by coun…

2012-09-03abs ↗pdf ↗

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements whose intersection points are doubles or triples. This result is obtained by consi…

2013-06-25abs ↗pdf ↗

Researchers solve 3D cube complex boundary rigidity problem.

problem Determining the combinatorial type of a 3D CAT(0) cube complex from boundary distances.
method Discrete version of boundary rigidity problem, focusing on CAT(0) cube complexes.
result The combinatorial type of a finite CAT(0) cube complex can be reconstructed from its boundary distances.

The study finds all possible 3D polytopes in Riemannian 3-manifolds with positive scalar curvature.

problem Understanding the combinatorial types of 3D polytopes in specific Riemannian manifolds.
method Analysis of mean curvature convex Riemannian polyhedra with non-obtuse dihedral angles in positive scalar curvature 3-manifolds.
result Determination of combinatorial types of 3D simple convex polytopes.

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a compl…

2012-07-03abs ↗pdf ↗

The paper tackles prescribing discrete Gaussian curvature on polyhedral surfaces.

problem Prescribing discrete Gaussian curvature on polyhedral surfaces.
method Discrete conformal theory and variational principles with constraints.
result Proves Kazdan-Warner type theorems for polyhedral surfaces.

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we present simple formulas for an infinite family of invariants in terms of counting su…

2012-09-06abs ↗pdf ↗

We describe the first part of a gluing theory for the bigraded Khovanov homology with integer coefficients. This part associates a type D structure to a tangle properly embedded in a half-space and proves that the homotopy class of the type D structure is an invariant of the isotopy class of the tangle. The constructio…

2013-04-01abs ↗pdf ↗

Paper analyzes FTPL's effectiveness in combinatorial semi-bandit problems.

problem Optimizing FTPL policy in combinatorial semi-bandit problems.
method Geometric resampling (GR) and conditional geometric resampling (CGR) for FTPL in semi-bandit setting.
result FTPL achieves optimal regret bounds in both Fréchet and Pareto distributions.

Reduces conjecture for Artin groups to simpler cases.

problem Proving K(π,1)K(π,1) for Artin groups with specific spherical parabolics.
method Reduces to simpler cases, uses injective metric spaces, combinatorial convexity, and Bestvina-type inequalities.
result Deduces K(π,1)K(π,1) conjecture for specific Artin groups.

We present a combinatorial method for a calculation of knot Floer homology with Z-coefficient of (1,1)-knots, and then demonstrate it for non-alternating (1,1)-knots with ten crossings and the pretzel knots of type (-2,m,n). Our calculations determine the unknotting numbers and 4-genera of the pretzel knots of this typ…

2003-11-06abs ↗pdf ↗

Homotopy classes of nanowords and nanophrases are combinatorial generalizations of virtual knots and links. Goussarov, Polyak and Viro defined finite type invariants for virtual knots and links via semi-virtual crossings. We extend their definition to nanowords and nanophrases. We study finite type invariants of low de…

2010-07-10abs ↗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.