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

295786114 · Jun 202019922001200920172026
48 results for combinatorial proofs

Using bordered Floer theory, we give a combinatorial construction and proof of invariance for the hat version of Heegaard Floer homology. As a part of the proof, we also establish combinatorially the invariance of the linear-categorical representation of the strongly-based mapping class groupoid given by the same theor…

2014-05-13abs ↗pdf ↗

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in…

2009-06-29abs ↗pdf ↗

For triangulated surfaces, we introduce the combinatorial Calabi flow which is an analogue of smooth Calabi flow. We prove that the solution of combinatorial Calabi flow exists for all time. Moreover, the solution converges if and only if Thurston's circle packing exists. As a consequence, combinatorial Calabi flow pro…

2012-04-13abs ↗pdf ↗

Using a Heegaard diagram for the pullback of a knot KS3K \subset S^3 in its cyclic branched cover Σm(K)Σ_m(K) obtained from a grid diagram for KK, we give a combinatorial proof for the invariance of the associated combinatorial knot Floer homology over Z\mathbb{Z}.

2018-04-30abs ↗pdf ↗

Researchers solved a number-theoretic hypothesis to determine the spin parity of k-differentials.

problem Determining the spin parity of k-differentials on Riemann surfaces of genus zero and one.
method Proved a number-theoretic hypothesis (Conjecture A.10) by reformulating it in terms of Jacobi symbols and reducing it to a combinatorial identity.
result The spin parity of k-differentials on Riemann surfaces of genus zero and one was completely determined.

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 consider a stabilized version of hat Heegaard Floer homology of a 3-manifold Y (i.e. the U=0 variant of Heegaard Floer homology for closed 3-manifolds). We give a combinatorial algorithm for constructing this invariant, starting from a Heegaard decomposition for Y, and give a combinatorial proof of its invariance pr…

2009-12-04abs ↗pdf ↗

A combinatorial condition is obtained for when immersed or embedded incompressible surfaces in compact 3-manifolds with tori boundary components remain incompressible after Dehn surgery. A combinatorial characterisation of hierarchies is described. A new proof is given of the topological rigidity theorem of Hass and Sc…

2000-08-30abs ↗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 ↗

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 ↗

We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker than the existence of the corresponding foliation, is sufficient to guarantee t…

1998-03-24abs ↗pdf ↗

We show that the analog of Hamilton's Ricci flow in the combinatorial setting produces solutions which converge exponentially fast to Thurston's circle packing on surfaces. As a consequence, a new proof of Thurston's existence of circle packing theorem is obtained. As another consequence, Ricci flow suggests a new algo…

2002-11-17abs ↗pdf ↗

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 ↗

Let MM be an nn-vertex combinatorial triangulation of a $\ZZ_2$-homology dd-sphere. In this paper we prove that if nd+8n \leq d + 8 then MM must be a combinatorial sphere. Further, if n=d+9n = d + 9 and MM is not a combinatorial sphere then MM can not admit any proper bistellar move. Existence of a 12-vertex triangula…

2005-06-27abs ↗pdf ↗

This research connects combinatorial Teichmüller space geometry to Weil-Petersson geometry.

problem Understanding the geometry of combinatorial Teichmüller space.
method Developed a parallel between combinatorial Teichmüller space and Weil-Petersson geometry, using measured foliations and Fenchel-Nielsen coordinates.
result Established a geometric recursion and topological recursion for mapping class group invariants.

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 ↗

Link Floer homology is an invariant for links defined using a suitable version of Lagrangian Floer homology. In an earlier paper, this invariant was given a combinatorial description with mod 2 coefficients. In the present paper, we give a self-contained presentation of the basic properties of link Floer homology, incl…

2006-10-18abs ↗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 define a combinatorial structure on 3-manifolds that combines the model manifolds constructed in Minsky's proof of the ending lamination conjecture with the layered triangulations defined by Jaco and Rubinstein.

2010-11-29abs ↗pdf ↗

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the calculus of continued fractions. We characterize the class of strongly invertib…

2002-12-01abs ↗pdf ↗

Tucker and Ky Fan's lemma are combinatorial analogs of the Borsuk-Ulam theorem (BUT). In 1996, Yu. A. Shashkin proved a version of Fan's lemma, which is a combinatorial analog of the odd mapping theorem (OMT). We consider generalizations of these lemmas for BUT-manifolds, i.e. for manifolds that satisfy BUT. Proofs rel…

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

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.

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be given for the diameter of the geodesic image. We also generalize the theorem for pro…

2013-01-25abs ↗pdf ↗

Extends Thurston's combinatorial characterization to all branched coverings of the 2-sphere.

problem Characterizing branched coverings of the 2-sphere.
method Generalizing Thurston's local balancing to all branched coverings.
result Provides a new proof for a theorem concerning real rational functions.

Here are versions of the proofs of two classic theorems of combinatorial topology. The first is the result that piecewise linearly homeomorphic simplicial complexes are related by stellar moves. This is used in the proof, modelled on that of Pachner, of the second theorem. This states that moves from only a finite coll…

1999-11-20abs ↗pdf ↗