Tight universal sums of $m$-gonal numbers
Jangwon Ju, Mingyu Kim

TL;DR
This paper establishes the existence of minimal criteria for sums of generalized m-gonal numbers to be tight universal over all integers greater than or equal to n, introducing an algorithm for classification and providing experimental results.
Contribution
It proves the existence of minimal tight universality criteria for sums of generalized m-gonal numbers and introduces an algorithm for their classification.
Findings
Existence of minimal tight universality criterion sets for all (m,n) pairs.
An algorithm to identify all candidate sums for given (m,n).
Experimental classification results of tight universal sums.
Abstract
For a positive integer , the set of all integers greater than or equal to is denoted by . A sum of generalized -gonal numbers is called tight -universal if the set of all nonzero integers represented by is equal to . In this article, we prove the existence of a minimal tight -universality criterion set for a sum of generalized -gonal numbers for any pair . To achieve this, we introduce an algorithm giving all candidates for tight -universal sums of generalized -gonal numbers for any given pair . Furthermore, we provide some experimental results on the classification of tight -universal sums of generalized -gonal 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
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · semigroups and automata theory
