相关论文: Hecke growth diagrams, and maximal increasing and …

We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do not contain a fixed-size northeast chain and a fixed-size…

We prove a conjecture of Guo and Poznanovi\'{c} concerning chains in certain 01-fillings of moon polyominoes. A key ingredient of our proof is a correspondence between words $w$ and pairs $(\mathcal{W}(w), \mathcal{M}(w))$ of increasing…

We put recent results by Chen, Deng, Du, Stanley and Yan on crossings and nestings of matchings and set partitions in the larger context of the enumeration of fillings of Ferrers shape on which one imposes restrictions on their increasing…

The purpose of this short paper is to put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the…

We put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the enumeration of increasing and…

It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino that do not contain a northeast chain of size $k$ depends only on the set of columns of the polyomino, but not the shape of the polyomino.…

We introduce the structure of vacillating Hecke tableaux, and establish a one-to-one correspondence between vacillating Hecke tableaux and linked partitions by using the Hecke insertion algorithm developed by Buch, Kresch, Shimozono,…

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

We show that maximal 0-1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0-1-fillings of Ferrers…

We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let $\M$ be a moon polyomino with $n$ rows and $m$ columns. Consider all the 01-fillings of $\M$ in…

In this paper, we firstly extend a result of Bonin, Shapiro and Simion by giving the distribution of the major index over generalized Schr\"{o}der paths. Then by providing a bijection between generalized Schr\"{o}der paths and…

The edge expansion of a graph is the minimum quotient of the number of edges in a cut and the size of the smaller one among the two node sets separated by the cut. Bounding the edge expansion from below is important for bounding the…

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show…

We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…

We show that the largest size of a collection of simple closed curves pairwise intersecting at most once on an orientable surface of Euler characteristic $\chi$ grows quadratically in $|\chi|$. This resolves a longstanding question of…

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…