Zeros in Tables of Characters for the Groups Sn and An. II

Let P(n) be the set of all partitions of a natural number n. In the representation theory of symmetric groups, for every partition α ∈ P(n), the partition h(α) ∈ P(n) is defined so as to produce a certain set of zeros in the character table for S_n. Previously, the analog f(α) of h(α) was obtained pointing out an extra set of zeros in the table mentioned. Namely, h(α) is greatest (under the lexicographic ordering ≤) of the partitions β of n such that χ^α(g_β) ≠ 0, and f(α) is greatest of the partitions γ of n that are opposite in sign to h(α) and are such that χ^α(g_γ) ≠ 0, where χ^α is an irreducible character of S_n, indexed by α, and g_β is an element in the conjugacy class of S_n, indexed by β. For α ∈ P(n), under some natural restrictions, here, we construct new partitions h′(α) and f′(α) of n possessing the following properties. (A) Let α ∈ P(n) and n ⩾ 3. Then h′(α) is identical is sign to h(α), χ^α(g_h′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of h(α), and h′(α) < γ < h(α). (B) Let α ∈ P(n), α ≠ α′, and n ⩾ 4. Then f′(α) is identical in sign to f(α), χ^α(g_f′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of f(α), and f′(α) < γ < f(α). The results obtained are then applied to study pairs of semiproportional irreducible characters in A_n. Supported by RFBR grant No. 04-01-00463. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 643–663, November–December, 2005.