Related papers: Exact calculation of degrees for lattice equations…
We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer…
In this paper we investigate the integrability of two-dimensional partial difference equations using the newly developed techniques of study of the degree of the iterates. We show that while for generic, nonintegrable equations, the degree…
We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…
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 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 conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
We study complexity in terms of degree growth of one-component lattice equations defined on a $3\times 3$ stencil. The equations include two in Hirota bilinear form and the Boussinesq equations of regular, modified and Schwarzian type.…
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…
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.
In this letter we show that the results of degree growth (algebraic entropy) calculations for lattice equations strongly depend on the initial value problem that one chooses. We consider two problematic types of initial value…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We describe a method for investigating the integrable character of a given three-point mapping, provided that the mapping has confined singularities. Our method, dubbed "express", is inspired by a novel approach recently proposed by R.G.…
An approach to master symmetries of lattice equations is proposed by the use of discrete zero curvature equation. Its key is to generate non-isospectral flows from the discrete spectral problem associated with a given lattice equation. A…
In this letter we report on the unexpected possibility of applying the full-deautonomisation approach we recently proposed for predicting the algebraic entropy of second-order birational mappings, to discrete lattice equations. Moreover, we…
We present a family of high order trapezoidal rule-based quadratures for a class of singular integrals, where the integrand has a point singularity. The singular part of the integrand is expanded in a Taylor series involving terms of…
We develop a parallel algorithm that calculates the exact partition function of a lattice polymer, by enumerating the number of conformations for each energy level. An efficient parallelization of the calculation is achieved by classifying…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and…
In this introductory work I will present the Finite Difference method for hyperbolic equations, focusing on a method which has second order precision both in time and space (the so-called staggered leapfrog method) and applying it to the…
Recently, the higher order averaging method for studying periodic solutions of both Lipschitz differential equations and discontinuous piecewise smooth differential equations was developed in terms of Brouwer degree theory. Between the…