Searcharxiv⌕ Search

arXiv subjects

Claude Viallet

Publications and source records attributed to Claude Viallet.

7 recordsLinked to original sources
arXiv2011

Integrable lattice equations with vertex and bond variables

We present integrable lattice equations on a two dimensional square lattice with coupled vertex and bond variables. In some of the models the vertex dynamics is independent of the evolution of the bond variables, and one can write the equations as non-autonomous "Yang-Baxter maps". We also present a model in which the vertex and bond variables are fully coupled. Integrability is tested with algebraic entropy as well as multidimensional consistency

nlin.SI↗
arXiv2011

Weak Lax pairs for lattice equations

We consider various 2D lattice equations and their integrability, from the point of view of 3D consistency, Lax pairs and Bäcklund transformations. We show that these concepts, which are associated with integrability, are not strictly equivalent. In the course of our analysis, we introduce a number of black and white lattice models, as well as variants of the functional Yang-Baxter equation.

nlin.SI↗
arXiv2007

Searching for integrable lattice maps using factorization

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of iteration. The results were then classified using algebraic entropy. Some new models with polynomial growth (strongly associated with integrability) were found. One of them is a nonsymmetric generalization of the homogeneous quadratic maps associated with KdV (modified and Schwarzian), for this new model we have also verified the "consistency around a cube".

nlin.SI↗
arXiv2006

Algebraic Entropy for lattice equations

We give the basic definition of algebraic entropy for lattice equations. The entropy is a canonical measure of the complexity of the dynamics they define. Its vanishing is a signal of integrability, and can be used as a powerful integrability detector. It is also conjectured to take remarkable values (algebraic integers).

math-ph↗
arXiv2005

On the complexity of some birational transformations

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, and relies mainly on univariate polynomial algebra, the second approach is a singularity analysis, and the third method is more numerical, using integer arithmetics. Each method has its own domain of application, but they give corroborating results, and lead us to a conjecture on the complexity of a class of maps constructed from matrix inversions.

math-ph↗
arXiv1997

Singularity confinement and chaos in discrete systems

We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the analysis of the complexity (``algebraic entropy'') of the map using the growth of the degree of its iterates: integrability is associated with polynomial growth while the generic growth is exponential for chaotic systems.

solv-int↗