1998Communications of the Korean Mathematical SocietyRequires access

COMBINATORIAL PROOF FOR THE GENERALIZED SCHUR IDENTITY

Jaejin Lee

Open publisher page 0 citations

Abstract

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set (X) of pairs (equation omitted) satisfying a certain condition and the set (X) of circled permutation tableaux of shape λ on the set X, where P is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: 2(type()) = 2n! summed over all permutation with type() O . .

About this research paper

What this paper is about

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set (X) of pairs (equation omitted) satisfying a certain condition and the set (X) of circled permutation tableaux of shape λ on the set X, where P is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: 2(type()) = 2n! summed over all permutation with type() O . .

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set (X) of pairs (equation omitted) satisfying a certain condition and the set (X) of circled permutation tableaux of shape λ on the set X, where P is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: 2(type()) = 2n! summed over all permutation with type() O . .

Key concepts: Bijection, Mathematics, Permutation (music), Combinatorics, Partition (number theory), Combinatorial proof, Young tableau, Identity (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
COMBINATORIAL PROOF FOR THE GENERALIZED SCHUR IDENTITY — Research Paper | ScholarLens