Related papers: Multiplicative Modular Nim (MuM)

We present a new framework for creating a quantum version of a classical game, based on Fine's theorem. This theorem shows that for a given set of marginals, a system of Bell's inequalities constitutes both necessary and sufficient…

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

Suppose some objects are hidden in a finite set $S$ of hiding places which must be examined one-by-one. The cost of searching subsets of $S$ is given by a submodular function and the probability that all objects are contained in a subset is…

In this paper we present a method for constructing multiple-sum $q$-series for what is known as Mixed Mock Modular forms. We also present some multi-sum analogues of the Durfee identity, and discuss a construction of its combinatorial…

In this note we prove the uniqueness of solutions to a class of Mean Field Games systems subject to possibly degenerate individual noise. Our results hold true for arbitrary long time horizons and for general non-separable Hamiltonians that…

Here, we present a variant of Nim with two piles. In the first pile, we have stones with a weight of 1, and in the second pile, we have stones with a weight of -2. Two Players take turns to take stones from one of the piles, and the total…

In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in mis\`ere version. For this reason, several restricted universes were earlier considered for their study, in which more…

The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every…

Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…

In this paper, we associate a new topology to a nonzero unital module $M$ over a commutative $R$, which is called Golomb topology of the $R$-module $M$. Let $M\ $be an\ $R$-module and $B_{M}$ be the family of coprime cosets $\{m+N\}$ where…

A combinatorial game is a two-player game without hidden information or chance elements. The disjunctive sum $G + H$ of games $G$ and $H$ is the game in which $G$ and $H$ are played in parallel, and a player makes a move on exactly one of…

In a $3$-$\mathsf{XOR}$ game $\mathcal{G}$, the verifier samples a challenge $(x,y,z)\sim \mu$ where $\mu$ is a probability distribution over $\Sigma\times\Gamma\times\Phi$, and a map $t\colon \Sigma\times\Gamma\times\Phi\to\mathcal{A}$ for…

While transformer models have been highly successful, they are computationally inefficient. We observe that for each layer, the full width of the layer may be needed only for a small subset of tokens inside a batch and that the "effective"…

In this paper, a novel approach for the optimal combination of binary classifiers is proposed. The classifier combination problem is approached from a Game Theory perspective. The proposed framework of adapted weighted majority rules (WMR)…

Let $A$ be a finite dimensional hereditary algebra over an algebraically closed field $k$, $A^{(m)}$ be the $m$-replicated algebra of $A$ and $\mathscr{C}_{m}(A)$ be the $m$-cluster category of $ A$. We investigate properties of complements…

The hidden Markov model (HMM) is a widely-used generative model that copes with sequential data, assuming that each observation is conditioned on the state of a hidden Markov chain. In this paper, we derive a novel algorithm to cluster HMMs…