English
Related papers

Related papers: Cyclic descents for Motzkin paths

200 papers

The Witten $r$-spin class defines a non-semisimple cohomological field theory. Pandharipande, Pixton and Zvonkine studied two special shifts of the Witten class along two semisimple directions of the associated Dubrovin--Frobenius manifold…

Algebraic Geometry · Mathematics 2024-04-12 Séverin Charbonnier , Nitin Kumar Chidambaram , Elba Garcia-Failde , Alessandro Giacchetto

Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon's descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types $A$,$B$,$C$, $H_3$, and rank two groups.…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…

Combinatorics · Mathematics 2010-02-08 Christos A. Athanasiadis , Persi Diaconis

The jeu de taquin process produced a standard Young tableau from a skew standard Young tableau by shifting its entries to the northwest. We generalize this process to posets: certain partial numberings of any poset are shifted upward. A…

Combinatorics · Mathematics 2023-08-04 Robert A. Proctor

Regression splines are smooth, flexible, and parsimonious nonparametric function estimators. They are known to be sensitive to knot number and placement, but if assumptions such as monotonicity or convexity may be imposed on the regression…

Applications · Statistics 2008-11-12 Mary C. Meyer

Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…

Probability · Mathematics 2012-10-02 Noam Berger , Yuval Peres

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

Combinatorics · Mathematics 2019-05-24 Zachary Hamaker , Victor Reiner

Rough path theory is focused on capturing and making precise the interactions between highly oscillatory and non-linear systems. It draws on the analysis of LC Young and the geometric algebra of KT Chen. The concepts and the uniform…

Probability · Mathematics 2014-05-20 Terry Lyons

We prove the Gersten conjecture for $p$-adic \'etale Tate twists for a smooth scheme $X$ in mixed characteristic in the Nisnevich topology. Our main observation is that, while $p$-adic \'etale Tate twists are not $\mathbb A^1$-invariant,…

Algebraic Geometry · Mathematics 2024-11-06 Morten Lüders

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

Combinatorics · Mathematics 2007-12-20 J. Irving , A. Rattan

We show that Sch\"utzenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this…

Combinatorics · Mathematics 2008-04-22 T. Kyle Petersen , Pavlo Pylyavskyy , Brendon Rhoades

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Combinatorics · Mathematics 2020-11-30 Pablo Soberón , Yaqian Tang

We develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…

Classical Analysis and ODEs · Mathematics 2022-09-01 Thomas Cass , Bruce K. Driver , Christian Litterer , Emilio Ferrucci

The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…

Combinatorics · Mathematics 2026-02-27 Laura Colmenarejo , Bridget Eileen Tenner , Camryn E. Thompson

We consider random matrices whose shape is the dilation $N\lambda$ of a self-conjugate Young diagram $\lambda$. In the large-$N$ limit, the empirical distribution of the squared singular values converges almost surely to a probability…

Probability · Mathematics 2026-01-26 Elia Bisi , Fabio Deelan Cunden

We discuss the nonlinear phenomena of irreversible tipping for non-autonomous systems where time-varying inputs correspond to a smooth "parameter shift" from one asymptotic value to another. We express tipping in terms of pullback…

Dynamical Systems · Mathematics 2018-04-24 Peter Ashwin , Clare Perryman , Sebastian Wieczorek

In an effort to further understanding $q,t$-Catalan statistics, a new statistic on Dyck paths called $\mathtt{depth}$ was proposed in Pappe, Paul and Schilling (2022) and was shown to be jointly equi-distributed with the well-known…

Combinatorics · Mathematics 2026-05-29 Wenjie Fang

Let $D$ be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) $\mathcal{H}$ of $D$ and a vertex subset (or subdigraph) $Q$ of $D$ are orthogonal if every set (respec., subdigraph) $H \in…

Combinatorics · Mathematics 2026-05-12 Caroline A. de Paula Silva , Cândida Nunes da Silva , Orlando Lee

Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from $(0,0)$ to $(n,n)$. Further research has gone into the topic, with variants like lattice path…

Combinatorics · Mathematics 2022-09-27 Hiranya Kishore Dey , Brahadeesh Sankarnarayanan , S. Venkitesh
‹ Prev 1 8 9 10 Next ›