Related papers: Uniform boundedness on rational maps with automorp…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

In this paper we study the uniform perfectness, boundedness and uniform simplicity of diffeomorphism groups of compact manifolds with boundary and open manifolds and obtain some upper bounds of their diameters with respect to commutator…

In order to understand the structure of the "typical" element of an automorphism group, one has to study how large the conjugacy classes of the group are. For the case when typical is meant in the sense of Baire category, Truss proved that…

We study the dynamics of the group of holomorphic automorphisms of the affine cubic surfaces \begin{align*} S_{A,B,C,D} = \{(x,y,z) \in \mathbb{C}^3 \, : \, x^2 + y^2 + z^2 +xyz = Ax + By+Cz+D\}, \end{align*} where $A,B,C,$ and $D$ are…

The object of the paper is to characterize gasket Julia sets of rational maps that can be uniformized by round gaskets. We restrict to rational maps without critical points on the Julia set. Under these conditions, we prove that a Julia set…

A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note…

We prove two theorems that confirm an observation of Lubin concerning families of $p$-adic power series that commute under composition: under certain conditions, there is a formal group such that the power series in the family are either…

The polynomial automorphisms of the affine plane have been studied a lot: if $f$ is such an automorphism, then either $f$ preserves a rational fibration, has an uncountable centralizer and its first dynamical degree equals $1$, or $f$…

We produce for each natural number $n \geq 3$ two 1--parameter families of Riemann surfaces admitting automorphism groups with two cyclic subgroups $H_{1}$ and $H_{2}$ of orden $2^{n}$, that are conjugate in the group of…

We study rational self-maps of $\mathbb{P}^{1}$ whose critical points all have finite forward orbit. Thurston's rigidity theorem states that outside a single well-understood family, there are finitely many such maps over $\mathbb{C}$ of…

We study the problem of embedding bipartite graphs in Ahlfors-David regular sets of large dimension using results from extremal graph theory. Our main theorem states that any graph satisfying a power-improving bound on the extremal number…

In this paper we study the projective automorphism group of domains in real, complex, and quaternionic projective space and present two new characterizations of the unit ball in terms of the size of the automorphism group and the regularity…

We study nonautonomous discrete dynamical systems with randomly perturbed trajectories. We suppose that such a system is generated by a sequence of continuous maps which converges uniformly to a map $f$. We give conditions, under which a…

For a quadratic endomorphism of the affine line defined over the rationals we consider the problem of bounding the number of rational points that eventually land at a given constant after iteration, called pre-images of the constant. In the…

This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…

Let X be a singular real rational surface obtained from a smooth real rational surface by performing weighted blow-ups. Denote by Aut(X) the group of algebraic automorphisms of X into itself. Let n be a natural integer and let…

We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…