Related papers: End compactifications in non-locally-finite graphs

In architecture, city planning, visual arts, and other design areas, shapes are often made with points, or with structural representations based on point-sets. Shapes made with points can be understood more generally as finite arrangements…

The Endpoint Theorem links the existence of a sequence (curve), without accumulation points, in a manifold to the existence of an open embedding of that manifold so that the image of the given sequence (curve) has a unique endpoint. It…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…

The topological entropy of a continuous self-map of a compact metric space can be defined in several distinct ways; when the space is not assumed compact, these definitions can lead to distinct invariants. The original, purely topological…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

We introduce the notion of ends for algebras. The definition is analogous to the one in geometric group theory. We establish some relations to growth conditions and cyclic cohomology.

We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…

We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire,…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

In a recent paper \cite{T} the fact that a class of locally compact metric spaces $X$, among which are Euclidean spaces, are not homemorphic to their punctured version $X\men\{p\}$, was given an interesting new proof which does not use…

In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.

We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

A generalized topology in a set $X$ is a collection $\text{Cov}_X$ of families of subsets of $X$ such that the triple $(X,\bigcup \text{Cov}_X,\text{Cov}_X)$ is a generalized topological space in the sense of Delfs and Knebusch. In this…

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…