2000 character limit reached
Minimal asymptotic \(g\)-adic bases from arbitrary partitions
Published 16 Oct 2026 in math.NT and math.CO | (2610.23152v1)
Abstract: Let $g>h\ge2$ be integers. For a nonempty set , let denote the set of its finite nonempty subsets. Let $$A_g(W)=\left{\sum_{f\in F}a_fg<sup>f:</sup> 1\leq a_f \leq g-1,F \in \mathcal F<sup>*(W)\right},$$ and let be a partition into infinite sets. We prove that is a minimal asymptotic basis of order for every such partition.
Paper Prompts
Sign up for free to create and run prompts on this paper.