A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots (or knots with ordered Gauss code) and their product.
Study bounds growth rate of irreducible meanders, showing proportion vanishes.
Study on a new class of meanders with tangential intersections.
Generalizes meander diagrams to virtual knots and introduces new invariants.
Resolving Schwartz's quadratic meander number conjecture
Counting meanders on surfaces of arbitrary genus, with precise asymptotics.
A meander is a topological configuration of a line and a simple closed curve in the plane (or a pair of simple closed curves on the 2-sphere) intersecting transversally. Meanders can be traced back to H. Poincaré and naturally appear in various areas of mathematics, theoretical physics and computational biology (in par…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let …
In his 1985 paper Sullivan sketched a proof of his structural stability theorem for differentiable group actions satisfying certain expansion-hyperbolicity axioms. In this paper we relax Sullivan's axioms and introduce a notion of "meandering hyperbolicity" for group actions on geodesic metric spaces. This generalizati…
New model for links uses meander diagrams and combinatorics.
Minimal constructions of meanders and hyperelliptic pillowcase covers help in understanding ratio-optimizing pseudo-Anosovs.
We found a way to code meanders and show they are idempotent.
New estimate of semimeander complexity for knots with more than 10 crossings.
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph is a knotted loop, then there exists a plane diagram of such that (i) each edge of is represented…
The problem of which Gauss diagram can be realized by plane curves is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that needed conditions for realizability of a Gauss diagram can be interpreted as follows "the number of exits = the number of entran…
We propose a simple stochastic model for the dynamics of a limit order book, extending the recent work of Cont and de Larrard (2013), where the price dynamics are endogenous, resulting from market transactions. We also show that the conditional diffusion limit of the price process is the so-called Brownian meander.
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of meanders and braids. We also introduce and apply a method to compare the effici…
This note re-addresses the Paris barrier options proposed by Yor and collaborators and their valuation using the Laplace transform approach. The notion of Paris barrier options, based on excursion theory and using the Brownian meander, is extended such that their valuation is now possible at any point during their life…
The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.
Jablan and Radović originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number of a knot, respectively, and prove they are well defined. We answer two questions a…
Paper presents a GAN model for realistic river image synthesis.
Investigates Q value evolution in Stable Baselines for DQL in simple vs complex environments.
Study uses DMD to analyze oceanic features in Strait of Gibraltar.