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

3468101135 · Jun 202019922001200920172026
48 results for combinatorial equivalence

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their 4-dimensional faces are diffeomorphic. It follows that two simple convex polytop…

2013-06-25abs ↗pdf ↗

Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

problem Uniqueness of smooth structures on real moment-angle manifolds.
method Arguments from calculus applied to results from complex moment-angle manifolds.
result Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface SS is geometric, that is, it is combinatorially equivalent to a geodesic triangulation with respect to a constant curvature metric on SS, and we list the …

2017-11-03abs ↗pdf ↗

We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that are inspired by the ideas from toric topology.

2016-09-19abs ↗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 planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …

2014-12-15abs ↗pdf ↗

Every closed oriented PL 4-manifold is a branched cover of the 4-sphere branched over a PL-surface with finitely many singularities by Piergallini [Topology 34(3):497-508, 1995]. This generalizes a long standing result by Hilden and Montesinos to dimension four. Izmestiev and Joswig [Adv. Geom. 3(2):191-225, 2003] gave…

2007-07-10abs ↗pdf ↗

Mapping class group subgroups yield quasi-isometric curve complex.

problem Understanding the curve complex through coset intersections.
method Proving quasi-isometry and combinatorial equivalence of curve complex and coset intersection complex.
result Automorphism group of coset intersection complex is the extended mapping class group.

In this note we present a combinatorial link invariant that underlies some recent stable homotopy refinements of Khovanov homology of links. The invariant takes the form of a functor between two combinatorial 2-categories, modulo a notion of stable equivalence. We also develop some general properties of such functors.

2015-05-04abs ↗pdf ↗

We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling. We show that all tilings with the same combinatorial data form an open subset in a suitable Euclidean space that is homotopy equivalen…

2012-12-28abs ↗pdf ↗

Paper introduces new flows to find circle packings with specific curvature.

problem Finding circle packings with prescribed total geodesic curvatures.
method Introduces combinatorial Calabi flow, fractional combinatorial Calabi flow, and combinatorial p-th Calabi flow.
result Establishes conditions for the longtime behaviors of these flows.

This paper is a short introduction to the combinatorial version of tangle Floer homology defined in "Combinatorial tangle Floer homology". There are two equivalent definitions---one in terms of strand diagrams, and one in terms of bordered grid diagrams. We present both, discuss the correspondence, and carry out some e…

2016-04-28abs ↗pdf ↗

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather than out of crossings. We describe an equivalence relation on clasp diagrams which…

2019-11-07abs ↗pdf ↗

We prove that if a finitely presented group acts properly discontinuously, cocompactly and by isometries on a simply connected Riemannian manifold, then the Dehn function of the group and the corresponding filling function of the manifold are equivalent, in a sense described below.

2001-03-13abs ↗pdf ↗

Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic classes, combinatorial transgressions have not been previously studied. First, …

2008-06-02abs ↗pdf ↗

Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.

2008-10-24abs ↗pdf ↗

We utilize the obstruction theory of Galewski-Matumoto-Stern to derive equivalent formulations of the Triangulation Conjecture. For example, every closed topological manifold M^n with n > 4 can be simplicially triangulated if and only if the two distinct combinatorial triangulations of RP^5 are simplicially concordant.

2002-12-20abs ↗pdf ↗

Homotopy equivalent boundaries of cube complexes are studied.

problem The equivalence of different boundaries of cube complexes.
method Using a partial order on a quotient of the Roller boundary, we obtain the simplicial Roller boundary and show homotopy equivalence among the Tits, simplicial, and simplicial Roller boundaries.
result The Tits, simplicial, and simplicial Roller boundaries are homotopy equivalent.

By defining combinatorial moves, we can define an equivalence relation on Gauss words called homotopy. In this paper we define a homotopy invariant of Gauss words. We use this to show that there exist Gauss words that are not homotopically equivalent to the empty Gauss word, disproving a conjecture by Turaev. In fact, …

2009-01-31abs ↗pdf ↗

We define combinatorial invariants of Legendrian and transverse links in universally tight lens spaces using grid diagrams, generalizing [OST08] and prove that they are equivalent to the invariants defined in [BVVV13] and [LOSS09]. We use these combinatorial invariants to characterize index one grid diagrams for knots …

2018-09-19abs ↗pdf ↗

The paper aims to develop new combinatorial dimensions for bounded memory learning.

problem Characterize bounded memory learning using combinatorial dimensions.
method Proposes a candidate solution based on the SQ dimension of neighboring distributions and proves upper and lower bounds.
result Characterizes bounded memory learning in a specific parameter regime, matching equivalence between bounded memory and SQ learning.

A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is equivalent to computing the discrete homotopy group of the 1-skeleton of the permutahedr…

2007-11-06abs ↗pdf ↗

Liouville's theorem says that in dimension greater than two, all conformal maps are Möbius transformations. We prove an analogous statement about simplicial complexes, where two simplicial complexes are considered discretely conformally equivalent if they are combinatorially equivalent and the lengths of corresponding …

2019-11-03abs ↗pdf ↗

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

problem Discrete conformal structures on polyhedral surfaces and their rigidity.
method Parameterized combinatorial curvature, combinatorial α-Ricci flow, and flow extension through singularities.
result Existence and convergence of combinatorial α-Ricci flow for solving the Yamabe problem.

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 ↗

Unified framework for geometric computation of minimum-area homotopy.

problem Computing the minimum homotopy area of a closed curve.
method Unified combinatorial word approach combining geometric and algebraic methods.
result Unified geometric proof and constructive algorithm for minimum area homotopy.

Links in lens spaces may be defined to be equivalent by ambient isotopy or by diffeomorphism of pairs. In the first case, for all the combinatorial representations of links, there is a set of Reidemeister-type moves on diagrams connecting isotopy equivalent links. In this paper we provide a set of moves on disk, band a…

2017-01-07abs ↗pdf ↗

Via a computer search, Altshuler and Steinberg found that there are 1296 +1 combinatorial 3-manifolds on nine vertices, of which only one is non-sphere. This exceptional 3-manifold K93K^{3}_{9} triangulates the twisted S2S^{2}-bundle over S1S^{1}. It was first constructed by Walkup. In this paper, we present a computer-…

2006-10-27abs ↗pdf ↗

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.

Smooth fractal trees via analytic generators, preserving combinatorial and geometric properties.

problem Constructing smooth fractal trees from discrete models.
method Using analytic generator fields to integrate smooth vector fields in an internal state space, generating geometric curves as projections of generator trajectories.
result Analytic generators can represent any discrete tree specification and preserve the asymptotic limit geometry.

The study proves a theorem about subword complexity for free group automorphisms.

problem Analyzing subword complexity for attracting fixed points of automorphisms of free groups.
method Combinatorial arguments and train tracks.
result Subword complexity of attracting fixed points is equivalent to n, n log log n, n log n, or n^2.