English
Related papers

Related papers: Set-valued Rothe Tableaux and Grothendieck Polynom…

200 papers

The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin…

Combinatorics · Mathematics 2014-03-21 Robin Sulzgruber

The problem of finding Schur-positive sets of permutations, originally posed by Gessel and Reutenauer, has seen some recent developments. Schur-positive sets of pattern-avoiding permutations have been found by Sagan et al and a general…

Combinatorics · Mathematics 2016-09-26 Sergi Elizalde , Yuval Roichman

The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…

Combinatorics · Mathematics 2010-11-30 Matthieu Josuat-Vergès

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

Combinatorics · Mathematics 2023-09-19 Alejandro H. Morales , Daniel G. Zhu

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

Combinatorics · Mathematics 2021-04-29 Florian Aigner , Gabriel Frieden

Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a combinatorial formula for Kazhdan-Lusztig polynomials of…

Combinatorics · Mathematics 2019-11-13 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$…

This paper is the sequel of the paper under the same title with part 1, where we introduced refined canonical stable Grothendieck polynomials and their duals with two families of infinite parameters. In this paper we give combinatorial…

Combinatorics · Mathematics 2025-04-23 Byung-Hak Hwang , Jihyeug Jang , Jang Soo Kim , Minho Song , U-Keun Song

We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and…

Combinatorics · Mathematics 2020-09-01 A. N. Kirillov , H. Naruse

Given a direct sum $A$ of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of $A$ and the dimensions of the irreducible $A$-modules, then this can be thought of as providing an analogue of…

Combinatorics · Mathematics 2025-07-04 John M. Campbell

The notion of an Abstract Young (briefly: AY) representation is a natural generalization of the classical Young orthogonal form. The AY representations of the symmetric group are characterized by Adin, Brenti and Roichman in [U2]. In this…

Representation Theory · Mathematics 2007-10-23 Yona Cherniavsky

For a skew shape $\lambda/\mu$, we define the hybrid Grothendieck polynomial $${G}_{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w}) =\sum_{T\in \mathrm{SVRPP}(\lambda/\mu)} \textbf{x}^{\mathrm{ircont}(T)}\textbf{t}^{\mathrm{ceq}…

Combinatorics · Mathematics 2025-05-27 Peter L. Guo , Mingyang Kang , Jiaji Liu

The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…

Combinatorics · Mathematics 2026-02-17 Nimisha Pahuja

Suppose $\lambda$ and $\mu$ are integer partitions with $\lambda\supseteq\mu$. Kenyon and Wilson have introduced the notion of a cover-inclusive Dyck tiling of the skew Young diagram $\lambda\setminus\mu$, which has applications in the…

Combinatorics · Mathematics 2015-01-30 Matthew Fayers

The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…

Combinatorics · Mathematics 2020-05-22 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…

Combinatorics · Mathematics 2019-11-26 Ekaterina A. Vassilieva

Over the past years, major attention has been drawn to the question of identifying Schur-positive sets, i.e. sets of permutations whose associated quasisymmetric function is symmetric and can be written as a non-negative sum of Schur…

Combinatorics · Mathematics 2020-12-04 Alina R. Mayorova , Ekaterina A. Vassilieva

The classical Tutte polynomial is a two-variate polynomial $T_G(x,y)$ associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,y)$ associated to a bipartite graph $H$ that we call the…

Combinatorics · Mathematics 2024-05-08 Csongor Beke , Gergely Kál Csáji , Péter Csikvári , Sára Pituk

In this paper, we give bijections between the set of 4123-avoiding down-up alternating permutations of length $2n$ and the set of standard Young tableaux of shape $(n,n,n)$, and between the set of 4123-avoiding down-up alternating…

Combinatorics · Mathematics 2012-03-22 Sherry H. F. Yan , Yuexiao Xu

We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…

Combinatorics · Mathematics 2012-05-31 Greta Panova
‹ Prev 1 3 4 5 6 7 10 Next ›