Related papers: Invariant graphs of rational maps

We prove several rigidity results on multiplier spectrum and length spectrum. For example, we show that for every non-exceptional rational map $f:\mathbb{P}^1(\mathbb{C})\to\mathbb{P}^1(\mathbb{C})$ of degree $d\geq2$, the…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are…

In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a…

A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$, we prove that every one-ended, unimodular random rooted graph that does not have H as a minor must be…

We study the class $\mathcal{M}$ of functions meromorphic outside a countable closed set of essential singularities. We show that if a function in $\mathcal{M}$, with at least one essential singularity, permutes with a non-constant rational…

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…

We consider a complete metric space $(X,d)$ and a countable number of contractive mappings on $X$, $\mathcal{F}=\{F_i:i\in\mathbb N\}$. We show the existence of a {\em smallest} invariant set (with respect to inclusion) for $\mathcal{F}$.…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

We consider some two-dimensional birational transformations. One of them is a birational deformation of the H\'enon map. For some of these birational mappings, the post critical set (i.e. the iterates of the critical set) is infinite and we…

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…

We associate with every locally expanding self-covering $f:M\to M$ of a compact path connected metric space a finitely presented group $V_f$. We prove that this group is a complete invariant of the dynamical system: two groups $V_{f_1}$ and…

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…

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…

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Let U be an open subset of a unirational variety (or more generally of a separably rationally connected variety). We prove that there is rational curve C in U such that the fundamental group of C surjects onto the fundamental group of U.…