Related papers: Sprague-Grundy Value for Common Divisor Nim

We evaluate the character sum sigma_m sigma_n (m/n) where the two sums are of approximately the same length. The answer is surprising.

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

Given an integer partition of $n$, we consider the impartial combinatorial game LCTR in which moves consist of removing either the left column or top row of its Young diagram. We show that for both normal and mis\`ere play, the optimal…

In this paper, we study a combination (called the generalized cyclic Nimhoff) of the cyclic Nimhoff and subtraction games. We give the $\mathcal{G}$-value of the game when all the $\mathcal{G}$-value sequence of subtraction games have a…

The ordinary game of Nim has a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and lends itself to numerous other solutions to combinatorial…

The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a player may remove from a heap in terms of the size of the…

We describe a nef divisor $D_P$ on $\bar{M}_{0,12}$ that is not numerically equivalent to an effective sum of boundary divisors.

In a series of recent works, we have provided a number of explicit expressions for the derivative of the associated Legendre function of the first kind with respect to its degree, $[\partial P_{\nu}^{m}(z)/\partial\nu]_{\nu=n}$, with…

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

We construct an algorithm for computing the cycle classes of the spin components of a stratum of differentials in the moduli space of stable curves $\overline{\mathcal{M}}_{g,n}$. In addition, we implement it within the Sage package…

The FRACTRAN programs $\sqrt{2}$GAME and NR$\sqrt{2}$GAME are presented, both of which compute the decimal expansion of $\sqrt{2}$. Our $\sqrt{2}$GAME is analogous to Conway's PIGAME program. In fact, our proof carries over to PIGAME to…

Let m_1,...,m_s be positive integers. Consider the sequence defined by multinomial coefficients: a_n=\binom{(m_1+m_2+... +m_s)n}{m_1 n, m_2 n,..., m_s n}. Fix a positive integer k\ge 2. We show that there exists a positive integer C(k) such…

Given n general points p_1, p_2,..., p_n in P^r, it is natural to ask when there exists a curve C \subset P^r, of degree d and genus g, passing through p_1, p_2,..., p_n. In this paper, we give a complete answer to this question for curves…

The moduli space $\M_{g,n}$ of $n-$pointed stable curves of genus $g$ is stratified by the topological type of the curves being parametrized: the closure of the locus of curves with $k$ nodes has codimension $k$. The one dimensional…

In this paper, we will continue to estmate g_1(n|m) for general n and m.

The exact common information between a set of random variables $X_1,...,X_n$ is defined as the minimum entropy of a shared random variable that allows for the exact distributive simulation of $X_1,...,X_n$. It has been established that, in…

We prove three conjectures of Fraenkel and Ho regarding two classes of variants of Wythoff's game. The two classes of variants of Wythoff's game feature restrictions of the diagonal moves. Each conjecture states that the Sprague-Grundy…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

We show that it is NP-hard to distinguish graphs of linear mim-width at most 1211 from graphs of sim-width at least 1216. This implies that Mim-Width, Sim-Width, One-Sided Mim-Width, and their linear counterparts are all paraNP-complete,…

In this paper, we give a general formula to determine the quantization coefficients for uniform distributions defined on the boundaries of different regular $m$-sided polygons inscribed in a circle. The result shows that the quantization…