Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 e∈{2,3,4,… }∪{∞} and let λ⊢n be a partition with parts λ1≥λ2≥⋯ and conjugate λ′ (Partitions, English diagrams, and conjugation). Then λ is e-regular when every positive integer occurs as a part of λ fewer than e times, i.e. zj(λ)<e for every j≥1, and e-restricted when λi−λi+1<e for every i≥1 (with λi:=0 for i>ℓ(λ)).

For prime e=p these are exactly the p-regular and p-restricted notions of p-regular and p-restricted partitions; the same inequalities define the extension to composite finite e. For e=∞ both conditions are vacuous, so every partition is both e-regular and e-restricted: the inequalities zj(λ)<∞ and λi−λi+1<∞ hold because partitions have finitely many nonzero parts and each difference is a nonnegative integer. Moreover λ is e-restricted if and only if its conjugate λ′ is e-regular: the multiplicity of the part i in λ′ is the number of columns of [λ] of height exactly i, namely λi−λi+1, so the two conditions zi(λ′)=λi−λi+1<e are the same family of inequalities, and for e=∞ both sides hold. In particular ∅ is simultaneously e-regular and e-restricted for every e (p-regular and p-restricted partitions).

Depends on

Used by

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