none3no6th International Workshop, IWMM 2004 and International Workshop, GIAE 2004; Shanghai; China; 19 May 2004 through 28 May 2004We state three combinatorial lemmas on Young tableaux, and show their role in the proof of the triangularity theorem about the action of Young-Capelli symmetrizers on symmetrized bitableaux. As an application, we describe in detail the way to specialize general results to the representation theory of the symmetric group and to classical invariant theory.noneA. Brini; F. Regonati; A. TeolisA. Brini; F. Regonati; A. Teoli
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
The description of characters of the infinite symmetric group S1 = lim \Gamma! Sn is considered i...
In this thesis, Young tableaux are used to provide a very convenient explicit descrip- tion of all t...
none3no6th International Workshop, IWMM 2004 and International Workshop, GIAE 2004; Shanghai; China;...
none3no6th International Workshop, IWMM 2004 and International Workshop, GIAE 2004; Shanghai; China;...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We use Young tableaux and Young symmetrizers to classify the irreducible represen-tations over C of ...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
The description of characters of the infinite symmetric group S1 = lim \Gamma! Sn is considered i...
In this thesis, Young tableaux are used to provide a very convenient explicit descrip- tion of all t...
none3no6th International Workshop, IWMM 2004 and International Workshop, GIAE 2004; Shanghai; China;...
none3no6th International Workshop, IWMM 2004 and International Workshop, GIAE 2004; Shanghai; China;...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We provide an elementary introduction to the (characteristic zero) theory of Letterplace Superalgebr...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We construct the analog of the plactic monoid for the super semistandard Young tableaux over a signe...
We use Young tableaux and Young symmetrizers to classify the irreducible represen-tations over C of ...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
The description of characters of the infinite symmetric group S1 = lim \Gamma! Sn is considered i...
In this thesis, Young tableaux are used to provide a very convenient explicit descrip- tion of all t...