The Inverse Scattering Transform for the Nonlinear Schrödinger Equation

posterthesiscode

Abstract: The Nonlinear Schrödinger (NLS) Equation

iψt+12ψxx±ψ2ψ=0i \psi_t+\frac{1}{2}\psi_{xx}\pm \lvert \psi \rvert^2 \psi = 0

is a nonlinear partial differential equation which is used to model physical phenomena such as nonlinear effects inside of optical fibers and the formation of rogue waves in shallow water. In this thesis, we highlight two methods of obtaining solutions to the (NLS) equation: the Inverse Scattering Transform and the Dressing Method. Furthermore, we study a particular class of solutions called solitons and multi-solitons. Solitons, also called solitary travelling waves, are localized traveling waves which arise as solutions to several nonlinear dispersive partial differential equations. We use the Dressing Method to numerically compute 100-soliton solutions to the NLS equation with 500 digits of precision. We then analyze the statistical properties of these multi-soliton solutions and compare them to some established results computed using other methods.

The minimum degree of (Ks,Kt)(K_s, K_t)-co-critical graphs

posterarXivslides

Abstract: Given graphs G,H1,H2G, H_1, H_2, we write G(H1,H2)G \rightarrow ({H}_1, H_2) if every {red, blue}-coloring of the edges of GG contains a red copy of H1H_1 or a blue copy of H2H_2. A non-complete graph GG is (H1,H2)(H_1, H_2)-co-critical if
G(H1,H2),G \nrightarrow ({H}_1, H_2), but G+e(H1,H2)G+e\rightarrow ({H}_1, H_2) for every edge ee in the complement of GG. Galluccio, Simonovits and Simonyi in 1992 proved that every (K3,K3)(K_3, K_3)-co-critical graph on n6n\ge6 vertices has minimum degree at least four, and this bound is sharp for all n6n\ge 6. In this paper, we first extend this result to all (Ks,Kt)(K_s, K_t)-co-critical graphs by showing that every (Ks,Kt)(K_s, K_t)-co-critical graph n9n\ge9 has minimum degree at least 2t+s52t+s-5, where ts3t\ge s\ge 3. We then prove that every (K3,K4)(K_3, K_4)-co-critical graph has minimum degree at least seven, and this bound is sharp for all n9n\ge 9. This answers a question of the third author in the positive for the case s=3s=3 and t=4t=4.