Related papers: Flip graphs for infinite type surfaces
We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one infinite component, and a 2-walk is a spanning walk using every…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
We utilise the two principles of decoupling introduced in [arXiv:2407.16108] to prove decoupling for two types of surfaces exhibiting radial symmetry. The first type are surfaces of revolution in $\mathbb R^n$ generated by smooth surfaces…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
In this article, we construct a new simplicial complex for infinite-type surfaces, which we call the grand arc graph. We show that if the end space of a surface has at least three different self-similar equivalence classes of maximal ends,…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
The relation between discrete topological field theories on triangulations of two-dimensional manifolds and associative algebras was worked out recently. The starting point for this development was the graphical interpretation of the…
One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…
The existence of essential closed surfaces surfaces is proven for finite coverings of 3-manifolds that are triangulated by finitely many topological ideal tetrahedra and admit a regular, negatively curved, ideal structure.
In this paper we introduce flat grafting as a deformation of quadratic differentials on a surface of finite type that is analogous to the grafting map on hyperbolic surfaces. Flat grafting maps are generic in the strata structure and…
We study the pants complex of surfaces of infinite type. When $S$ is a surface of infinite type, the usual definition of the pants graph $\mathcal{P}(S)$ yields a graph with infinitely many connected-components. In the first part of our…
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
We analyze the effect of twists on the electronic structure of configurations of infinite stacks of graphene layers. We focus on three different cases: an infinite stack where each layer is rotated with respect to the previous one by a…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…