Edges and tableaux. (Arêtes et tableaux.)
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S) is edge-transitive if and only if the Cayley graph Cay(Sn, S) is edge-transitive....
Embedding arbitrary graphs into strongly regular and distance-regular graphs.
Entropy of Schur–Weyl measures
Relative dimensions of isotypic components of th order tensor representations of the symmetric group on letters give a Plancherel-type measure on the space of Young diagrams with cells and at most rows. It was conjectured by G. Olshanski that dimensions of isotypic components of tensor representations of finite symmetric groups, after appropriate normalization, converge to a constant with respect to this family of Plancherel-type measures in the limit when converges to a constant. The main...
Enumeration by stabilizer class of patterns with local restrictions.
Enumeration of concave integer partitions.
Enumerative applications of symmetric functions.
Enumerative consequences of the symmetry of Schur functions. (Conséquences énumératives de la symétrie des fonctions de Schur.)
Enumerative properties of generalized associahedra.
Erweiterte Fassung eines von Clebsch aufgestellten Uebertragungsprincips und deren Anwendung
Eulerian calculus. IV: Specializations.
Eulerian numbers, Foulkes characters and Lefschetz characters of the symmetric group.
Examples of Non-Uniqueness for the Combinatorial Radon Transform Modulo the Symmetric Group.
Excedance number for involutions in complex reflection groups.
Excedance numbers for permutations in complex reflection groups.
Explicit Cayley covers of Kautz digraphs.
Explicit plethystic formulas for Macdonald -Kostka coefficients.
Extension of strongly regular graphs.