Related papers: On the expansion of three-element subtraction sets
In this paper we give an algorithm to calculate the coefficients of the p-adic expansion of a rational numbers, and we give a method to decide whether this expansion is periodic or ultimately periodic.
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…
We study a variant of 3-pile Nim in which a move consists of taking tokens from one pile and, instead of removing then, topping up on a smaller pile provided that the destination pile does not have more tokens then the source pile after the…
In this work, we discuss a number game that develops in a manner similar to that on which Gilbreath's conjecture on iterated absolute differences between consecutive primes is formulated. In our case the action occurs at the exponent level…
We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…
We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The first player who builds a generating set from the…
In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an…
In connection with the needs of solving optimization problems, the development of conditional minimization methods with convenient numerical implementation continues to attract the attention of mathematicians. In this monograph we propose…
We study 2-player impartial games, so called \emph{invariant subtraction games}, of the type, given a set of allowed moves the players take turn in moving one single piece on a large Chess board towards the position $\boldsymbol 0$. Here,…
This paper is devoted to the study of periodic solutions for a radially symmetric semilinear wave equation in an $n$-dimensional ball. By combining the variational methods and saddle point reduction technique, we prove there exist at least…
The Games-Chan algorithm finds the minimal period of a periodic binary sequence of period $2^n$, in $n$ iterations. We generalise this to periodic $q$-ary sequences (where $q$ is a prime power) using generating functions and polynomials and…
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. We construct a tournament of order 36 for which the Banks set and the bipartisan set are disjoint. This implies that…
This paper continues the study initiated in "The aithmetic of Triangles." We begin by examining a set of similar tetrahedra with parallel sides, together with a set of points in three-dimensional space. It turns out that the set…
Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
We calculate the Legendre expansion of the rate of the process $\nu + \bar{\nu} \leftrightarrow e^+ + e^-$ up to 3rd order extending previous results of other authors which only consider the 0th and 1st order terms. Using different closure…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…
We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…
In this paper we describe several player preferences in games with $N \geq 2$ players, in particular the case $N = 3$, and use them to simplify game trees, using the game of Clobber as our example. We show that, using a fixed starting…