Searcharxiv⌕ Search

arXiv subjects

Sanjay Ramassamy

Publications and source records attributed to Sanjay Ramassamy.

24 records · Page 2Linked to original sources

Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the enumeration of descent classes of permutations, which is done via the boustrophedon construction. In other cases, we solve the question by introducing multidimensional versions of the boustrophedon. In particular we find new interpretations for the Euler up/down numbers and the Entringer numbers.

math.CO↗

Two-sided infinite-bin models and analyticity for Barak-Erdős graphs

In this article, we prove that for any probability distribution $μ$ on $\mathbb{N}$ one can construct a two-sided stationary version of the infinite-bin model (an interacting particle system introduced by Foss and Konstantopoulos) with move distribution $μ$. Using this result, we obtain a new formula for the speed of the front of infinite-bin models, as a series of positive terms. This implies that the growth rate $C(p)$ of the longest path in a Barak-Erdős graph of parameter $p$ is analytic on $(0,1]$.

math.PR↗

A first integrability result for Miquel dynamics

Miquel dynamics is a discrete-time dynamical system on the space of square-grid circle patterns. For biperiodic circle patterns with both periods equal to two, we show that the dynamics corresponds to translation on an elliptic curve, thus providing the first integrability result for this dynamics. The main tool is a geometric interpretation of the addition law on the normalization of binodal quartic curves.

math.DS↗

Modular periodicity of the Euler numbers and a sequence by Arnold

For any positive integer $q$, the sequence of the Euler up/down numbers reduced modulo $q$ was proved to be ultimately periodic by Knuth and Buckholtz. Based on computer simulations, we state for each value of $q$ precise conjectures for the minimal period and for the position at which the sequence starts being periodic. When $q$ is a power of $2$, a sequence defined by Arnold appears, and we formulate a conjecture for a simple computation of this sequence.

math.CO↗

The Hilbert-Galton board

We introduce the Hilbert-Galton board as a variant of the classical Galton board. Balls fall into a row of bins at a rate depending on the bin, and at random times, each bin gets shifted one unit to the right and an empty bin is added to the left. We compute the stationary distribution of this Markov chain and show the existence of an enriched Markov chain on triangular arrays of numbers which projects down to the Hilbert-Galton board. We also define finite-ball projections of the Hilbert-Galton board, for which we compute the stationary distribution, the full spectrum and the grand coupling time.

math.PR↗

Dimers on Rail Yard Graphs

We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in the so-called boson-fermion correspondence. This allows to reformulate the RYG dimer model as a Schur process, i.e. as a random sequence of integer partitions subject to some interlacing conditions. Beyond the computation of the partition function, we provide an explicit expression for all correlation functions or, equivalently, for the inverse Kasteleyn matrix of the RYG dimer model. This expression, which is amenable to asymptotic analysis, follows from an exact combinatorial description of the operators localizing dimers in the transfer-matrix formalism, and then a suitable application of Wick's theorem. Plane partitions, domino tilings of the Aztec diamond, pyramid partitions, and steep tilings arise as particular cases of the RYG dimer model. For the Aztec diamond, we provide new derivations of the edge-probability generating function, of the biased creation rate, of the inverse Kasteleyn matrix and of the arctic circle theorem.

math-ph↗