On a mysterious partition identity

@inproceedings{Mller2003OnAM,
  title={On a mysterious partition identity},
  author={J{\"u}rgen M{\"u}ller},
  year={2003}
}
(1.1) Notation. Let Pn denote the set of all partitions of n ∈ N0. For λ ∈ Pn let l(λ) ∈ N0 be its length, i. e. the number of its non-zero parts λ1 ≥ λ2 ≥ . . . ≥ λl(λ) > 0. Furthermore, let s(λ) := n− l(λ) ∈ N0 be its generalized sign, thus we have sgn(λ) = (−1). We also write λ = [11, . . . , nn], where ai(λ) ∈ N0. Let Sn denote the symmetric group on n ∈ N0 letters. For λ ∈ Pn let Cλ ⊆ Sn denote the conjugacy class of elements of cycle type λ. For n ∈ N0 let g[n] := (1, . . . , n) ∈ Sn, and… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Combinatorial identities — a standardized set of tables listing 500 binomial coefficient summations

  • H. Gould
  • 1972
Highly Influential
4 Excerpts

Character theory of finite groups

  • I. Isaacs
  • Dover Publications,
  • 1994

The representation theory of the symmetric group, Encyclopedia of Mathematics 16, Adddison-Wesley

  • G. James, A. Kerber
  • 1981