An official website of the United States government
This content will become publicly available on July 1, 2026
Problems on infinite sumset configurations in the integers and beyond
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found, we explore numerous open problems and obstructions to finding other infinite configurations in every set of natural numbers with positive density.
more »
« less
- PAR ID:
- 10595911
- Publisher / Repository:
- American Mathematical Society
- Date Published:
- Journal Name:
- Bulletin of the American Mathematical Society
- ISSN:
- 0273-0979
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
In this paper we show that every set A⊂ℕ with positive density contains B+C for some pair B,C of infinite subsets of ℕ, settling a conjecture of Erd\H os. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups.more » « less
-
Abstract By around the age of 5½, many children in the United States judge that numbers never end, and that it is always possible to add 1 to a set. These same children also generally perform well when asked to label the quantity of a set after one object is added (e.g., judging that a set labeled “five” should now be “six”). These findings suggest that children have implicit knowledge of the “successor function”: Every natural number,n, has a successor,n + 1. Here, we explored how children discover this recursive function, and whether it might be related to discovering productive morphological rules that govern language‐specific counting routines (e.g., the rules in English that represent base‐10 structure). We tested 4‐ and 5‐year‐old children’s knowledge of counting with three tasks, which we then related to (a) children’s belief that 1 can always be added to any number (the successor function) and (b) their belief that numbers never end (infinity). Children who exhibited knowledge of a productive counting rule were significantly more likely to believe that numbers are infinite (i.e., there is no largest number), though such counting knowledge was not directly linked to knowledge of the successor function, per se. Also, our findings suggest that children as young as 4 years of age are able to implement rules defined over their verbal count list to generate number words beyond their spontaneous counting range, an insight which may support reasoning over their acquired verbal count sequence to infer that numbers never end.more » « less
-
Abstract A Cantor series expansion for a real number x with respect to a basic sequence $$Q=(q_1,q_2,\dots )$$ , where $$q_i \geq 2$$ , is a generalization of the base b expansion to an infinite sequence of bases. Ki and Linton in 1994 showed that for ordinary base b expansions the set of normal numbers is a $$\boldsymbol {\Pi }^0_3$$ -complete set, establishing the exact complexity of this set. In the case of Cantor series there are three natural notions of normality: normality, ratio normality, and distribution normality. These notions are equivalent for base b expansions, but not for more general Cantor series expansions. We show that for any basic sequence the set of distribution normal numbers is $$\boldsymbol {\Pi }^0_3$$ -complete, and if Q is $$1$$ -divergent then the sets of normal and ratio normal numbers are $$\boldsymbol {\Pi }^0_3$$ -complete. We further show that all five non-trivial differences of these sets are $$D_2(\boldsymbol {\Pi }^0_3)$$ -complete if $$\lim _i q_i=\infty $$ and Q is $$1$$ -divergent. This shows that except for the trivial containment that every normal number is ratio normal, these three notions are as independent as possible.more » « less
-
We extend Kreps and Wilson's concept of sequential equilibrium to games with infinite sets of signals and actions. A strategy profile is a conditional ε ‐equilibrium if, for any of a player's positive probability signal events, his conditional expected utility is within ε of the best that he can achieve by deviating. With topologies on action sets, a conditional ε ‐equilibrium is full if strategies give every open set of actions positive probability. Such full conditional ε ‐equilibria need not be subgame perfect, so we consider a non‐topological approach. Perfect conditional ε ‐equilibria are defined by testing conditional ε ‐rationality along nets of small perturbations of the players' strategies and of nature's probability function that, for any action and for almost any state, make this action and state eventually (in the net) always have positive probability. Every perfect conditional ε ‐equilibrium is a subgame perfect ε ‐equilibrium, and, in finite games, limits of perfect conditional ε ‐equilibria as ε → 0 are sequential equilibrium strategy profiles. But limit strategies need not exist in infinite games so we consider instead the limit distributions over outcomes. We call such outcome distributions perfect conditional equilibrium distributions and establish their existence for a large class of regular projective games. Nature's perturbations can produce equilibria that seem unintuitive and so we augment the game with a net of permissible perturbations.more » « less
