Conservation laws for difference equations. Peter Hydon (Surrey) Elizabeth Mansfield (Kent) Olexandr Rasin (Bar-Ilan) Tim Grant (Surrey)

Similar documents
Symmetry Reductions of Integrable Lattice Equations

arxiv: v2 [math-ph] 24 Feb 2016

GEOMETRY OF DISCRETE INTEGRABILITY. THE CONSISTENCY APPROACH

Symmetry Methods for Differential and Difference Equations. Peter Hydon

Relativistic Collisions as Yang Baxter maps

ON THE SYMMETRIES OF INTEGRABLE PARTIAL DIFFERENCE EQUATIONS

On Miura Transformations and Volterra-Type Equations Associated with the Adler Bobenko Suris Equations

Conservation laws and symmetries of difference equations. Submitted for the degree of Doctor of Philosophy at The University of Surrey

From discrete differential geometry to the classification of discrete integrable systems

MATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by

arxiv:nlin/ v2 [nlin.si] 22 Sep 2006

A variational perspective on continuum limits of ABS and lattice GD equations

Symbolic Computation of Lax Pairs of Systems of Partial Difference Equations Using Consistency Around the Cube

Symbolic Computation of Lax Pairs of Nonlinear Systems of Partial Difference Equations using Multidimensional Consistency

NOTES ON SPLITTING FIELDS

Classification of integrable equations on quad-graphs. The consistency approach

On the Linearization of Second-Order Dif ferential and Dif ference Equations

arxiv: v1 [nlin.si] 17 Oct 2010

Discrete differential geometry. Integrability as consistency

Linearization of Second-Order Ordinary Dif ferential Equations by Generalized Sundman Transformations

arxiv:nlin/ v1 [nlin.si] 16 Nov 2003

(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y

Cohomology and Vector Bundles

Linear Algebra Review

Linear equations in linear algebra

arxiv: v1 [nlin.si] 29 Jun 2009

Hilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.

Chapter 2: Approximating Solutions of Linear Systems

Practice Final Solutions. 1. Consider the following algorithm. Assume that n 1. line code 1 alg(n) { 2 j = 0 3 if (n = 0) { 4 return j

Dispersionless integrable systems in 3D and Einstein-Weyl geometry. Eugene Ferapontov

Linear Equations in Linear Algebra

Computational Techniques Prof. Sreenivas Jayanthi. Department of Chemical Engineering Indian institute of Technology, Madras

The Hamiltonian operator and states

CS481F01 Solutions 8

Supplement. The Alternating Groups A n are Simple for n 5

Part II. Geometry and Groups. Year

LECTURE 28: VECTOR BUNDLES AND FIBER BUNDLES

Group Actions and Cohomology in the Calculus of Variations

On universality of critical behaviour in Hamiltonian PDEs

Week 5-6: Lectures The Charged Scalar Field

From Yang-Baxter maps to integrable quad maps and recurrences

MA106 Linear Algebra lecture notes

Chapter 7 Network Flow Problems, I

Symbolic Computation of Lax Pairs of Integrable Nonlinear Partial Difference Equations on Quad-Graphs

2 of PU_2015_ of PU_2015_ of PU_2015_118

UNIT 3 REASONING WITH EQUATIONS Lesson 2: Solving Systems of Equations Instruction

Automata on linear orderings

Design and Analysis of Algorithms

Superintegrability? Hidden linearity? Classical quantization? Symmetries and more symmetries!

Section Gaussian Elimination

SIGNATURES OVER FINITE FIELDS OF GROWTH PROPERTIES FOR LATTICE EQUATIONS

Linear Equations in Linear Algebra

A Brief Introduction to Numerical Methods for Differential Equations

Symmetries and Polynomials

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.

Symmetries and Group Invariant Reductions of Integrable Partial Difference Equations

ME Computational Fluid Mechanics Lecture 5

The Gauss-Jordan Elimination Algorithm

Paths, cycles, trees and sub(di)graphs in directed graphs

Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018

Numerical algorithms for one and two target optimal controls

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.

Lecture 1: Systems of linear equations and their solutions

Linear Algebra Review

arxiv:math/ v1 [math.qa] 8 May 2006

Fractals and Fractal Dimensions

118 PU Ph D Mathematics

Lecture III: Tensor calculus and electrodynamics in flat spacetime

Continuous and Discrete Homotopy Operators with Applications in Integrability Testing. Willy Hereman

Diffeomorphism Invariant Gauge Theories

(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

If every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable

Constraints on Fluid Dynamics From Equilibrium Partition Func

arxiv:nlin/ v1 [nlin.si] 17 Sep 2006

Chapter 1. Vectors, Matrices, and Linear Spaces

Soliton solutions to the ABS list

Chapter 2 Notes, Linear Algebra 5e Lay

MATH45061: SOLUTION SHEET 1 V

Notes on graduate algebra. Robert Harron

Linear Algebra Lecture Notes

LP relaxation and Tree Packing for Minimum k-cuts

The classification of root systems

Convolutional networks. Sebastian Seung

Application of Euler and Homotopy Operators to Integrability Testing

Part III Symmetries, Fields and Particles

b 0 + b 1 z b d z d

Final Exam Practice Problems Answers Math 24 Winter 2012

Discrete Differential Geometry: Consistency as Integrability

Linear Algebra (Part II) Vector Spaces, Independence, Span and Bases

SYMBOLIC COMPUTATION OF LAX PAIRS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS

Automorphism groups of wreath product digraphs

Computability Theoretic Properties of Injection Structures

Alexei F. Cheviakov. University of Saskatchewan, Saskatoon, Canada. INPL seminar June 09, 2011

Graph Transformations T1 and T2

Order 3 elements in G 2 and idempotents in symmetric composition algebras. Alberto Elduque

PETER A. CHOLAK, PETER GERDES, AND KAREN LANGE

Linear Independence. Consider a plane P that includes the origin in R 3 {u, v, w} in P. and non-zero vectors

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I

Transcription:

Conservation laws for difference equations Peter Hydon (Surrey) Elizabeth Mansfield (Kent) Olexandr Rasin (Bar-Ilan) Tim Grant (Surrey)

Introduction: What is a conservation law? What is a conservation law?

Introduction: What is a conservation law? What is a conservation law? Differential equations: An expression of the form D i (P i (x, [u])) = 0 i that holds on all solutions of the given equation.

Introduction: What is a conservation law? What is a conservation law? Differential equations: An expression of the form D i (P i (x, [u])) = 0 i that holds on all solutions of the given equation. Difference equations: Something similar, replacing derivatives by differences? Forwards, backwards, something else?

Introduction: What is a conservation law? What is a conservation law? Differential equations: An expression of the form D i (P i (x, [u])) = 0 i that holds on all solutions of the given equation. Difference equations: Something similar, replacing derivatives by differences? Forwards, backwards, something else? Observation: Such expressions can be written in standard form, (S i id) F i (n, [u]) = 0, where S i is the unit forward shift in n i. i

Introduction: What is a conservation law? What is a conservation law? Differential equations: An expression of the form D i (P i (x, [u])) = 0 i that holds on all solutions of the given equation. Difference equations: Something similar, replacing derivatives by differences? Forwards, backwards, something else? Observation: Such expressions can be written in standard form, (S i id) F i (n, [u]) = 0, where S i is the unit forward shift in n i. i Question: Why not use equivalent expressions? This one is useful: S i A i (n, [u]) = A i (n, [u]). i i

Introduction: What is a conservation law? Answer: The Euler operator E annihilates all divergences; indeed, the variational complex is exact. Λ n 2,0 d H Λ n 1,0 d H Λ n,0 Divergences are the elements of ker(e). E Λ n,1

Introduction: What is a conservation law? Answer: The Euler operator E annihilates all divergences; indeed, the variational complex is exact. Λ n 2,0 d H Λ n 1,0 d H Λ n,0 Divergences are the elements of ker(e). E Λ n,1 Difference operators also produce a variational complex; now ker(e) is the set of all standard-form expressions.

Quad-graph equations Quad-graph equations u 0,1 α u 1,1 β β u 0,0 α u 1,0 Independent variables: k, l Z; dependent variable u R (or C). Quad-graph equations depend on u i,j = u(k + i, l + j), i, j {0, 1}.

Quad-graph equations Quad-graph equations u 0,1 α u 1,1 β β u 0,0 α u 1,0 Independent variables: k, l Z; dependent variable u R (or C). Quad-graph equations depend on u i,j = u(k + i, l + j), i, j {0, 1}. Consistency-on-a-cube implies integrability (ABS classification and others); α = α(k), β = β(l).

Quad-graph equations ABS classification Other conditions applied by Adler, Bobenko and Suris (2003): Linearity in each u i,j ;

Quad-graph equations ABS classification Other conditions applied by Adler, Bobenko and Suris (2003): Linearity in each u i,j ; D 4 symmetry;

Quad-graph equations ABS classification Other conditions applied by Adler, Bobenko and Suris (2003): Linearity in each u i,j ; D 4 symmetry; Tetrahedron property

Quad-graph equations ABS classification Other conditions applied by Adler, Bobenko and Suris (2003): Linearity in each u i,j ; D 4 symmetry; Tetrahedron property necessary for 3-leg form variational Toda type system.

Quad-graph equations ABS classification Other conditions applied by Adler, Bobenko and Suris (2003): Linearity in each u i,j ; D 4 symmetry; Tetrahedron property necessary for 3-leg form variational Toda type system. ABS classification is up to Möbius transformations of u and point transformations of parameters.

Quad-graph equations Q1 : α(u 0,0 u 0,1 )(u 1,0 u 1,1 ) β(u 0,0 u 1,0 )(u 0,1 u 1,1 ) + δ 2 αβ(α β) = 0, Q2 : α(u 0,0 u 0,1 )(u 1,0 u 1,1 ) β(u 0,0 u 1,0 )(u 0,1 u 1,1 ) + αβ(α β)(u 0,0 + u 1,0 + u 0,1 + u 1,1 ) αβ(α β)(α 2 αβ + β 2 ) = 0, Q3 : (β 2 α 2 )(u 0,0 u 1,1 + u 1,0 u 0,1 ) + β(α 2 1)(u 0,0 u 1,0 + u 0,1 u 1,1 ) α(β 2 1)(u 0,0 u 0,1 + u 1,0 u 1,1 ) δ 2 (α 2 β 2 )(α 2 1)(β 2 1)/(4αβ) = 0, Q4 : sn(α)(u 0,0 u 1,0 + u 0,1 u 1,1 ) sn(β)(u 0,0 u 0,1 + u 1,0 u 1,1 ) sn(α β)(u 0,0 u 1,1 + u 1,0 u 0,1 ) +sn(α β)sn(α)sn(β)(1 + K 2 u 0,0 u 1,0 u 0,1 u 1,1 ) = 0, H1 : (u 0,0 u 1,1 )(u 1,0 u 0,1 ) + β α = 0, H2 : (u 0,0 u 1,1 )(u 1,0 u 0,1 ) + (β α)(u 0,0 + u 1,0 + u 0,1 + u 1,1 ) + β 2 α 2 = 0, H3 : α(u 0,0 u 1,0 + u 0,1 u 1,1 ) β(u 0,0 u 0,1 + u 1,0 u 1,1 ) + δ 2 (α 2 β 2 ) = 0, A1 : α(u 0,0 + u 0,1 )(u 1,0 + u 1,1 ) β(u 0,0 + u 1,0 )(u 0,1 + u 1,1 ) δ 2 αβ(α β) = 0, A2 : (β 2 α 2 )(u 0,0 u 1,0 u 0,1 u 1,1 + 1) + β(α 2 1)(u 0,0 u 0,1 + u 1,0 u 1,1 ) α(β 2 1)(u 0,0 u 1,0 + u 0,1 u 1,1 ) = 0.

Three-point conservation laws Three-point conservation laws Definition: A conservation law (CLaw) of a quad-graph equation is an expression (S k I )F + (S l I )G = 0 that holds on all solutions of the equation.

Three-point conservation laws Three-point conservation laws Definition: A conservation law (CLaw) of a quad-graph equation is an expression (S k I )F + (S l I )G = 0 that holds on all solutions of the equation. Problem: Find a basis for the vector space of all equivalence classes of CLaws.

Three-point conservation laws Three-point conservation laws Definition: A conservation law (CLaw) of a quad-graph equation is an expression (S k I )F + (S l I )G = 0 that holds on all solutions of the equation. Problem: Find a basis for the vector space of all equivalence classes of CLaws. Too hard start small.

Three-point conservation laws u 0,1 S l G u 1,1 F S k F u 0,0 G u 1,0 The simplest nontrivial CLaws have F = F (k, l, u 0,0, u 0,1 ), G = G(k, l, u 0,0, u 1,0 ).

Three-point conservation laws u 0,1 S l G u 1,1 F S k F u 0,0 G u 1,0 The simplest nontrivial CLaws have F = F (k, l, u 0,0, u 0,1 ), G = G(k, l, u 0,0, u 1,0 ). The determining equation for u 1,1 = ω is F (k + 1, l, u 1,0, ω) F (k, l, u 0,0, u 0,1 ) + G(k, l + 1, u 0,1, ω) G(k, l, u 0,0, u 1,0 ) = 0.

Three-point conservation laws Solution Method Apply the commuting operators to get L 1 = u 1,0 ω 1,0 ω 0,0, L 2 = ω 0,1 u 0,0 u 0,1 ω 0,0 u 0,0, L 1 L 2 { F (k, l, u0,0, u 0,1 ) + G(k, l, u 0,0, u 1,0 ) } = 0.

Three-point conservation laws Solution Method Apply the commuting operators to get L 1 = u 1,0 ω 1,0 ω 0,0, L 2 = ω 0,1 u 0,0 u 0,1 ω 0,0 u 0,0, L 1 L 2 { F (k, l, u0,0, u 0,1 ) + G(k, l, u 0,0, u 1,0 ) } = 0. This reduces to a PDE of order 5 for F. For ABS equations, D 4 symmetry gives extra information.

Three-point conservation laws Solution Method Apply the commuting operators to get L 1 = u 1,0 ω 1,0 ω 0,0, L 2 = ω 0,1 u 0,0 u 0,1 ω 0,0 u 0,0, L 1 L 2 { F (k, l, u0,0, u 0,1 ) + G(k, l, u 0,0, u 1,0 ) } = 0. This reduces to a PDE of order 5 for F. For ABS equations, D 4 symmetry gives extra information. Elimination can be made faster for some quad-graph equations.

Three-point conservation laws Example: For the dpkdv equation (H1) u 1,1 = u 0,0 + β α u 1,0 u 0,1, the set of three-point CLaws (up to equivalence) is spanned by F 1 = ( 1) k+l ( 2u 0,0 u 0,1 β ), G 1 = ( 1) k+l ( 2u 0,0 u 1,0 α ), F 2 = ( u 0,0 u 0,1 ) ( u0,0 u 0,1 β ), G 2 = ( u 0,0 u 1,0 ) ( u0,0 u 1,0 α ), F 3 = ( 1) k+l ( u 0,0 + u 0,1 ) ( u0,0 u 0,1 β ), G 3 = ( 1) k+l ( u 0,0 + u 1,0 ) ( u0,0 u 1,0 α ), F 4 = ( 1) k+l ( 2u 0,0 2 u0,1 2 4βu0,0 u 0,1 + β 2), G 4 = ( 1) k+l ( 2u 0,0 2 u1,0 2 4αu0,0 u 1,0 + α 2).

Three-point conservation laws Example: For the dpkdv equation (H1) u 1,1 = u 0,0 + β α u 1,0 u 0,1, the set of three-point CLaws (up to equivalence) is spanned by F 1 = ( 1) k+l ( 2u 0,0 u 0,1 β ), G 1 = ( 1) k+l ( 2u 0,0 u 1,0 α ), F 2 = ( u 0,0 u 0,1 ) ( u0,0 u 0,1 β ), G 2 = ( u 0,0 u 1,0 ) ( u0,0 u 1,0 α ), F 3 = ( 1) k+l ( u 0,0 + u 0,1 ) ( u0,0 u 0,1 β ), G 3 = ( 1) k+l ( u 0,0 + u 1,0 ) ( u0,0 u 1,0 α ), F 4 = ( 1) k+l ( 2u 0,0 2 u0,1 2 4βu0,0 u 0,1 + β 2), G 4 = ( 1) k+l ( 2u 0,0 2 u1,0 2 4αu0,0 u 1,0 + α 2). Other ABS equations: 4 CLaws : Q1 δ=0 (cross-ratio), A1 δ=0, H3 δ=0 (dpmkdv); 1 CLaw : Q2, Q3 δ=1, Q4 K 2 1; 2 CLaws : all other equations.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1)

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values. 3 Apply appropriate differential operators to reduce the number of unknown functions.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values. 3 Apply appropriate differential operators to reduce the number of unknown functions. 4 Having reached a PDE, back-substitute and solve the resulting linear difference equations.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values. 3 Apply appropriate differential operators to reduce the number of unknown functions. 4 Having reached a PDE, back-substitute and solve the resulting linear difference equations. 5 Iterate, if necessary.

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values. 3 Apply appropriate differential operators to reduce the number of unknown functions. 4 Having reached a PDE, back-substitute and solve the resulting linear difference equations. 5 Iterate, if necessary. Potential problems: Expression swell,

Five-point conservation laws The same process can be used to find higher conservation laws for u 1,1 = ω(k, l, u 0,0, u 1,0, u 0,1 ). (1) 1 Choose the form of F and G. 2 Use (1) and its shifts to write the conservation law in terms of initial values. 3 Apply appropriate differential operators to reduce the number of unknown functions. 4 Having reached a PDE, back-substitute and solve the resulting linear difference equations. 5 Iterate, if necessary. Potential problems: Expression swell, difficulty solving Es.

Five-point conservation laws Five-point conservation laws F G u 0,0 F G u 0,0 F F G G For arbitrary u 1,1 = ω, one can use the staircase.

Five-point conservation laws Five-point conservation laws F G u 0,0 F G u 0,0 F F G G For arbitrary u 1,1 = ω, one can use the staircase. For ABS, the cross is more efficient.

Five-point conservation laws Example: The dpkdv equation has the following five-point CLaws (modulo three-point and trivial CLaws): F 1 = ln (u 0,1 u 1,0 ), G 1 = ln (u 1,0 u 1,0 ), F 2 = ln (u 0,1 u 0, 1 ), G 2 = ln(u 1,0 u 0, 1 ), F 3 = kf 1 + lf 2, G 3 = kg 1 + lg 2.

Five-point conservation laws Example: The dpkdv equation has the following five-point CLaws (modulo three-point and trivial CLaws): F 1 = ln (u 0,1 u 1,0 ), G 1 = ln (u 1,0 u 1,0 ), F 2 = ln (u 0,1 u 0, 1 ), G 2 = ln(u 1,0 u 0, 1 ), F 3 = kf 1 + lf 2, G 3 = kg 1 + lg 2. For constant α, β: every ABS equation has something similar (at least).

What more can be done? What more can be done? Direct computation of five-point CLaws is the limit (for now).

What more can be done? What more can be done? Direct computation of five-point CLaws is the limit (for now). However, the action of symmetries on CLaws may give new ones.

What more can be done? What more can be done? Direct computation of five-point CLaws is the limit (for now). However, the action of symmetries on CLaws may give new ones. Example: For dpkdv, apply the mastersymmetry to X 8 = k u 1,0 u 1,0 u0,0 α F 1 = ln (u 0,1 u 1,0 ), G 1 = ln (u 1,0 u 1,0 ), to get (up to equivalence) the new CLaw F = 1 (u 0,0 u 2,0 )(u 0,1 u 1,0 ), G = 1 (u 0,0 u 2,0 )(u 1,0 u 1,0 ).

What more can be done? What more can be done? Direct computation of five-point CLaws is the limit (for now). However, the action of symmetries on CLaws may give new ones. Example: For dpkdv, apply the mastersymmetry to X 8 = k u 1,0 u 1,0 u0,0 α F 1 = ln (u 0,1 u 1,0 ), G 1 = ln (u 1,0 u 1,0 ), to get (up to equivalence) the new CLaw F = 1 (u 0,0 u 2,0 )(u 0,1 u 1,0 ), G = 1 (u 0,0 u 2,0 )(u 1,0 u 1,0 ). Warning: apparent novelty must be checked; use characteristics.

What more can be done? Another approach An alternative approach to generating possibly infinite hierarchies of CLaws is as follows:

What more can be done? Another approach An alternative approach to generating possibly infinite hierarchies of CLaws is as follows: 1 Find symmetries and mastersymmetries for Toda type systems (building on quad-graph results).

What more can be done? Another approach An alternative approach to generating possibly infinite hierarchies of CLaws is as follows: 1 Find symmetries and mastersymmetries for Toda type systems (building on quad-graph results). 2 Check which (if any) are variational symmetries.

What more can be done? Another approach An alternative approach to generating possibly infinite hierarchies of CLaws is as follows: 1 Find symmetries and mastersymmetries for Toda type systems (building on quad-graph results). 2 Check which (if any) are variational symmetries. 3 Construct CLaws from variational symmetries with the discrete version of Noether s Theorem.

What more can be done? Another approach An alternative approach to generating possibly infinite hierarchies of CLaws is as follows: 1 Find symmetries and mastersymmetries for Toda type systems (building on quad-graph results). 2 Check which (if any) are variational symmetries. 3 Construct CLaws from variational symmetries with the discrete version of Noether s Theorem. Drawback: The resulting CLaws found so far are quite messy!

Summary and open problems Summary For each of the ABS equations with constant parameters, the direct approach has yielded infinite hierarchies of symmetries;

Summary and open problems Summary For each of the ABS equations with constant parameters, the direct approach has yielded infinite hierarchies of symmetries; low-order conservation laws;

Summary and open problems Summary For each of the ABS equations with constant parameters, the direct approach has yielded infinite hierarchies of symmetries; low-order conservation laws; the possibility of generating higher-order conservation laws.

Summary and open problems Summary For each of the ABS equations with constant parameters, the direct approach has yielded infinite hierarchies of symmetries; low-order conservation laws; the possibility of generating higher-order conservation laws. However, there are no five-point symmetries or CLaws if neither α nor β are constant.

Summary and open problems Open Problems Are there any higher symmetries and CLaws when α and β are not constant?

Summary and open problems Open Problems Are there any higher symmetries and CLaws when α and β are not constant? Does each of the ABS equations have infinitely many CLaws (up to equivalence)?

Summary and open problems Open Problems Are there any higher symmetries and CLaws when α and β are not constant? Does each of the ABS equations have infinitely many CLaws (up to equivalence)? If so, is this a property shared by all integrable quad graphs?

Summary and open problems Open Problems Are there any higher symmetries and CLaws when α and β are not constant? Does each of the ABS equations have infinitely many CLaws (up to equivalence)? If so, is this a property shared by all integrable quad graphs? Is there a one-to-one correspondence between variational symmetries and CLaws (up to equivalence)?

Summary and open problems The End