Lean 4 formalization proves Singer's Sidon-set construction for every prime power and builds a library that yields unconditional two-sided bounds h(N)=Θ(√N) plus a conditional route to the full Erdős Problem 30 asymptotic.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Lean 4 formalization of Nagata's theorem on unique factorization domains via prime-generated submonoids, with applications to polynomial rings.
citing papers explorer
-
Formalizing Singer Sidon Constructions and Sidon Set Infrastructure in Lean 4
Lean 4 formalization proves Singer's Sidon-set construction for every prime power and builds a library that yields unconditional two-sided bounds h(N)=Θ(√N) plus a conditional route to the full Erdős Problem 30 asymptotic.
-
A Prime-Generated Formalization of Nagata's Factoriality Theorem in Lean 4
Lean 4 formalization of Nagata's theorem on unique factorization domains via prime-generated submonoids, with applications to polynomial rings.