scholarly journals Rook placements in Young diagrams and permutation enumeration

2011 ◽  
Vol 47 (1) ◽  
pp. 1-22 ◽  
Author(s):  
Matthieu Josuat-Vergès
Keyword(s):  
Young Diagrams ◽  
Rook Placements ◽  
Permutation Enumeration

scholarly journals LAURENT POLYNOMIAL LANDAU–GINZBURG MODELS FOR COMINUSCULE HOMOGENEOUS SPACES

2021 ◽  
Author(s):  
PETER SPACEK
Keyword(s):  
Homogeneous Space ◽  
Homogeneous Spaces ◽  
Laurent Polynomial ◽  
Complete Intersections ◽  
Laurent Polynomials ◽  
Young Diagrams ◽  
Similar Shape ◽  
Algebraic Torus ◽  
The One ◽  
Polynomial Potentials

AbstractIn this article we construct Laurent polynomial Landau–Ginzburg models for cominuscule homogeneous spaces. These Laurent polynomial potentials are defined on a particular algebraic torus inside the Lie-theoretic mirror model constructed for arbitrary homogeneous spaces in [Rie08]. The Laurent polynomial takes a similar shape to the one given in [Giv96] for projective complete intersections, i.e., it is the sum of the toric coordinates plus a quantum term. We also give a general enumeration method for the summands in the quantum term of the potential in terms of the quiver introduced in [CMP08], associated to the Langlands dual homogeneous space. This enumeration method generalizes the use of Young diagrams for Grassmannians and Lagrangian Grassmannians and can be defined type-independently. The obtained Laurent polynomials coincide with the results obtained so far in [PRW16] and [PR13] for quadrics and Lagrangian Grassmannians. We also obtain new Laurent polynomial Landau–Ginzburg models for orthogonal Grassmannians, the Cayley plane and the Freudenthal variety.

scholarly journals Search for Young diagrams with large dimensions

2019 ◽  
pp. 33-43
Author(s):  
Vasilii S. Duzhin ◽  
◽  
Anastasia A. Chudnovskaya ◽  
Keyword(s):  
Symmetric Group ◽  
Young Diagram ◽  
Numerical Experiments ◽  
Irreducible Representations ◽  
Young Diagrams ◽  
Maximum Dimension ◽  
Asymptotic Combinatorics

Search for Young diagrams with maximum dimensions or, equivalently, search for irreducible representations of the symmetric group $S(n)$ with maximum dimensions is an important problem of asymptotic combinatorics. In this paper, we propose algorithms that transform a Young diagram into another one of the same size but with a larger dimension. As a result of massive numerical experiments, the sequence of $10^6$ Young diagrams with large dimensions was constructed. Furthermore, the proposed algorithms do not change the first 1000 elements of this sequence. This may indicate that most of them have the maximum dimension. It has been found that the dimensions of all Young diagrams of the resulting sequence starting from the 75778th exceed the dimensions of corresponding diagrams of the greedy Plancherel sequence.

scholarly journals On $xD$-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks

10.37236/6699 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Yu-Chang Liang ◽  
Tsai-Lien Wong
Keyword(s):  
Weyl Algebra ◽  
Stirling Numbers ◽  
Stirling Number ◽  
Combinatorial Structures ◽  
Normal Ordering ◽  
Rook Placements ◽  
Threshold Graphs ◽  
Combinatorial Interpretations ◽  
Ferrers Boards

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal ordering problem in the Weyl algebra $W=\langle x,D|Dx-xD=1\rangle$. Any word $\omega\in W$ with $m$ $x$'s and $n$ $D$'s can be expressed in the normally ordered form $\omega=x^{m-n}\sum_{k\ge 0} {{\omega}\brace {k}} x^{k}D^{k}$, where ${{\omega}\brace {k}}$ is known as the Stirling number of the second kind for the word $\omega$. This study considers the expansions of restricted words $\omega$ in $W$ over the sequences $\{(xD)^{k}\}_{k\ge 0}$ and $\{xD^{k}x^{k-1}\}_{k\ge 0}$. Interestingly, the coefficients in individual expansions turn out to be generalizations of the Stirling numbers of the first kind and the Lah numbers. The coefficients will be determined through enumerations of some combinatorial structures linked to the words $\omega$, involving decreasing forest decompositions of quasi-threshold graphs and non-attacking rook placements on Ferrers boards. Extended to $q$-analogues, weighted refinements of the combinatorial interpretations are also investigated for words in the $q$-deformed Weyl algebra.

scholarly journals Hook lengths in a skew Young diagram

10.37236/1309 ◽  
1997 ◽  
Vol 4 (1) ◽  
Author(s):  
Svante Janson
Keyword(s):  
Young Diagram ◽  
Character Degrees ◽  
Young Diagrams ◽  
Inductive Proof

Regev and Vershik (Electronic J. Combinatorics 4 (1997), #R22) have obtained some properties of the set of hook lengths for certain skew Young diagrams, using asymptotic calculations of character degrees. They also conjectured a stronger form of one of their results. We give a simple inductive proof of this conjecture. Very recently, Regev and Zeilberger (Annals of Combinatorics, to appear) have independently proved this conjecture.

scholarly journals REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

2017 ◽  
Vol 82 (2) ◽  
pp. 576-589 ◽  
Author(s):  
KOSTAS HATZIKIRIAKOU ◽  
STEPHEN G. SIMPSON
Keyword(s):  
Theorem Proving ◽  
Chain Condition ◽  
Reverse Mathematics ◽  
Partial Ordering ◽  
Young Diagrams ◽  
Equivalence Proof ◽  
Image Position ◽  
Countably Infinite ◽  
Infinite Set ◽  
Ascending Chain Condition

AbstractLetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$(or even over$RCA_0^{\rm{*}}$) to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

scholarly journals GAUSSIAN FLUCTUATIONS OF REPRESENTATIONS OF WREATH PRODUCTS

2006 ◽  
Vol 09 (04) ◽  
pp. 529-546
Author(s):  
PIOTR ŚNIADY
Keyword(s):  
Finite Group ◽  
Central Limit Theorem ◽  
Limit Theorem ◽  
Regular Representation ◽  
Wreath Products ◽  
Young Diagrams ◽  
Reducible Representation ◽  
Irreducible Components ◽  
Left Regular Representation ◽  
Left Regular

We study the asymptotics of the reducible representations of the wreath products G≀Sq = Gq ⋊ Sq for large q, where G is a fixed finite group and Sq is the symmetric group in q elements; in particular for G = ℤ/2ℤ we recover the hyperoctahedral groups. We decompose such a reducible representation of G≀Sq as a sum of irreducible components (or, equivalently, as a collection of tuples of Young diagrams) and we ask what is the character of a randomly chosen component (or, what are the shapes of Young diagrams in a randomly chosen tuple). Our main result is that for a large class of representations, the fluctuations of characters (and fluctuations of the shape of the Young diagrams) are asymptotically Gaussian. The considered class consists of the representations for which the characters asymptotically almost factorize and it includes, among others, the left regular representation therefore we prove the analogue of Kerov's central limit theorem for wreath products.

Sign in / Sign up

Export Citation Format

Share Document