English
Related papers

Related papers: Compactifying Exchange Graphs I: Annuli and Tubes

200 papers

In [Evans, Francis 2022; Hendel] the authors investigated resistance distance in triangular grid graphs and observed several types of asymptotic behavior. This paper extends their work by studying the initial, non-asymptotic, behavior found…

Combinatorics · Mathematics 2024-06-25 Emily J. Evans , Russell J. Hendel

We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with…

Combinatorics · Mathematics 2018-04-03 Jan Kurkofka , Max Pitz

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…

Geometric Topology · Mathematics 2016-09-21 Henry Segerman

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

Geometric Topology · Mathematics 2013-03-28 David Bachman

Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…

Combinatorics · Mathematics 2019-07-23 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…

Dynamical Systems · Mathematics 2008-06-16 Silvio Capobianco

We investigate a PL topology question: which circle bundles can be triangulated over a given triangulation of the base? The question got a simple answer emphasizing the role of minimal triangulations encoded by local systems of circular…

Geometric Topology · Mathematics 2019-08-28 Nikolai Mnëv

We consider a class of "harmonic variations" for nonsingular curves, obtained as asymptotic degenerations along bitangents. On a geometric level, we obtain an attractive relationship between the class and the genus of $C$. The distribution…

Logic · Mathematics 2014-08-26 Tristram de Piro

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

Geometric Topology · Mathematics 2014-03-17 Scott Taylor , Maggy Tomova

Homotopic morphisms of $\mathbb E$-triangles in extriangulated categories are introduced. Any morphism of $\mathbb E$-triangles is a composition of homotopic morphisms. Any morphism $(\alpha_1, \alpha_2, \alpha_3)$ of $\mathbb E$-triangles…

Category Theory · Mathematics 2026-04-27 Chencheng Zhang , Xue-Song Lu , Pu Zhang

In this work, a unimodular random planar triangulation is constructed that has no invariant circle packing. This disputes a problem asked in [arXiv:1910.01614]. A natural weaker problem is the existence of point-stationary circle packings…

Probability · Mathematics 2020-01-01 Ali Khezeli

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Combinatorics · Mathematics 2023-04-13 Alexander E. Black , Kevin Liu , Alex Mcdonough , Garrett Nelson , Michael C. Wigal , Mei Yin , Youngho Yoo

The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…

Dynamical Systems · Mathematics 2007-05-23 Boris Kruglikov , Martin Rypdal

The aim of this paper is to give a new description of the geometry appearing in the multi-specialization along a general family of submanifolds of a real analytic manifold (including some important cases as clean intersection or a…

Algebraic Geometry · Mathematics 2016-09-02 Naofumi Honda , Luca Prelli

The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…

Dynamical Systems · Mathematics 2016-04-12 A. Vershik

We study how the thermodynamic properties of the Triangular Plaquette Model (TPM) are influenced by the addition of extra interactions. The thermodynamics of the original TPM is trivial, while its dynamics is glassy, as usual in Kinetically…

Disordered Systems and Neural Networks · Physics 2016-03-23 Silvio Franz , Giacomo Gradenigo , Stefano Spigler

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…

Geometric Topology · Mathematics 2019-04-01 Riccardo Benedetti

The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…

Probability · Mathematics 2017-04-19 Richard Kenyon , Mei Yin
‹ Prev 1 4 5 6 7 8 10 Next ›