Integrable mappings and polynomial growth

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 of transformations on $q \times q$ matrices: the inversion of the $q \times q$ matrix and an (involutive) permutation of the entries of the matrix. We concentrate on the case where these permutations are elementary transpositions of two entries. In this case the birational transformations fall into six different classes. For each class we analyze the factorization properties of the iteration of these transformations. These factorization properties enable to define some canonical homogeneous polynomials associated with these factorization properties. Some mappings yield a polynomial growth of the complexity of the iterations. For three classes the successive iterates, for $q=4$, actually lie on elliptic curves. This analysis also provides examples of integrable mappings in arbitrary dimension, even infinite. Moreover, for two classes, the homogeneous polynomials are shown to satisfy non trivial non-linear recurrences. The relations between factorizations of the iterations, the existence of recurrences on one or several variables, as well as the integrability of the mappings are analyzed.Comment: 45 page

Diophantine triples in linear recurrence sequences of Pisot type

The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence or finiteness of Diophantine triples in such sequences. Whilst the case of binary recurrence sequences is almost completely solved, not much was known about recurrence sequences of larger order, except for very specialized generalizations of the Fibonacci sequence. Now, we will prove that any linear recurrence sequence with the Pisot property contains only finitely many Diophantine triples, whenever the order is large and a few more not very restrictive conditions are met.Comment: 25 pages. arXiv admin note: text overlap with arXiv:1602.0823

Low Complexity Algorithms for Linear Recurrences

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over the rational numbers. The algorithms for these tasks all involve as an intermediate quantity an integer $N$ (dispersion or root of an indicial polynomial) that is potentially exponential in the bit size of their input. Previous algorithms have a bit complexity that is at least quadratic in $N$. We revisit them and propose variants that exploit the structure of solutions and avoid expanding polynomials of degree $N$. We give two algorithms: a probabilistic one that detects the existence or absence of nonzero polynomial and rational solutions in $O(\sqrt{N}\log^{2}N)$ bit operations; a deterministic one that computes a compact representation of the solution in $O(N\log^{3}N)$ bit operations. Similar speed-ups are obtained in indefinite and definite hypergeometric summation. We describe the results of an implementation.Comment: This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistributio

A family of linearizable recurrences with the Laurent property

We consider a family of non-linear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced recently by Lam and Pylyavskyy. Furthermore, each member of this family is shown to be linearizable in two different ways, in the sense that its iterates satisfy both a linear relation with constant coefficients and a linear relation with periodic coefficients. Associated monodromy matrices and first integrals are constructed, and the connection with the dressing chain for Schrödinger operators is also explained

Symplectic Maps from Cluster Algebras

We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation operations, as well as a set of associated cluster mutations that are applied to a set of affine coordinates (the cluster variables). Fordy and Marsh recently provided a complete classification of all such quivers that have a certain periodicity property under sequences of mutations. This periodicity implies that a suitable sequence of cluster mutations is precisely equivalent to iteration of a nonlinear recurrence relation. Here we explain briefly how to introduce a symplectic structure in this setting, which is preserved by a corresponding birational map (possibly on a space of lower dimension). We give examples of both integrable and non-integrable maps that arise from this construction. We use algebraic entropy as an approach to classifying integrable cases. The degrees of the iterates satisfy a tropical version of the map

Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order

We employ computer algebra algorithms to prove a collection of identities involving Bessel functions with half-integer orders and other special functions. These identities appear in the famous Handbook of Mathematical Functions, as well as in its successor, the DLMF, but their proofs were lost. We use generating functions and symbolic summation techniques to produce new proofs for them.Comment: Final version, some typos were corrected. 21 pages, uses svmult.cl