English
Related papers

Related papers: A bijection between Tamari intervals and extended …

200 papers

We describe an involution on Tamari intervals and m-Tamari intervals. This involution switches two sets of statistics known as the "rises" and the "contacts" and so proves an open conjecture from Pr\'eville-Ratelle on intervals of the…

Combinatorics · Mathematics 2019-06-04 Viviane Pons

In this article, we study the enumeration by length of several walk models on the square lattice. We obtain bijections between walks in the upper half-plane returning to the $x$-axis and walks in the quarter plane. A recent work by Bostan,…

Combinatorics · Mathematics 2020-02-18 Frédéric Chyzak , Karen Yeats

We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…

Mathematical Physics · Physics 2013-09-27 Iwan Jensen

Foss and Zachary (2003) and Foss, Palmowski and Zachary (2005) studied the probability of achieving a receding boundary on a time interval of random length by a random walk with a heavy-tailed jump distribution. They have proposed and…

Probability · Mathematics 2021-10-22 Pavel Tesemnikov , Sergey Foss

The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…

Combinatorics · Mathematics 2017-11-16 Wenjie Fang

Let $v$ be a grid path made of north and east steps. The lattice $\rm{T{\scriptsize AM}}(v)$, based on all grid paths weakly above $v$ and sharing the same endpoints as $v$, was introduced by Pr\'eville-Ratelle and Viennot (2014) and…

Combinatorics · Mathematics 2016-11-07 Wenjie Fang , Louis-François Préville-Ratelle

We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…

Probability · Mathematics 2025-08-26 Changqing Liu

Given a fixed integer $n\geq 2$, we construct two new finite lattices that we call the cyclic Tamari lattice and the affine Tamari lattice. The cyclic Tamari lattice is a sublattice and a quotient lattice of the cyclic Dyer lattice, which…

Combinatorics · Mathematics 2025-02-12 Grant Barkley , Colin Defant

Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at…

Social and Information Networks · Computer Science 2024-11-20 Lorenzo Dall'Amico , Alain Barrat , Ciro Cattuto

Collective behaviour in living systems is observed across many scales, from bacteria to insects, to fish shoals. Zebrafish have emerged as a model system amenable to laboratory study. Here we report a three-dimensional study of the…

Statistical Mechanics · Physics 2024-05-16 Yushi Yang , Francesco Turci , Erika Kague , Chrissy L. Hammond , John Russo , C. Patrick Royall

This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks…

Combinatorics · Mathematics 2026-05-18 Jonah Berggren , Clément Chenevière

We enumerate the intervals in the Tamari lattices. For this, we introduce an inductive description of the intervals. Then a notion of "new interval" is defined and these are also enumerated. A a side result, the inverse of two special…

Combinatorics · Mathematics 2007-10-24 Frédéric Chapoton

We relate $\phi(\bf{x},s)$, the average number of sites at a transverse distance $\bf{x}$ in the directed animals with $s$ sites in $d$ transverse dimensions, to the two-point correlation function of a lattice gas with nearest neighbor…

Statistical Mechanics · Physics 2009-11-10 Sumedha , Deepak Dhar

We consider a greedy version of the $m$-Tamari order defined on $m$-Dyck paths, recently introduced by Dermenjian. Inspired by intriguing connections between intervals in the ordinary 1-Tamari order and planar triangulations, and more…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou , Frédéric Chapoton

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…

Statistical Mechanics · Physics 2009-11-10 Iwan Jensen

We present new theoretical and empirical results on the probability distributions of species persistence times in natural ecosystems. Persistence times, defined as the timespans occurring between species' colonization and local extinction…

Populations and Evolution · Quantitative Biology 2012-03-21 S. Suweis , E. Bertuzzo , L. Mari , I. Rodriguez-Iturbe , A. Maritan , A. Rinaldo

Lamperti's maximal branching process is revisited, with emphasis on the description of the shape of the invariant measures in both the recurrent and transient regimes. A truncated version of this chain is exhibited, preserving the…

Probability · Mathematics 2019-11-19 Thierry Huillet , Servet Martinez

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

Metric Geometry · Mathematics 2023-12-19 Maxwell Forst , Lenny Fukshansky

We study diffusion on comb lattices of arbitrary dimension. Relying on the loopless structure of these lattices and using first-passage properties, we obtain exact and explicit formulae for the Laplace transforms of the propagators…

Statistical Mechanics · Physics 2016-06-22 Pierre Illien , Olivier Bénichou

It is known that the average hitting times of simple random walks from any vertex to any other vertex in distance-regular graphs are determined by their intersection array. In this paper, we introduce a new graph classification called…

Combinatorics · Mathematics 2024-10-01 Yusaku Nishimura