
TL;DR
This paper investigates the characterization of vectors that generate all integers above a certain threshold using sums of generalized m-gonal numbers, with a complete solution for the case of triangular numbers.
Contribution
It provides a complete classification of vectors generating all integers above a threshold using sums of triangular numbers, extending to generalized m-gonal numbers.
Findings
Characterization of vectors generating all integers ≥ n with m-gonal numbers.
Complete resolution for the case of triangular numbers.
Extension of results to generalized m-gonal numbers.
Abstract
For a subset of nonnegative integers and a vector of positive integers, let . For a positive integer , let be the set of integers greater than or equal to . In this paper, we consider the problem of finding all vectors satisfying , when is the set of (generalized) -gonal numbers and is a positive integer. In particular, we completely resolve the case when is the set of triangular numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Dynamics and Fractals · Limits and Structures in Graph Theory
