English
Related papers

Related papers: Parabolic Catalan numbers count flagged Schur func…

200 papers

Shuffles are n-multipermutations with suit multiplicities given by a subset R of {1,..,n-1}. Their inverses are ordered partitions of {1,..,n} whose block sizes derive from R. These "R-permutations" depict the min length coset reps for the…

Combinatorics · Mathematics 2017-02-28 Robert A. Proctor , Matthew J. Willis

This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R.…

Combinatorics · Mathematics 2023-06-22 Robert A. Proctor , Matthew J. Willis

Let $\lambda$ be a partition with no more than $n$ parts. Let $\beta$ be a weakly increasing $n$-tuple with entries from $\{ 1, ... , n \}$. The flagged Schur function in the variables $x_1, ... , x_n$ that is indexed by $\lambda$ and…

Combinatorics · Mathematics 2023-06-22 Robert A. Proctor , Matthew J. Willis

The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…

Combinatorics · Mathematics 2017-07-11 Robert A. Proctor , Matthew J. Willis

Catalan functions, the graded Euler characteristics of certain vector bundles on the flag variety, are a rich class of symmetric functions which include $k$-Schur functions and parabolic Hall-Littlewood polynomials. We prove that Catalan…

Combinatorics · Mathematics 2020-07-13 Jonah Blasiak , Jennifer Morse , Anna Pun

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…

Combinatorics · Mathematics 2024-11-14 Noah Cape , Shaul Zemel

We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. We then discuss a family of polynomials…

Combinatorics · Mathematics 2013-03-18 Jeffrey Ferreira

We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…

Combinatorics · Mathematics 2015-03-13 Joel Brewster Lewis

Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the…

Discrete Mathematics · Computer Science 2020-09-23 J. -L. Baril , G. Cerbai , C. Khalil , V. Vajnovszki

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,…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Samuel Asefa Fufa , Frether Getachew , Dun Qiu

Stanley symmetric functions are the stable limits of Schubert polynomials. In this paper, we show that, conversely, Schubert polynomials are Demazure truncations of Stanley symmetric functions. This parallels the relationship between Schur…

Combinatorics · Mathematics 2018-09-14 Sami Assaf , Anne Schilling

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

Quantum Algebra · Mathematics 2007-05-23 L. Lapointe , A. Lascoux , J. Morse

We make a broad conjecture about the $k$-Schur positivity of Catalan functions, symmetric functions which generalize the (parabolic) Hall-Littlewood polynomials. We resolve the conjecture with positive combinatorial formulas in cases which…

Combinatorics · Mathematics 2018-11-07 Jonah Blasiak , Jennifer Morse , Anna Pun , Daniel Summers

The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…

Combinatorics · Mathematics 2009-09-03 Robin Langer

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

Combinatorics · Mathematics 2007-05-23 E. Barcucci , A. Bernini , M. Poneti

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , R. J. Dolbin , Nathan Manning

Calogero-Sutherland models associated to the Weyl groups of type A and B with exchange terms included in the Hamiltonians systems have non-symmetric eigenfunctions, which are products of the ground state with members of a family of…

q-alg · Mathematics 2009-10-30 Charles F. Dunkl

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…

Combinatorics · Mathematics 2025-03-19 Mathilde Bouvel , Rebecca Smith , Jessica Striker

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

Combinatorics · Mathematics 2007-05-23 David Callan
‹ Prev 1 2 3 10 Next ›