We prove a q-analog, which is valid if q is a positive real number, of the following: the probability that, when n tends to infinity, a randomly chosen standard Young tableau of size n contains a fixed standard Young tableau of shape λ ⊢ k is equal to f λ k! (Journal of Combinatorial Theory Series A, volume 97, 117–128, 2002). We also consider pairs of tableaux.

Résumé. Ces dernières années, la classification croisée ou classification par blocs, c’est-à-dire la recherche simultanée d’une partition des lignes et d’une partition des colonnes d’un tableau de données, est devenue un outil très utilisé en fouille de données. Dans ce domaine, l’information se présente souvent sous forme de tableaux de contingence ou tableaux de co-occurrence croisant les mod...

There are several results concerning double cosets of Young subgroups of symmetric groups which are often proved as corollaries of more general results about Coxeter groups. In this note we give a selection of these results and give them the short combinatorial proofs they deserve. Our replacement for the machinery of Coxeter groups consists of some simple combinatorial arguments involving tabl...

Phonological ganging is a type of cumulativity in constraint interaction where one strong constraint C1 can be overtaken by two weaker constraints C2 and C3 together but not by C2 or C3 independently (e.g., Jäger and Rosenbach 2006). In strict-ranking Optimality Theory (OT), phonological ganging is achieved via (local) constraint conjunction (e.g., Smolensky 1993, 2006; Baković 2000; Ito and Me...

We consider a labelled tableau presentation of constant domain rst-order S5 and prove a strong cut-elimination theorem.