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…
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.
Trend · papers per month
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 is geometric, that is, it is combinatorially equivalent to a geodesic triangulation with respect to a constant curvature metric on , and we list the …
We compare two combinatorial models for the moduli space of two-dimensional cobordisms: Bödigheimer's radial slit configurations and Godin's admissible fat graphs, producing an explicit homotopy equivalence using a "critical graph" map. We also discuss natural compactifications of these two models, the unilevel harmoni…
Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of a subdivision rule, and define a combinatorial subdivision rule based on such gr…
Algorithm constructs and classifies weaving diagrams using combinatorial methods.
Theory of link projections to 3-manifold spines, proving combinatorial moves for isotopic links.
We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial -manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on vertices. With the exception of act…
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.
New combinatorial model for Milnor fibration using oriented matroids.
We describe an elementary combinatorial move on the set of quadratic differentials with a horizontal one cylinder decom-position. Computer experiment suggests that the corresponding equivalent classes are in one-to-one correspondence with the con-nected component of the strata.
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 …
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…
Mapping class group subgroups yield quasi-isometric curve complex.
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.
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…
Paper introduces new flows to find circle packings with specific curvature.
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…
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…
In this paper it is proved that if a finitely presented group acts properly discontinuously, cocompactly and by isometries on a simply connected Riemannian manifold, then the two Dehn functions, of the group and the manifold, respectively, are equivalent.
LCD n-manifolds are linked to branched n-manifolds.
New equivalence relation for links using cut-diagrams.
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.
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, …
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.
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.
Homotopy equivalent boundaries of cube complexes are studied.
In this paper, we introduce a new combinatorial curvature on triangulated surfaces with inversive distance circle packing metrics. Then we prove that this combinatorial curvature has global rigidity. To study the Yamabe problem of the new curvature, we introduce a combinatorial Ricci flow, along which the curvature evo…
The paper extends log-Sobolev inequalities to matrix-valued settings using combinatorial methods.
Combinatorial Ricci flow finds hyperbolic metrics on 3-manifolds.
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, …
In this paper, we introduce two discrete curvature flows, which are called -flows on two and three dimensional triangulated manifolds. For triangulated surface , we introduce a new normalization of combinatorial Ricci flow (first introduced by Bennett Chow and Feng Luo \cite{CL1}), aiming at evolving order di…
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 …
The paper aims to develop new combinatorial dimensions for bounded memory 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…
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 …
The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and 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…
Unified framework for geometric computation of minimum-area homotopy.
Study symmetries in smoothed polygonal links.
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…
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 triangulates the twisted -bundle over . It was first constructed by Walkup. In this paper, we present a computer-…
The paper classifies compact hyperbolic Coxeter polytopes and improves upper bounds.
Smooth fractal trees via analytic generators, preserving combinatorial and geometric properties.
We study quasi-isometry invariants of Gromov hyperbolic spaces, focussing on the l_p-cohomology and closely related invariants such as the conformal dimension, combinatorial modulus, and the Combinatorial Loewner Property. We give new constructions of continuous l_p-cohomology, thereby obtaining information about the l…
The study proves a theorem about subword complexity for free group automorphisms.
Optimal resource allocation in censored semi-bandits with unknown thresholds.
We recall an extension of Kirby's Calculus on non-simply connected 3-manifolds given in [FR], and the surgery calculus of bridged links from [Ke], which involves only local moves. We give a short combinatorial proof that the two calculi are equivalent, and thus describe the same classes of 3-manifolds. This makes the p…