scholarly journals Tableaux and plane partitions of truncated shapes (extended abstract)

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Greta Panova
Keyword(s):  
Generating Function ◽  
Schur Functions ◽  
Young Tableaux ◽  
Young Diagrams ◽  
Plane Partitions ◽  
Nous Trouvons ◽  
International Audience

International audience 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 number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated by a staircase and a rectangle truncated by a square minus a box. The proofs involve finding the generating function of the corresponding plane partitions using interpretations and formulas for sums of restricted Schur functions and their specializations. The number of standard tableaux is then found as a certain limit of this function. Nous considérons un nouveau type de partitions planes, ou de tableaux de Young, droits ou décalés, obtenus en privant leurs diagrammes de certaines cellules en haut à droite, et dans certains cas nous trouvons des formules d'énumération pour les tableaux standard. Les preuves impliquent le calcul de la fonction génératrice pour les partitions planes correspondantes, en utilisant des interprétations et des formules pour les sommes de fonctions de Schur restreintes et leurs spécialisations. Le nombre de tableaux standard est alors obtenu comme une certaine limite de cette fonction.

scholarly journals The poset perspective on alternating sign matrices

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Jessica Striker
Keyword(s):  
Generating Function ◽  
Young Tableaux ◽  
Alternating Sign Matrices ◽  
Plane Partitions ◽  
Combinatorial Objects ◽  
Symmetric Plane ◽  
International Audience ◽  
Order Ideals ◽  
Nous Utilisons

International audience Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a certain poset, proving that they are in bijection with a variety of interesting combinatorial objects, including ASMs, totally symmetric self―complementary plane partitions (TSSCPPs), Catalan objects, tournaments, semistandard Young tableaux, and totally symmetric plane partitions. We use this perspective to prove an expansion of the tournament generating function as a sum over TSSCPPs which is analogous to a known formula involving ASMs. Les matrices à signe alternant (ASMs) sont des matrices carrées dont les coefficients sont 0,1 ou -1, telles que dans chaque ligne et chaque colonne la somme des entrées vaut 1 et les entrées non nulles ont des signes qui alternent. Nous incluons les ASMs dans un cadre plus vaste, en étudiant les idéaux des sous-posets d'un certain poset, dont nous prouvons qu'ils sont en bijection avec de nombreux objets combinatoires intéressants, tels que les ASMs, les partitions planes totalement symétriques autocomplémentaires (TSSCPPs), des objets comptés par les nombres de Catalan, les tournois, les tableaux semistandards, ou les partitions planes totalement symétriques. Nous utilisons ce point de vue pour démontrer un développement de la série génératrice des tournois en une somme portant sur les TSSCPPs, analogue à une formule déjà connue faisant appara\^ıtre les ASMs.

scholarly journals Cut-and-join structure and integrability for spin Hurwitz numbers

2020 ◽  
Vol 80 (2) ◽  
Author(s):  
A. Mironov ◽  
A. Morozov ◽  
S. Natanzon
Keyword(s):  
Matrix Models ◽  
Generating Function ◽  
Schur Functions ◽  
Integrable Hierarchy ◽  
Young Diagrams ◽  
Hurwitz Numbers ◽  
Expansion Coefficients ◽  
Common Eigenfunctions

Abstract Spin Hurwitz numbers are related to characters of the Sergeev group, which are the expansion coefficients of the Q Schur functions, depending on odd times and on a subset of all Young diagrams. These characters involve two dual subsets: the odd partitions (OP) and the strict partitions (SP). The Q Schur functions $$Q_R$$QR with $$R\in \hbox {SP}$$R∈SP are common eigenfunctions of cut-and-join operators $$W_\Delta $$WΔ with $$\Delta \in \hbox {OP}$$Δ∈OP. The eigenvalues of these operators are the generalized Sergeev characters, their algebra is isomorphic to the algebra of Q Schur functions. Similarly to the case of the ordinary Hurwitz numbers, the generating function of spin Hurwitz numbers is a $$\tau $$τ-function of an integrable hierarchy, that is, of the BKP type. At last, we discuss relations of the Sergeev characters with matrix models.

scholarly journals Plane partitions and the combinatorics of some families of reduced Kronecker coefficients.

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Laura Colmenarejo
Keyword(s):  
Generating Function ◽  
Plane Partitions ◽  
Rate Of Growth ◽  
International Audience ◽  
Kronecker Coefficients

International audience We compute the generating function of some families of reduced Kronecker coefficients. We give a combi- natorial interpretation for these coefficients in terms of plane partitions. This unexpected relation allows us to check that the saturation hypothesis holds for the reduced Kronecker coefficients of our families. We also compute the quasipolynomial that govern these families, specifying the degree and period. Moving to the setting of Kronecker co- efficients, these results imply some observations related to the rate of growth experienced by the families of Kronecker coefficients associated to the reduced Kronecker coefficients already studied.

scholarly journals Number of standard strong marked tableaux

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Susanna Fishel ◽  
Matjaž Konvalinka
Keyword(s):  
Schur Functions ◽  
Young Tableaux ◽  
Nous Proposons ◽  
Hook Length ◽  
International Audience ◽  
Standard Young Tableaux

International audience Many results involving Schur functions have analogues involving $k-$Schur functions. Standard strong marked tableaux play a role for $k-$Schur functions similar to the role standard Young tableaux play for Schur functions. We discuss results and conjectures toward an analogue of the hook length formula. De nombreux résultats impliquant les fonctions de Schur possèdent des analogues pour les fonctions de k-Schur. Les tableaux standard fortement marqués jouent un rôle pour les fonctions de k-Schur semblable á celui joué par les tableaux de Young pour les fonctions de Schur. Nous proposons ici des résultats et conjectures vers un analogue de la formule des équerres.

scholarly journals A triple product formula for plane partitions derived from biorthogonal polynomials

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Shuhei Kamioka
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Laguerre Polynomials ◽  
Product Formula ◽  
Triple Product ◽  
Lattice Paths ◽  
Plane Partitions ◽  
International Audience ◽  
Biorthogonal Polynomials ◽  
Bounded Size

International audience A new triple product formulae for plane partitions with bounded size of parts is derived from a combinato- rial interpretation of biorthogonal polynomials in terms of lattice paths. Biorthogonal polynomials which generalize the little q-Laguerre polynomials are introduced to derive a new triple product formula which recovers the classical generating function in a triple product by MacMahon and generalizes the trace-type generating functions in double products by Stanley and Gansner.

scholarly journals An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula

1998 ◽  
Vol Vol. 3 no. 1 ◽  
Author(s):  
Christian Krattenthaler
Keyword(s):  
Generating Function ◽  
Plane Partitions ◽  
Bijective Proof ◽  
International Audience ◽  
Reverse Plane

International audience A bijective proof for Stanley's hook-content formula for the generating function for column-strict reverse plane partitions of a given shape is given that does not involve the involution principle of Garsia and Milne. It is based on the Hillman-Grassl algorithm and Schützenberger's \emphjeu de taquin.

scholarly journals Refined dual stable Grothendieck polynomials and generalized Bender-Knuth involutions

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Pavel Galashin ◽  
Darij Grinberg ◽  
Gaku Liu
Keyword(s):  
Symmetric Functions ◽  
Schur Functions ◽  
The Other ◽  
Countable Family ◽  
Plane Partitions ◽  
International Audience ◽  
K Theory ◽  
Reverse Plane ◽  
Grothendieck Polynomials

International audience The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters such that the generalization still defines symmetric functions. We outline two self-contained proofs of this fact, one of which constructs a family of involutions on the set of reverse plane partitions generalizing the Bender-Knuth involutions on semistandard tableaux, whereas the other classifies the structure of reverse plane partitions with entries 1 and 2.

scholarly journals Hook formulas for skew shapes

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Alejandro H. Morales ◽  
Igor Pak ◽  
Greta Panova
Keyword(s):  
General Formula ◽  
Schur Functions ◽  
Product Formula ◽  
Young Tableaux ◽  
Hook Length ◽  
International Audience ◽  
Border Strip ◽  
Standard Young Tableaux ◽  
Skew Schur Functions ◽  
Reverse Plane

International audience The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We give two q-analogues of Naruse's formula for the skew Schur functions and for counting reverse plane partitions of skew shapes. We also apply our results to border strip shapes and their generalizations.

scholarly journals Congruence successions in compositions

2014 ◽  
Vol Vol. 16 no. 1 (Combinatorics) ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck ◽  
Mark Wilson
Keyword(s):  
General Formula ◽  
Generating Function ◽  
Asymptotic Estimate ◽  
International Audience ◽  
Limiting Case ◽  
Positive Integers

Combinatorics International audience A composition is a sequence of positive integers, called parts, having a fixed sum. By an m-congruence succession, we will mean a pair of adjacent parts x and y within a composition such that x=y(modm). Here, we consider the problem of counting the compositions of size n according to the number of m-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case m=2, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size n having no m-congruence successions.

scholarly journals A direct bijective proof of the hook-length formula

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii
Keyword(s):  
Young Tableaux ◽  
Hook Length ◽  
Bijective Proof ◽  
International Audience ◽  
Standard Young Tableaux

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.

Sign in / Sign up

Export Citation Format

Share Document