AFTD Auto-Formalizing Theoretical Domains

nat_partition_bounded_row_step

def

One layer of the partition-counting dynamic programme: from the list of counts of partitions of 0,1,...,N by parts at most i-1, produce the list of counts of partitions by parts at most i, using the fibre sum over the number j of copies of the part i.

Statement

def nat_partition_bounded_row_step (i : ℕ) (prev : List ℕ) : List ℕ
Source
step towards strict_counterexample_family_canonical_star_bound
Verified
27 Oct 2026
Axioms
none listed
Used by 1
  • nat_partition_bounded_tableThe dynamic-programme table for bounded partition counts: the k-th row is the list of counts of partitions of 0,1,...,N with all parts at…

Lean source view module on GitHub

def nat_partition_bounded_row_step (i : ℕ) (prev : List ℕ) : List ℕ := (List.range prev.length).map (fun m => ∑ j ∈ Finset.range (m / i + 1), prev.getD (m - j * i) 0)
See it in the graphDiscuss this resultChallenge it