# One-Dimensional Packing: Maximality Implies Rationality

## TL;DR

This paper introduces a germ-based partial ordering for sets of natural numbers, showing that maximal D-avoiding sets are ultimately periodic and conjecturing uniqueness and dominance of their germs.

## Contribution

It establishes that maximal D-avoiding sets in germ-ordering are ultimately periodic, extending to packings, and proposes conjectures on their uniqueness and germ size.

## Key findings

- Maximal D-avoiding sets are ultimately periodic.
- Germ-ordering generalizes set size comparisons.
- Conjecture on unique maximal D-avoiding sets with larger germs.

## Abstract

Every set of natural numbers determines a generating function convergent for $q \in (-1,1)$ whose behavior as $q \rightarrow 1^-$ determines a germ. These germs admit a natural partial ordering that can be used to compare sizes of sets of natural numbers in a manner that generalizes both cardinality of finite sets and density of infinite sets. For any finite set $D$ of positive integers, call a set $S$ "$D$-avoiding" if no two elements of $S$ differ by an element of $D$. It is shown that any $D$-avoiding set that is maximal in the class of $D$-avoiding sets (with respect to germ-ordering) is ultimately periodic. This implies an analogous result for packings. It is conjectured that for all $D$ there is a unique maximal $D$-avoiding set, and that its germ is appreciably larger than the germs of all other $D$-avoiding sets.