中文
相关论文

相关论文: On (joint) equidistributions of mesh patterns 123 …

200 篇论文

This paper is continuation of the systematic study of distribution of quadrant marked mesh patterns initiated in "S. Kitaev and J. Remmel, Quadrant marked mesh patterns, J. Integer Sequences 12, Issue 4 (2012), Article 12.4.7.". We study…

组合数学 · 数学 2012-07-10 Sergey Kitaev , Jeffrey Remmel

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

组合数学 · 数学 2018-05-07 Arthur Nunge

In the set of all patterns in $S_n$, it is clear that each k-pattern occurs equally often. If we instead restrict to the class of permutations avoiding a specific pattern, the situation quickly becomes more interesting. Mikl\'os B\'ona…

组合数学 · 数学 2012-12-03 Cheyne Homberger

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

组合数学 · 数学 2011-08-15 Adam M. Goyt , Lara K. Pudwell

We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We enumerate alternating sign matrices whose key avoids a given…

组合数学 · 数学 2025-03-19 Mathilde Bouvel , Rebecca Smith , Jessica Striker

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…

组合数学 · 数学 2014-09-15 Miklós Bóna , Cheyne Homberger , Jay Pantone , Vincent Vatter

Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…

组合数学 · 数学 2026-01-21 Sergi Elizalde , Amya Luo

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

概率论 · 数学 2018-04-18 Svante Janson

We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…

组合数学 · 数学 2025-07-15 Yang Li , Sergey Kitaev , Zhicong Lin , Jing Liu

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

组合数学 · 数学 2023-10-04 Per Alexandersson , Samuel Asefa Fufa , Frether Getachew , Dun Qiu

In this paper, we compute and demonstrate the equivalence of the joint distribution of the first letter and descent statistics on six avoidance classes of permutations corresponding to two patterns of length four. This distribution is in…

组合数学 · 数学 2021-05-19 Toufik Mansour , Mark Shattuck

Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…

组合数学 · 数学 2017-04-20 Colton Keller , Jessica Striker

The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…

组合数学 · 数学 2009-05-20 Xavier Gérard Viennot

In this paper, we construct bijections between Dyck paths, noncrossing partitions, and 231-avoiding permutations, which send the area statistic on Dyck paths to the inversion number on noncrossing partitions and on 231-avoiding…

组合数学 · 数学 2013-10-28 Christian Stump

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

组合数学 · 数学 2007-05-23 Sergi Elizalde

The aim of this paper is two-fold. We first prove several new interpretations of a kind of $(q,t)$-Catalan numbers along with their corresponding $\gamma$-expansions using pattern avoiding permutations. Secondly, we give a complete…

组合数学 · 数学 2018-10-16 Shishuo Fu , Dazhao Tang , Bin Han , Jiang Zeng

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

组合数学 · 数学 2013-06-21 Marie-Louise Bruner

We prove the equidistribution of several multistatistics over some classes of permutations avoiding a $3$-length pattern. We deduce the equidistribution, on the one hand of inv and foze" statistics, and on the other hand that of maj and…

离散数学 · 计算机科学 2021-08-12 Phan Thuan Do , Thi Thu Huong Tran , Vincent Vajnovszki

We exploit Krattenthaler's bijection between the set $S_n(3\textrm{-}1\textrm{-}2)$ of permutations in $S_n$ avoiding the classical pattern $3\textrm{-}1\textrm{-}2$ and Dyck $n$-paths to study the distribution of every consecutive pattern…

组合数学 · 数学 2009-04-02 M. Barnabei , F. Bonetti , M. Silimbani

Finding distributions of statistics in pattern-avoiding permutations has attracted significant attention in the literature. In particular, Chen, Kitaev, and Zhang derived functional equations for the joint distributions of any subset of…

组合数学 · 数学 2025-09-19 Alice L. L. Gao , Sergey Kitaev , Ya-Xing Li , Xuan Ruan