Searcharxiv⌕ Search

arXiv subjects

Peter H. van der Kamp

Publications and source records attributed to Peter H. van der Kamp.

32 records · Page 2Linked to original sources

Dressing the Dressing Chain

The dressing chain is derived by applying Darboux transformations to the spectral problem of the Korteweg-de Vries (KdV) equation. It is also an auto-Bäcklund transformation for the modified KdV equation. We show that by applying Darboux transformations to the spectral problem of the dressing chain one obtains the lattice KdV equation as the dressing chain of the dressing chain and, that the lattice KdV equation also arises as an auto-Bäcklund transformation for a modified dressing chain. In analogy to the results obtained for the dressing chain (Veselov and Shabat proved complete integrability for odd dimensional periodic reductions), we study the $(0,n)$-periodic reduction of the lattice KdV equation, which is a two-valued correspondence. We provide explicit formulas for its branches and establish complete integrability for odd $n$.

nlin.SI↗

Twisted reductions of integrable lattice equations, and their Lax representations

It is well known that from two-dimensional lattice equations one can derive one-dimensional lattice equations by imposing periodicity in some direction. In this paper we generalize the periodicity condition by adding a symmetry transformation and apply this idea to autonomous and non-autonomous lattice equations. As results of this approach, we obtain new reductions of the discrete potential Korteweg-de Vries equation, discrete modified Korteweg-de Vries equation and the discrete Schwarzian Korteweg-de Vries equation. We will also describe a direct method for obtaining Lax representations for the reduced equations.

nlin.SI↗

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

A three-step method due to Nijhoff and Bobenko & Suris to derive a Lax pair for scalar partial difference equations (PΔEs) is reviewed. The method assumes that the PΔEs are defined on a quadrilateral, and consistent around the cube. Next, the method is extended to systems of PΔEs where one has to carefully account for equations defined on edges of the quadrilateral. Lax pairs are presented for scalar integrable PΔEs classified by Adler, Bobenko, and Suris and systems of PΔEs including the integrable 2-component potential Korteweg-de Vries lattice system, as well as nonlinear Schroedinger and Boussinesq-type lattice systems. Previously unknown Lax pairs are presented for PΔEs recently derived by Hietarinta (J. Phys. A: Math. Theor., 44, 2011, Art. No. 165204). The method is algorithmic and is being implemented in Mathematica.

nlin.SI↗

Discrete Painlevé equations and their Lax pairs as reductions of integrable lattice equations

We present a method of determining a Lax representation for similarity reductions of autonomous and non-autonomous partial difference equations. This method may be used to obtain Lax representations that are general enough to provide the Lax integrability for entire hierarchies of reductions. A main result is, as an example of this framework, how we may obtain the q-Painlevé equation whose group of Bäcklund transformations is an affine Weyl group of type E_6^{(1)} as a similarity reduction of the discrete Schwarzian Korteweg-de Vries equation.

nlin.SI↗

Initial value problems for quad equations

We describe a method to construct well-posed initial value problems for not necessarily integrable equations on not necessarily simply connected quad-graphs. Although the method does not always provide a well-posed initial value problem (not all quad-graphs admit well-posed initial value problems) it is effective in the class of rhombic embeddable quad-graphs.

nlin.SI↗

On the Fourier transform of the greatest common divisor

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with Ramanujan's sum, and on the other hand it can be written as a generalised convolution product of the identity with the totient function. We show that this arithmetic function of two integers (a,m) counts the number of elements in the set of ordered pairs (i,j) such that i*j is equivalent to a modulo m. Furthermore we generalise a dozen known identities for the totient function, to identities which involve the discrete Fourier transform of the greatest common divisor, including its partial sums, and its Lambert series.

math.NT↗

Higher analogues of the discrete-time Toda equation and the quotient-difference algorithm

The discrete-time Toda equation arises as a universal equation for the relevant Hankel determinants associated with one-variable orthogonal polynomials through the mechanism of adjacency, which amounts to the inclusion of shifted weight functions in the orthogonality condition. In this paper we extend this mechanism to a new class of two-variable orthogonal polynomials where the variables are related via an elliptic curve. This leads to a `Higher order Analogue of the Discrete-time Toda' (HADT) equation for the associated Hankel determinants, together with its Lax pair, which is derived from the relevant recurrence relations for the orthogonal polynomials. In a similar way as the quotient-difference (QD) algorithm is related to the discrete-time Toda equation, a novel quotient-quotient-difference (QQD) scheme is presented for the HADT equation. We show that for both the HADT equation and the QQD scheme, there exists well-posed $s$-periodic initial value problems, for almost all $\s\in\Z^2$. From the Lax-pairs we furthermore derive invariants for corresponding reductions to dynamical mappings for some explicit examples.

nlin.SI↗

The staircase method: integrals for periodic reductions of integrable lattice equations

We show, in full generality, that the staircase method provides integrals for mappings, and correspondences, obtained as traveling wave reductions of (systems of) integrable partial difference equations. We apply the staircase method to a variety of equations, including the Korteweg-De Vries equation, the five-point Bruschi-Calogero-Droghei equation, the QD-algorithm, and the Boussinesq system. We show that, in all these cases, if the staircase method provides r integrals for an n-dimensional mapping, with 2r<n, then one can introduce q<= 2r variables, which reduce the dimension of the mapping from n to q. These dimension-reducing variables are obtained as joint invariants of k-symmetries of the mappings. Our results support the idea that often the staircase method provides sufficiently many integrals for the periodic reductions of integrable lattice equations to be completely integrable. We also study reductions on other quad-graphs than the regular 2D lattice, and we prove linear growth of the multi-valuedness of iterates of high-dimensional correspondences obtained as reductions of the QD-algorithm.

nlin.SI↗

Growth of degrees of integrable mappings

We study mappings obtained as s-periodic reductions of the lattice Korteweg-De Vries equation. For small s=(s1,s2) we establish upper bounds on the growth of the degree of the numerator of their iterates. These upper bounds appear to be exact. Moreover, we conjecture that for any s1,s2 that are co-prime the growth is ~n^2/(2s1s2), except when s1+s2=4 where the growth is linear ~n. Also, we conjecture the degree of the n-th iterate in projective space to be ~n^2(s1+s2)/(2s1s2).

nlin.SI↗

Symmetry condition in terms of Lie brackets

A passive orthonomic system of PDEs defines a submanifold in the corresponding jet manifold, coordinated by so called parametric derivatives. We restrict the total differential operators and the prolongation of an evolutionary vector field v to this submanifold. We show that the vanishing of their commutators is equivalent to v being a generalized symmetry of the system.

nlin.SI↗

Global classification of two-component approximately integrable evolution equations

We globally classify two-component evolution equations, with homogeneous diagonal linear part, admitting infinitely many approximate symmetries. Important ingredients are the symbolic calculus of Gel'fand and Dikii, the Skolem-Mahler-Lech theorem, results on diophantine equations in roots of unity by F. Beukers, and an algorithm of C.J. Smyth.

nlin.SI↗

On testing integrability

We demonstrate, using the symbolic method together with p-adic and resultant methods,the existence of systems with exactly one or two generalized symmetries. Since the existence of one or two symmetries is often taken as a sure sign (or as the definition) of integrability, that is, the existence of symmetries on infinitely many orders,this shows that such practice is devoid of any mathematical foundation. Extensive computations show that systems with one symmetry are rather common, and with two symmetries are fairly rare, at least within the class we have been considering in this paper.

nlin.SI↗