中文
相关论文

相关论文: Enumeration of standard Young tableaux of certain …

200 篇论文

Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can contain unordered sets of integers, with the added condition that every integer at position $(i,j)$ must be smaller that every integer at…

组合数学 · 数学 2018-03-21 Paul Drube , Maxwell Krueger , Ashley Skalsky , Meghan Wren

Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…

组合数学 · 数学 2024-03-25 Sergi Elizalde

In this note, we explicitly compute the probability that a given cell in a random standard Young tableau of the shifted staircase shape $(2n-1, 2n-3, \ldots, 3,1)$ contains the maximal label. We also show that the asymptotic distribution of…

组合数学 · 数学 2025-11-17 Chihiro Kubota , Taizo Sadahiro , Yoshika Ueda

We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants.…

组合数学 · 数学 2010-11-01 Mathilde Bouvel , Luca Ferrari

A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…

组合数学 · 数学 2018-07-27 Robert G. Donnelly , Molly W. Dunkum , Courtney George , Stefan Schnake

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…

组合数学 · 数学 2015-06-09 Eric Neyman

We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.

组合数学 · 数学 2022-09-20 Su Ji Hong , George D. Nasr

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

组合数学 · 数学 2019-02-20 Pawel Hitczenko , Svante Janson

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of…

组合数学 · 数学 2020-06-03 Alejandro H. Morales , Igor Pak , Greta Panova

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

组合数学 · 数学 2014-10-21 Nihal Gowravaram , Ravi Jagadeesan

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…

组合数学 · 数学 2014-03-21 Robin Sulzgruber

We give explicit formulas for the recently introduced Schur multiple zeta values, which generalize multiple zeta(-star) values and which assign to a Young tableaux a real number. In this note we consider Young tableaux of various shapes,…

数论 · 数学 2017-11-28 Henrik Bachmann , Yoshinori Yamasaki

A notion of cyclic descents on standard Young tableaux (SYT) of rectangular shape was introduced by Rhoades, and extended to certain skew shapes by the last two authors. The cyclic descent set restricts to the usual descent set when the…

组合数学 · 数学 2018-03-28 Ron M. Adin , Sergi Elizalde , Yuval Roichman

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…

组合数学 · 数学 2021-06-18 Takeshi Suzuki , Yoshitaka Toyosawa

We obtain truncated restriction estimates of an unexpected form for discrete surfaces \begin{align} S = \{\, ( n_1 , \dots , n_d , R( n_1 , \dots, n_d ) ) \,,\, n_i \in [-N,N] \cap \mathbb{Z} \,\}, \end{align} where $R$ is an indefinite…

数论 · 数学 2019-06-06 Kevin Henriot , Kevin Hughes

We introduce an infinite family of lower triangular matrices $\Gamma^{(s)}$, where $\gamma_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of…

组合数学 · 数学 2008-03-17 M. Barnabei , F. Bonetti , M. Silimbani

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

组合数学 · 数学 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

The Selberg integral is an important integral first evaluated by Selberg in 1944. Stanley found a combinatorial interpretation of the Selberg integral in terms of permutations. In this paper, new combinatorial objects "Young books" are…

组合数学 · 数学 2014-09-05 Jang Soo Kim , Suho Oh

A survey paper, to appear as a chapter in a forthcoming Handbook on Enumeration.

组合数学 · 数学 2014-09-02 Ron M. Adin , Yuval Roichman

We define a new partial order on $SYT_n$, the set of all standard Young tableaux with $n$ cells, by combining the chain order with the notion of horizontal strips. We prove various desirable properties of this new order.

组合数学 · 数学 2021-02-02 Gizem Karaali , Isabella Senturia , Müge Taşkin