Related papers: Invariant graphs of rational maps
We prove that $Aut({\mathbb S}^1)$ coincides with the automorphism group of the \emph{circle graph} $\mathcal{C}$, i.e. the intersection graph of the family of chords of ${\mathbb S}^1$. We prove that the countable subgraph of $\mathcal{C}$…
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
We show that the independence number of a countably infinite HH-homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite and present a classification of MB-homogeneous graphs up to bimorphism-equivalence as a…
In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…
To formulate our results let $f$ be a continuous map from $\mathbb R^n$ to $2^{\mathbb R^n}$ and $k$ a natural number such that $|f(x)|\leq k$ for all $x$. We prove that $f$ is fixed-point free if and only if its continuous extension…
Consider the self-map F of the space of real-valued test functions on the line which takes a test function f to the test function sending a real number x to f(f(x))-f(0). We show that F is discontinuous, although its restriction to the…
Confirming a conjecture of Ne\v{s}et\v{r}il, we show that up to isomorphism there is only a finite number of finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly…
In this paper, we construct geometrically finite rational maps with buried critical points on the boundaries of some hyperbolic components by using the pinching and plumbing deformations.
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an…
Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key…
In this work we prove that the set of points at infinity $S_\infty:={\rm Cl}_{{\mathbb R}{\mathbb P}^m}(S)\cap\mathsf{H}_\infty$ of a semialgebraic set $S\subset{\mathbb R}^m$ which is the image of a polynomial map $f:{\mathbb…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
We consider Thurston maps, i.e., branched covering maps $f\colon S^2\to S^2$ that are postcritically finite. In addition, we assume that $f$ is expanding in a suitable sense. It is shown that each sufficiently high iterate $F=f^n$ of $f$ is…
By studying various rational integrable maps on $\mathbf{\hat C}^d$ with $p$ invariants, we show that periodic points form an invariant variety of dimension $\ge p$ for each period, in contrast to the case of nonintegrable maps in which…
The holomorphic endomorphism f of projective space is called post-critically finite (PCF) if the forward image of the critical locus, under iteration of f, has algebraic support (i.e., is a finite union of hypersurfaces). In the case of…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
We provide a complete invariant for graph C*-algebras which are amplified in the sense that whenever there is an edge between two vertices, there are infinitely many. The invariant used is the standard primitive ideal space adorned with a…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…