Related papers: n-th discrete KP hierarchy

We present a discrete analogue of the so-called symmetry reduced or `constrained' KP hierarchy. As a result we obtain integrable discretisations, in both space and time, of some well-known continuous integrable systems such as the nonlinear…

Analytic-bilinear approach for construction and study of integrable hierarchies, in particular, the KP hierarchy is discussed. It is based on the generalized Hirota identity. This approach allows to represent generalized hierarchies of…

Integrable hierarchies associated with the singular sector of the KP hierarchy, or equivalently, with $\dbar$-operators of non-zero index are studied. They arise as the restriction of the standard KP hierarchy to submanifols of finite…

Coclass theory can be used to define infinite families of finite p-groups of a fixed coclass. It is conjectured that the groups in one of these infinite families all have isomorphic mod-p cohomology rings. Here we prove that almost all…

We introduce and systematically develop two classes of discrete integrable operators: those with $2\times 2$ matrix kernels and those possessing general differential kernels, thereby generalizing the discrete analogue previously studied. A…

We use the representation theory of the infinite matrix group to show that (in the polynomial case) the $n$--vector $k$--constrained KP hierarchy has a natural geometrical interpretation on Sato's infinite Grassmannian. This description…

We propose a definition of a diffiety based on the theory of Frolicher structures. As a consequence, we obtain a natural Vinogradov sequence and, under the assumption of the existence of a suitable derivation, we can form on it a…

A systematic reformulation of the KP hierarchy by using continuous Miwa variables is presented. Basic quantities and relations are defined and determinantal expressions for Fay's identities are obtained. It is shown that in terms of these…

The discrete KP hierarchy is also known as the $(l-l')$--th modified KP hierarchy. Here in this paper, we consider the corresponding two--component generalization, called the two--component discrete KP (2dKP) hierarchy. Firstly, starting…

The dispersionless limit of the scalar nonlocal dbar-problem is derived. It is given by a special class of nonlinear first-order equations. A quasi-classical version of the dbar-dressing method is presented. It is shown that the algebraic…

We present classes of discrete reversible systems which are at the same time chaotic and solvable.

Following the techniques of M. Sato (see \cite{Sa}), a generalization of the KP hierarchy for more than one variable is proposed. An approach to the classification of solutions and a method to construct algebraic solutions is also offered.

We introduce a generalisation of the KP hierarchy, closely related to the cyclic quiver and the Cherednik algebra $H_k(\mathbb Z_m)$. This hierarchy depends on $m$ parameters (one of which can be eliminated), with the usual KP hierarchy…

We construct infinite families of abstract regular polytopes of type $\{4,p_1,\ldots,p_{n-1}\}$ from extensions of centrally symmetric spherical abstract regular $n$-polytopes. In addition, by applying the halving operation, we obtain…

A higher dimensional analogue of the KP hierarchy is presented. Fundamental constituents of the theory are pseudo-differential operators with Moyal algebraic coefficients. The new hierarchy can be interpreted as large-$N$ limit of…

We introduce the notion of homotopically discrete n-fold category as an n-fold generalization of a groupoid with no non-trivial loops. We give two equivalent descriptions of this structure: in terms of a Segal-type model and in terms of…

In this paper we classify all capable finite $p$-groups with derived subgroup of order $p$ and $G/G'$ of rank $n-1$.

We define the coupled modified KP hierarchy and its dispersionless limit. This integrable hierarchy is a generalization of the ''half'' of the Toda lattice hierarchy as well as an extension of the mKP hierarchy. The solutions are…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…