Related papers: A game with divisors and absolute differences of e…
We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…
The Deviants' Dilemma is a two-person game with the individual gain conflicting with the choice for global good. Evolutionary considerations yield fixed point attractors, with the phenomena of exclusion potentially playing an important role…
"Goldbach's Conjecture" proven by analysis of how all combinations of the odd primes, summed in pairs, generates all of the even numbers.
The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
We introduce parallelism into the basic algebra of games to model concurrent game algebraically. Parallelism is treated as a new kind of game operation. The resulted algebra of concurrent games can be used widely to reason the parallel…
Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two…
Two players alternate moves in the following impartial combinatorial game: Given a finitely generated abelian group $A$, a move consists of picking some nonzero element $a \in A$. The game then continues with the quotient group $A/ \langle…
Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…
A game-theoretic model of social preference and enlightened self-interest is formulated. Existence of symmetry and duality in the game matrices with altruistic social preference is revealed. The model is able to quantitatively describe the…
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…
Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous…
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separability, depending on whether the set of priorities of the…
We introduce a quantum version of the Game of Life and we use it to study the emergence of complexity in a quantum world. We show that the quantum evolution displays signatures of complex behaviour similar to the classical one, however a…
In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…
In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…
The remoteness from a simple game to a weighted game can be measured by the concept of the dimension or the more general Boolean dimension. It is known that both notions can be exponential in the number of voters. For complete simple games…