This chapter presents purely combinatorial results that are needed for the proof of Statement G. The motivation for these results comes from the appearance of divisibility conditions through the factor δn(Σ; α) defined in (15.2) that appears in Theorems 15.3 and 15.4. According to Statement F, the sum of Λsubscript Greek capital letter gamma(α, σ) over an f-packet is equal to the corresponding sum of ΛΔ(α′, σ). In order to prove Statement F, the chapter proceeds by identifying terms in the resulting double sum that can be matched. It considers subsignatures of η and concurrence as an equivalence relation.
Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.