Related papers: Invariant graphs of rational maps

We consider certain correspondences on a Riemann surface, and show that they admit a weak form of hyperbolicity: sufficiently long loops get shorter under lifting at a fixed point and closing. In terms of their algebraic encoding by bisets,…

Motivated by the work of Cantwell-Conlon-Fenley on endperiodic homeomorphisms of infinite type surfaces, we define and study endperiodic and generalized endperiodic maps of an infinite graph with finitely many ends. Adapting the work of…

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

In this paper we will define an invariant $mc_{\infty}(f)$ of maps $f:X \rightarrow Y_{\mathbb{Q}}$ between a finite CW-complex and a rational space $Y_{\mathbb{Q}}$. We prove that this invariant is complete, i.e.…

We examine invariant nonrecurrent Fatou components of automorphisms of $\mathbb{C}^2$ in the case where all limit maps are constant. We show that except in special cases there cannot be more than one such limit map. We also briefly examine…

We deal with the existence of three distinct solutions for a poly-Laplacian system with a parameter on finite graphs and a $(p,q)$-Laplacian system with a parameter on locally finite graphs.The main tool is an abstract critical points…

We provide a complete classification of possible graphs of rational preperiodic points of endomorphisms of the projective line of degree 2 defined over the rationals with a rational periodic critical point of period 2, under the assumption…

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by…

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$. In particular, we show that if the orbits of the $D_n$-action all have either $n$ or $2n$ points then the…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k$-valent infinite circulant graph has a two-way-infinite…

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.

To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…

Let $f:{\mathbb P}^n\to{\mathbb P}^n$ be a morphism of degree $d\ge2$. The map $f$ is said to be post-critically finite (PCF) if there exist integers $k\ge1$ and $\ell\ge0$ such that the critical locus $\operatorname{Crit}_f$ satisfies…

The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…