Related papers: Meanders and Dyck-Path Billiards
We study the statistics of semi-meanders, i.e. configurations of a set of roads crossing a river through n bridges, and possibly winding around its source, as a toy model for compact folding of polymers. By analyzing the results of a direct…
We study billiards in domains enclosed by circular polygons. These are closed $C^1$ strictly convex curves formed by finitely many circular arcs. We prove the existence of a set in phase space, corresponding to generic sliding trajectories…
We present a semiclassical theory for transport through open billiards of arbitrary convex shape that includes diffractively scattered paths at the lead openings. Starting from a Dyson equation for the semiclassical Green's function we…
Pappe, Paul, and Schilling introduced two combinatorial statistics, depth and ddinv, associated with classical Dyck paths, and proved that the distributions of (area, depth) and (dinv, ddinv) are $q,t$-symmetric by constructing an…
We study the $(q,t)$-enumeration of triangular Dyck paths considered by Bergeron and Mazin. To do so, we introduce the notion of triangular and sim-sym tableaux and the deficit statistic which is a new interpretation of the dinv. We use it…
Let $f: [0, +\infty) \to (0, +\infty)$ be a sufficiently smooth convex function, vanishing at infinity. Consider the planar domain $Q$ delimited by the positive $x$-semiaxis, the positive $y$-semiaxis, and the graph of $f$. Under certain…
Using heuristic arguments based on the trace formulas, we analytically calculate the semiclassical two-point correlation form factor for a family of rectangular billiards with a barrier of height irrational with respect to the side of the…
We study a class of planar billiards having the remarkable property that their phase space consists up to a set of zero measure of two invariant sets formed by orbits moving in opposite directions. The tables of these billiards are tubular…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
From a geometric viewpoint, billiard trajectories and geodesics are related by mutual approximation results. In one direction, it is known that every geodesic curve in the boundary of a smooth convex body can be approximated by a sequence…
Two polygons $P,Q$ are code equivalent if there are billiard orbits $u,v$ which hit the same sequence of sides and such that the projections of the orbits are dense in the boundaries $\partial P, \partial Q$. Our main results show when code…
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…
We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area,skip,dinv) are given, we have an algorithm to construct…
Classical transport in a doubly connected polygonal billiard, i.e. the annulus square billiard, is considered. Dynamical properties of the billiard flow with a fixed initial direction are analyzed by means of the moments of arbitrary order…
A periodic trajectory on a polygonal billiard table is stable if it persists under any sufficiently small perturbation of the table. It is a standard result that a periodic trajectory on an $n$-gon gives rise in a natural way to a closed…
We prove some partial results on the periodicity of billiard systems on graphs. The results specialize to the case of $n$ billiards with equal mass on the unit interval or circle traveling at the same speed.
The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the…
The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…
We show that the complexity of the billiard in a typical polygon grows cubically and the number of saddle connections grows quadratically along certain subsequences. It is known that the set of points whose first n-bounces hits the same…
We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…