Related papers: Cyclic descents for Motzkin paths

\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a local operation that exchanges a vertex in the current set…

We prove a new CLT for the difference of linear eigenvalue statistics of a Wigner random matrix $H$ and its minor $\hat H$ and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a…

In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a…

In this note, we provide a short proof of Theorem 3.3 in the paper titled \emph{Crystals, semistandard tableaux and cyclic sieving phenomenon}, by Y.-T.~Oh and E.~Park, which concerns a cyclic sieving phenomenon on semi-standard Young…

The equation of motion of affine Toda field theory is a coupled equation for $r$ fields, $r$ is the rank of the underlying Lie algebra. Most of the theories admit reduction, in which the equation is satisfied by fewer than $r$ fields. The…

We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

This paper deals with the distribution of descent number in standard Young tableaux of certain shapes. A simple explicit formula is presented for the number of tableaux of any shape with two rows, with any specified number of descents. For…

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

Monotonic surfaces spanning finite regions of $Z^d$ arise in many contexts, including DNA-based self-assembly, card-shuffling and lozenge tilings. One method that has been used to uniformly generate these surfaces is a Markov chain that…

Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…

We consider a matrix branching random walk on the semi-group of nonnegative matrices, where we are able to derive, under general assumptions, an analogue of Biggins' martingale convergence theorem for the additive martingale $W_n$, a spinal…

The notion of symmetric and asymmetric peaks in Dyck paths was introduced by Fl\'orez and Rodr\'{\i}guez, who counted the total number of such peaks over all Dyck paths of a given length. In this paper we generalize their results by giving…

In a recent paper, Lai and Rohatgi proved a "shuffling theorem" for lozenge tilings of a hexagon with "dents" (i.e., missing triangles). Here, we shall point out that this follows immediately from the enumeration of Gelfand--Tsetlin…

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

We study skew-maps given by a minimal homeomorphism on the basis and a cocycle of affine isometries on the fibers. We call such a map a cylindrical vortex. We extend to this setting some classical results of Atkinson, Besicovitch,…

As a generalization of weak Bruhat orders on permutations, in 1989 Manin and Schechtman introduced the notion of a higher Bruhat order on the $d$-element subsets of a set $[n]=\{1,2,\ldots,n\}$. Among other results in this field, they…

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…