Related papers: Two generalisations of Leighton's Theorem
We give conditions in order to approximate locally uniformly holomorphic covering mappings of the unit ball of $\mathbb{C}^n$ with respect to an arbitrary norm, with entire holomorphic covering mappings. The results rely on a generalization…
A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…
We address the question of when a covering of the boundary of a surface can be extended to a covering of the surface (equivalently: when is there a branched cover with a prescribed monodromy). If such an extension is possible, when can the…
We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
In this paper we study the problem of approximation of the $L^2$-topological invariants by their finite dimensional analogues. We obtain generalizations of the theorem of L\"uck, dealing with towers of finitely sheeted normal coverings. We…
We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.
We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em…
We show that for every ordinal $\alpha \in [1, \omega_1)$ there is a closed set $F \subset 2^\omega \times \omega^\omega$ such that for every $x \in 2^\omega$ the section $\{y\in \omega^\omega; (x,y) \in F\}$ is a two-point set and $F$…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Let $\mathbb{F}_q$ be the finite field of order $q=p^h$ with $p>2$ prime and $h>1$, and let $\mathbb{F}_{\bar{q}}$ be a subfield of $\mathbb{F}_q$. From any two $\bar{q}$-linearized polynomials $L_1,L_2 \in \overline{\mathbb{F}}_q[T]$ of…