You currently have no access to view or download this content. Please log in with your institutional or personal account if you should have access to this content through either of these.
Showing a limited preview of this publication:
Article Numbers with Integer Complexity Close to the Lower Bound
Integers is a refereed journal devoted to research in combinatorial number theory and additive combinatorics. There are other journals that touch on these fields; we are the only one that is dedicated entirely to these topics.
We welcome original research articles in combinatorics and number theory, with a preference for those that have a connection to both fields. Topics covered by the journal include additive number theory, multiplicative number theory, sequences and sets, extremal combinatorics, Ramsey theory, elementary number theory, classical combinatorial problems, hypergraphs, and probabilistic number theory. Integers also houses a combinatorial games section.