Related papers: Invariant graphs of rational maps
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
We provide sufficient conditions for a mapping $f:R^{n}\rightarrow R^{n}$ to be a global diffeomorphism in case it is strictly (Hadamard) differentiable. We use classical local invertibility conditions together with the non-smooth critical…
The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…
Using Thurston's characterization of postcritically finite rational functions as branched coverings of the sphere to itself, we give a new method of constructing new conformal dynamical systems out of old ones. Let $f(z)$ be a rational map…
We consider rational maps $f$ on the Riemann sphere $\widehat {\mathbb{C}}$ with an $f$-invariant set $P\subset \widehat {\mathbb{C}}$ of four marked points containing the postcritical set of $f$. We show that the dynamics of the…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We discuss the dynamical, topological, and algebraic classification of rational maps $f$ of the Riemann sphere to itself each of whose critical points $c$ is also a fixed-point of $f$, i.e. $f(c)=c$.
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We provide new examples of integrable rational maps in four dimensions with two rational invariants, which have unexpected geometric properties, as for example orbits confined to non algebraic varieties, and fall outside classes studied by…
Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
We prove: If $f(z)$ is a critically finite rational map which has exactly two critical points and which is not conjugate to a polynomial, then the boundary of every Fatou component of $f$ is a Jordan curve. If $f(z)$ is a hyperbolic…
The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…
In this paper, we give a matrix-theoretic criterion for the Leavitt path algebra of a finite graph has Invariant Basis Number. Consequently, we show that the Cohn path algebra of a finite graph has Invariant Basis Number, as well as provide…
This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…
A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
We investigate the dynamical behaviour of a holomorphic map on a $f-$invariant subset $\mathcal{C}$ of $U,$ where $f:U \to \mathbb{C}^k.$ We study two cases: when $U$ is an open, connected and polynomially convex subset of $\mathbb{C}^k$…