🌀 nonlinear sciences

Arithmetic selection rules in dispersionless Hamiltonian systems

This paper derives arithmetic selection rules for Liouville integrability in dispersionless Hamiltonian systems, revealing that solutions to a negative Pell equation generate infinite integrals of motion while establishing correspondences between combinatorial polynomial sequences (specifically Motzkin and binomial systems) and specific integrable field theories like the Levi system and dispersionless derivative nonlinear Schrödinger equation.

Original authors: Fatma Aydogmus, Mustafa Mullahasanoglu

Published 2026-08-12

📖 4 min read☕ Coffee break read

CC BY 4.0

Original authors: Fatma Aydogmus, Mustafa Mullahasanoglu

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the universe as a giant, chaotic dance floor where particles zoom, collide, and swirl. Sometimes, this dance is simple and predictable, like a line of people marching in step. Other times, it's a wild, nonlinear mosh pit where a tiny push can send everyone flying in unexpected directions. Physicists have long been obsessed with finding the "hidden rules" that keep certain complex dances from turning into total chaos. These special dances are called integrable systems. Think of them as a magical playlist where, no matter how wild the music gets, the dancers never crash into each other because they are guided by an infinite number of invisible safety nets, or "conserved quantities," that lock the motion into a perfect, repeatable pattern.

To find these patterns, scientists often use a mathematical toolkit called Hamiltonian mechanics, which treats the universe like a giant machine with gears (fields) and springs (momentum). When these machines are "dispersionless," it means we are ignoring the tiny, wiggly ripples that usually spread out waves, focusing instead on the big, smooth flow of the traffic. The big question is: Can we build these perfect, non-chaotic machines just by looking at the numbers and shapes of the equations? Specifically, can we use the rules of combinatorics—the math of counting and arranging things, like counting the ways to walk up a staircase—to design these perfect Hamiltonian machines?

This paper takes a playful yet rigorous journey into that question. The authors, Fatma Aydogmus and Mustafa Mullahasanoglu, act like mathematical architects who are trying to build a new kind of perfect machine using only monomial blocks (simple terms like $x^2y^3$ ). They discovered that you can't just stack these blocks however you like; the universe demands a strict "arithmetic selection rule." If you pick the wrong powers for your blocks, the machine jams. But if you pick the right ones, the blocks fit together in a way that generates an infinite family of safety nets, ensuring the system remains perfectly ordered.

Here is the twist: The authors found that for a specific type of machine, the only way to pick the right block powers is to solve a famous number puzzle called the negative Pell equation. It's like trying to build a tower where the height of each brick must satisfy a secret code. The paper shows that this code generates an infinite list of valid brick sizes, which in turn creates an infinite set of conserved quantities that all work together without conflict.

The researchers also connected these new mathematical toys to famous, real-world physics models. They showed that their "Motzkin model" (named after a specific sequence of numbers used to count paths) is actually the smooth, ripple-free version of a known system called the Levi system. Similarly, their "binomial model" turns out to be the smooth version of the derivative nonlinear Schrödinger equation, a famous model used to describe light pulses in fiber optics. Even cooler, they found that the binomial model hides a simpler, one-dimensional secret: it behaves exactly like the inviscid Burgers equation, which describes how traffic jams form when cars can't slow down fast enough.

By translating these complex physics problems into number puzzles, the authors didn't just find new equations; they revealed a hidden bridge between the abstract world of counting numbers and the physical world of fluid dynamics and light. They suggest that the "perfect" systems we see in nature might be just the tip of the iceberg, with a vast, undiscovered ocean of similar systems waiting to be found by solving more of these number riddles. While they haven't built a time machine or a new energy source, they have provided a new map for finding the hidden order in the chaos of the universe.

Technical Summary: Arithmetic Selection Rules in Dispersionless Hamiltonian Systems

Problem Statement
The paper investigates the structural correspondence between combinatorial polynomial sequences and Liouville integrable Hamiltonian field theories in $1+1$ dimensions. While integrable systems are typically characterized by dispersive equations (e.g., NLS, DNLS), this work focuses on their dispersionless limits, which are described by first-order quasilinear partial differential equations. The central problem is to determine how specific combinatorial structures (Motzkin and binomial polynomials) generate integrable hierarchies and to derive the underlying arithmetic constraints that govern the existence of infinite sets of commuting conserved charges (integrals of motion) for general monomial Hamiltonian systems.

Methodology
The authors employ a Hamiltonian framework for classical field theory, utilizing real scalar fields $\phi(x,t)$ and canonical momenta $\pi(x,t)$ . The methodology proceeds through three primary avenues:

Combinatorial Mapping: The authors analyze the Motzkin model and the binomial model, where charge densities are constructed from specific polynomial sequences. They verify Liouville integrability by demonstrating the existence of an infinite set of functionally independent conserved functionals $I_n$ that are in involution (i.e., their Poisson brackets vanish: $\{I_n, I_m\} = 0$ ).
Dispersionless Reduction: The paper establishes explicit correspondences between these combinatorial models and known dispersive integrable systems. By taking the dispersionless limit ( $\epsilon \to 0$ ) of the Levi system and the derivative nonlinear Schrödinger (DNLS) equation, the authors show these reduce to the Motzkin and binomial models, respectively.
Arithmetic Derivation: For a generalized monomial Hamiltonian $H = \int dx \, \pi^r (\phi')^s$ , the authors derive arithmetic selection rules. These rules are necessary conditions for a monomial charge density $I_{i,j} = \int dx \, \pi^i (\phi')^j$ to be conserved and for pairs of such charges to be in involution. The conservation condition $\dot{I}_{i,j} = 0$ and the involution condition $\{I_{n,m}, I_{k,l}\} = 0$ are transformed into Diophantine equations governing the exponents $(i,j)$ .

Key Contributions and Results

Motzkin-Levi Correspondence: The paper demonstrates that the Motzkin model, defined by the Hamiltonian $H = \int dx (\pi^2\phi' + \pi(\phi')^2)$ , is the dispersionless limit of the Levi system. The authors show that shifting the polynomial variable $\beta$ by a constant $k$ preserves the integrability structure, allowing the Motzkin model to match the dispersionless Levi system exactly.
Binomial-DNLS and Burgers Correspondence: The binomial model, with charge densities $P_n = (c\pi\phi' + a\pi + b\phi')^n$ , is shown to be equivalent to the dispersionless derivative nonlinear Schrödinger (DNLS) equation (also known as the Kaup–Newell system). Furthermore, the composite field variable $P$ in this model satisfies the inviscid Burgers equation. The authors show that higher-order charges in this hierarchy generate generalized Burgers-type conservation laws.
Derivation of Arithmetic Selection Rules: A primary theoretical contribution is the derivation of selection rules for monomial Hamiltonians. For a fixed Hamiltonian exponent pair $(r,s)$ $(r, s)$ , the exponents $(i,j)$ $(i, j)$ of any conserved monomial charge must satisfy a specific rational equation.
- For the case $(r,s) = (2,1)$ , the rule yields the Motzkin-like family where $j=1$ and $i$ is arbitrary.
- For $(r,s) = (2,2)$ , the rule yields the binomial family where $i=j$ .
- For the novel case $(r,s) = (2,3)$ , the selection rule transforms into a negative Pell equation:
  $x^2 - 3y^2 = -2$
  where $x = 2j-1$ and $y = 2i-1$ .
New Integrable Model via Pell Equation: The solutions to this negative Pell equation generate an infinite, sparse sequence of integer pairs $(i,j)$ . The authors prove that the corresponding monomial charges constructed from these solutions are mutually in involution. This establishes a new class of dispersionless integrable systems defined by the arithmetic properties of the Pell equation, distinct from the previously known Motzkin and binomial families.

Significance and Claims
The paper claims that Liouville integrability conditions for monomial systems can be reduced to number-theoretic problems. Specifically, the existence of an infinite hierarchy of commuting conserved quantities is guaranteed if the exponents of the charges satisfy a negative Pell-type Diophantine equation.

The authors position this work as a bridge between combinatorics and integrable systems, suggesting that dispersive models (like NLS and DNLS) are part of a connected network where their dispersionless limits reveal underlying arithmetic structures. They assert that the newly identified Pell-based model constitutes a novel dispersionless integrable class. The paper concludes by noting that while the current analysis is restricted to $1+1$ dimensions, the arithmetic selection rule framework offers a pathway for investigating multidimensional dispersionless systems and potential dispersive deformations, though the explicit construction of such deformations is left for future work. The study emphasizes that the "combinatorial perspective" provides a systematic method for generating and classifying integrable Hamiltonian systems.

Technical Summary: Arithmetic Selection Rules in Dispersionless Hamiltonian Systems

More like this