Related papers: Uncountable sets and an infinite real number game
We investigate the set I(f) of points that converge to infinity under iteration of the map f(z) = e^z-1 and show that it is the disjoint union of countably many rays and uncountable union of infinite sets whose points escape to infinity…
We identify a choiceless variation of the box game paradox, in which players predict unknown real numbers with near-perfect accuracy despite lacking any useful information. We also verify that choice is necessary in the solution of the…
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after…
We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of…
In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…
In this short note we prove the result stated in the title; that is, for every $p>0$ there exists an infinite dimensional closed linear subspace of $L_{p}[0,1]$ every nonzero element of which does not belong to $\bigcup\limits_{q>p}…
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
Two selection games from the literature, $G_c(\mathcal O,\mathcal O)$ and $G_1(\mathcal O_{zd},\mathcal O)$, are known to characterize countable dimension among certain spaces. This paper studies their perfect- and limited-information…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…
We show that there exist real quadratic maps of the interval whose attractors are computationally intractable. This is the first known class of such natural examples.
We prove that chess played on the infinite chessboard $\mathbb{Z}^2$ with infinitely many pieces is as powerful as it could possibly be, by showing that every open Gale-Stewart game with draws is strategically equivalent to some infinite…
The mean field games system is a coupled pair of nonlinear partial differential equations arising in differential game theory, as a limit as the number of agents tends to infinity. We prove existence and uniqueness of classical solutions…
A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations.
For an interval [1,N] in the natural numbers, investigating subsets S of [1,N] such that |{(x,y) in S^2:x+y in S}|=0, known as sum-free sets, has attracted considerable attention. In this paper, we define r(S):=|{(x,y) in S^2: x+y in S}|…
n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore…