Related papers: Sprague-Grundy Value for Common Divisor Nim

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

We present the general method to introduce the generalized Chern-Simons form and the descent equation which contain the scalar field in addition to the gauge fields. It is based on the technique in a noncommutative differential geometry…

Let S = k[x_1,...,x_n] be a Z^r-graded ring with deg (x_i) = a_i \in Z^r for each i and suppose that M is a finitely generated Z^r-graded S-module. In this paper we describe how to find finite subsets of Z^r containing the multidegrees of…

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

For the most up-to-date version please visit http://www.cis.upenn.edu/~brautbar/ccgame.pdf

The celebrated Krusel-Smith growth model is an important example of a Mean Field Game with a common noise. The Mean Field Game is encoded in the master equation, a partial differential equation satisfied by the value of the game which…

The game of Nim, which has been well known for many years, has numerous variations. One such variation is Circular Nim, where piles of stones are arranged on a circumference, and players take stones from consecutive adjacent piles in one…

Let X be a projective curve defined over Q and t a non-constant Q-rational function on X of degree at least 2. For every integer n pick a point P_n on X such that t(P_n)=n. A result of Dvornicich and Zannier implies that, for large N, among…

The Critical Node Problem (CNP) is to identify a subset of nodes in a graph whose removal maximally degrades pairwise connectivity. The CNP is an important variant of the Critical Node Detection Problem (CNDP) with wide applications. Due to…

Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Let $D$ be a finite-dimensional division algebra over its center and $R=D[t;\sigma,\delta]$ a skew polynomial ring. Under certain assumptions on $\delta$ and $\sigma$, the ring of central quotients $D(t;\sigma,\delta) = \{f/g \,|\, f \in…

This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.

We provide uniform bounds on mean values of multiplicative functions under very general hypotheses, detecting certain power savings missed in known results in the literature. As an application, we study the distribution of the…

We consider three notions of divisibility in the Cuntz semigroup of a C*-algebra, and show how they reflect properties of the C*-algebra. We develop methods to construct (simple and non-simple) C*-algebras with specific divisibility…

The aim of this paper is to establish some properties of solutions to the Dirichlet-Neumann problem: $(\partial_z\partial_{\overline{z}})^2 w=g$ in the unit disc $\ID$, $w=\gamma_0$ and…

The classic game of Nim has been well-known for many years, inspiring numerous variations. One such variant is Delete Nim, where players take turns eliminating one pile of stones and splitting the remaining pile into two smaller piles. In…

Let A be a finite subset of $\nat$. Then NIM(A;n) is the following 2-player game: initially there are $n$ stones on the board and the players alternate removing $a\in A$ stones. The first player who cannot move loses. This game has been…

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

Differentiability of semigroups is useful for many applications. Here we focus on stochastic differential equations whose diffusion coefficient is the square root of a differentiable function but not differentiable itself. For every…