
TL;DR
This paper investigates properties of h-bases in the Postage Stamp Problem, introduces the concept of admissible sets, and presents a counterexample to a conjecture about the pattern of missing values.
Contribution
It provides a counterexample to Selmer's conjecture on the non-increasing pattern of missing values differences in h-bases.
Findings
Counterexample found for Selmer's conjecture
Analysis of the pattern of missing values in h-bases
Insights into the structure of extremal h-bases
Abstract
A_k = {1, a_2, ..., a_k} is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i; we write n = n_h(A_k). An extremal h-basis A_k is one for which n is as large as possible, and then we write n = n_h(k). The "local" Postage Stamp Problem is concerned with properties of particular sets A_k, and it is clear that sets where n_h(A_k) does not exceed a_k are of little interest. We define h_0(k) to be the smallest value of h for which n_h(A_k) exceeds a_k; such sets are called "admissible". We say that a value n can be "generated" by A_k if it can be expressed as the sum of no more than h values a_i, or - equivalently - if it can be expressed as the sum of exactly h values a_i from the set A'_k = {0, a_1, a_2, ... a_k}. No values greater than ha_k can be generated, and we now consider the number of values less than ha_k that…
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 · Limits and Structures in Graph Theory · Mathematics and Applications
