How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
e-regular and e-restricted partitions
Definition
Let and let be a partition with parts and conjugate (Partitions, English diagrams, and conjugation). Then is -regular when every positive integer occurs as a part of fewer than times, i.e. for every , and -restricted when for every (with for ).
For prime these are exactly the -regular and -restricted notions of p-regular and p-restricted partitions; the same inequalities define the extension to composite finite . For both conditions are vacuous, so every partition is both -regular and -restricted: the inequalities and hold because partitions have finitely many nonzero parts and each difference is a nonnegative integer. Moreover is -restricted if and only if its conjugate is -regular: the multiplicity of the part in is the number of columns of of height exactly , namely , so the two conditions are the same family of inequalities, and for both sides hold. In particular is simultaneously -regular and -restricted for every (p-regular and p-restricted partitions).
Depends on
Used by
- Cellularity does not make every cell module simple Counterexample
- The e-core, the e-quotient, and the e-weight Definition
- The type-A Hecke Specht module and its cell form Definition
- Graded Specht heads classify the graded simple modules Theorem
- The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules Theorem
- The simple type-A Hecke modules are indexed by e-regular partitions Theorem
- The weight-one block decomposition pattern Theorem
Dependency tree · two levels
3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Andrew Mathas, Hecke algebras and Schur algebras of the symmetric group, complete prepublication manuscript (1998; expanded published edition: AMS University Lecture Series 15, 1999); complete 79-page manuscript, SHA-256 8cfeb611a95a3ff25cb95ad22bfd3a68475818301c34b04d131a8480a1b997e0 (standard reference, not scraped)
- Alexander Kleshchev, Representation theory of symmetric groups and related Hecke algebras, arXiv:0909.4844; Bull. Amer. Math. Soc. 47 (2010) 419-481; complete 66-page arXiv survey, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab (standard reference, not scraped)