The Ballantine-Beck-Feigon-Maurischat Conjectures on Subsum Polynomials
partialconfidence 70%
VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
Ballantine, Beck, Feigon and Maurischat introduced the subsum polynomial $\mathrm{sp}(\lambda,x) := \prod_i (1+x^{\lambda_i})$ attached to an integer partition $\lambda$, studied rational functions built by summing reciprocals of these polynomials over natural classes of partitions, and posed ten conjectures. Six are now proved: the ordinary and binary coprimality and divisibility conjectures, and the odd and ternary special-value and recurrence conjectures.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement
fidelity, correctness, priority, or novelty.
What AI did
AxiomProver
AxiomProver autonomously produced Lean and mathlib formalizations and machine-checkable proofs of all six conjectures. It also discovered a counterexample to one of the conjectures as printed, so the same system both proved and refuted statements drawn from one list, which is a useful demonstration that it was reading the statements rather than pattern-matching toward the expected answer.
The six proofs are Lean and mathlib formalizations, so they are machine-checkable rather than dependent on refereeing. Note that the catalog has not compiled the artifact itself, so this records the authors' claim of formalization, not an independent build.