Seminar
Twistor Theory of Plane Waves
Lower and Upper Bounds on the Complexity of Regular Graphs
Marcin Bownik - A selector form of the Weaver conjecture and the Feichtinger conjecture
Dynamical Similarity of Time-Series
Tropical variety of a subvariety in torus
Studying isogeny-based cryptography using lattice geometry, Part 2: Theta-functions
A canonical algebraic cycle associated to a curve in its Jacobian
The Eisenstein ideal at prime-square level
The time-efficient DLN algorithms for the Navier-Stokes equations
Dahlquist, Liniger, and Nevanlinna proposed a two-step time-stepping scheme for systems of ordinary differential equations (ODEs) in 1983. The little-explored variable time-stepping scheme has advantages in numerical simulations for its fine properties such as unconditional G-stability and second-order accuracy.