2000 character limit reached
A complexity approach to the soliton resolution conjecture (1407.7570v1)
Published 28 Jul 2014 in math-ph, math.AP, math.DS, and math.MP
Abstract: The soliton resolution conjecture is one of the most interesting open problems in the theory of nonlinear dispersive equations. Roughly speaking it asserts that a solution with generic initial condition converges to a finite number of solitons plus a radiative term. In this paper we use the complexity of a finite object, a notion introduced in Algorithmic Information Theory, to show that the soliton resolution conjecture is equivalent to the analogous of the second law of thermodynamics for the complexity of a solution of a dispersive equation.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.