Related papers: A fast algorithmic way to calculate the degree gro…
The theory of degree growth and algebraic entropy plays a crucial role in the field of discrete integrable systems. However, a general method for calculating degree growth for lattice equations (partial difference equations) is not yet…
We study the link between the degree growth of integrable birational mappings of order higher than two and their singularity structures. The higher order mappings we use in this study are all obtained by coupling mappings that are…
We present a method for calculating the dynamical degree of a mapping with unconfined singularities. It is based on a method introduced by Halburd for the computation of the growth of the iterates of a rational mapping with confined…
We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
We explain on a selection of mappings how the method introduced by Halburd and our simplified variant thereof, the so-called express method, can be used to calculate the dynamical degree of second-order rational mappings from nothing more…
Let $f$ be a birational map of ${\bf C}^d$, and consider the degree complexity, or asymptotic degree growth rate $\delta(f)=\lim_{n\to\infty}({\rm deg}(f^n))^{1/n}$. We introduce a family of elementary maps, which have the form $f=L\circ…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
The dynamical degree $\lambda(f)$ of a birational transformation $f$ measures the exponential growth rate of the degree of the formulae that define the $n$-th iterate of $f$. We study the set of all dynamical degrees of all birational…
The goal of this paper is the exact computation of the degrees $\text{deg}(f^n)$ of the iterates of birational maps $f: \mathbb{P}^N \dashrightarrow \mathbb{P}^N$. In the preceding companion paper, a new method has been proposed based on…
We present a systematic technique to find explicit solutions of birational maps, provided that these solutions are given in terms of elliptic functions. The two main ingredients are: (i) application of classical addition theorems for…
We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
This work dynamically classifies a 9-parametric family of birational maps f : C2 -> C2. From the sequence of the degrees dn of the iterates of f, we find the dynamical degree delta(f) of f. We identify when dn grows periodically, linearly,…
In this paper we address the problem of computing $\text{deg}(f^n)$, the degrees of iterates of a birational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$. For this goal, we develop a method based on two main ingredients: the factorization of…
We study the degree growth of iterates of meromorphic selfmaps of compact Kahler surfaces. Using cohomology classes on the Riemann-Zariski space we show that the degrees grow similarly to those of mappings that are algebraically stable on…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a…
We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work…