Abstract. Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commutativity of the Littlewood-Richardson co-efficients cλµ,ν = c λ ν,µ. They have considered four fundamental symmetry maps and conjectured that they are all equivalent (2004). The three first ones are based on standard operations in Young tableau theory and, in this case, the conjecture was proved by Danilov and Koshevoy (2005). The fourth fundamental symmetry, given by the author in (1999;2000) and reformulated by Pak and Vallejo, is defined by nonstandard operations in Young tableau theory and will be shown to be equivalent to the first one defined by the involution property of the Benkart-Sottile-Stroomer tableau switching. The proof...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Abstract. Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for t...
Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commuta...
Abstract: Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for t...
Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commut...
Abstract. The number of standard Young tableaux of a fixed shape is famously given by the hook-lengt...
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula ...
AbstractWe define and characterizeswitching, an operation that takes two tableaux sharing a common b...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
AbstractWe define and characterizeswitching, an operation that takes two tableaux sharing a common b...
AbstractThe conjugacy class of nilpotent n×n matrices can be parameterized by partitions λ of n, and...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
Abstract: We consider an action of the dihedral group Z2 × S3 on Littlewood-Richardson tableaux whic...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Abstract. Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for t...
Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commuta...
Abstract: Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for t...
Pak and Vallejo have defined fundamental symmetry map as any Young tableau bijection for the commut...
Abstract. The number of standard Young tableaux of a fixed shape is famously given by the hook-lengt...
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula ...
AbstractWe define and characterizeswitching, an operation that takes two tableaux sharing a common b...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
AbstractWe define and characterizeswitching, an operation that takes two tableaux sharing a common b...
AbstractThe conjugacy class of nilpotent n×n matrices can be parameterized by partitions λ of n, and...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
Abstract: We consider an action of the dihedral group Z2 × S3 on Littlewood-Richardson tableaux whic...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...