Standard Young tableauxColored Motzkin pathsShuffles of parenthesis systemsBijectionIn this paper, we propose a notion of colored Motzkin paths and establish a bijection between the n-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length n. This result not ...
On the distribution of the spectrum of the sum of two hermitian or real symmetric matrices More precisely, translation of the lattice permutation and semistandard Young tableaux rules to a set of linear inequalities, enable us to express the ... A Frumkin,A Goldberger - 《Advances in Applied ...
摘要: Using symbolic computation with Maple, we can discover lots of (rigorously-proved!) facts about Standard Young Tableaux, in particular the distribution of the entries in any specific cell, and the sorting probabilities.关键词: Young tabelau Enumeration Symbolic computation ...
The problem, particularly in case of two stacks, exhibits classical objects in combinatorics such as permutations with forbidden subsequences, nonseparable planar maps [4, 5], and also standard Young tableaux if we are interested in the ... S Dulucq,O Guibert - 《Discrete Mathematics》 被引量...
Young tableaux and linear independence of standard monomials in multiminors of a multimatrix 来自 掌桥科研 喜欢 0 阅读量: 11 作者:SS Abhyankar,SR Ghorpade DOI: 10.1016/0012-365x(91)90467-g 年份: 1991 收藏 引用 批量引用 报错 分享 全部来源 免费下载 求助全文 Elsevier (全网免费下载) 掌桥科研...
Let SYT_n be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYT_n and some of their crucial properties, we prove three main results: (i)Intervals in any of these four orders essent...
An Extension of the Foata Map to Standard Young TableauxAn Extension of the Foata Map to Standard Young Tableaux05E1005E15permutationstreesgroup actionfixed pointsWe give a combinatorial proof of the result of Hetyei and Reiner that there are exactly $n!/3$ permutations of length $n$ in ...
Enumeration of Semi--Standard Young Tableaux 4> ): Next, the length of the longest increasing subsequence of a permutation coincides with the common base size of the pair of tableaux associated with ... D Gouyou-Beauchamps,L Orsay 被引量: 0发表: 1996年 A unifying poset perspective on alte...
Dyck Paths, Standard Young Tableaux, and Pattern Avoiding Permutations ?Hilmar Haukur GudmundssonH. H. Gudmundsson, Dyck paths, standard Young tableaux, and pattern avoiding permutations, Pure Math. Appl. (PU.M.A.), 21 (2010), no. 2, 265-284....
In this paper we consider the enumeration of three kinds of standard Young tableaux (SYT) of truncated shapes by use of the method of multiple integrals. A product formula for the number of truncated shapes of the form (nm, n − r)\\\δk–1 is given, which implies that the number ...