Related papers: Sprague-Grundy Value for Common Divisor Nim
The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…
We prove Milnor-Wood inequalities for local products of manifolds. As a consequence, we establish the generalized Chern Conjecture for products $M\times \Sigma^k$ for any product of a manifold $M$ with a product of $k$ copies of a surface…
We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…
It is well known that for every $f\in C^m$ there exists a polynomial $p_n$ such that $p^{(k)}_n\rightarrow f^{(k)}$, $k=0,\ldots,m$. Here we prove such a result for fractional (non-integer) derivatives. Moreover, a numerical method is…
Let $ \mathfrak{C}^+_{ns}(p) $ be the Cuspidal Divisor Class Group of the modular curves $X^+_{ns}(p) $ associated to the normalizer of a non-split Cartan subgroup of level $ p$. I study the $ p-$primary part of $ \mathfrak{C}^+_{ns}(p) $…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
In this paper, we consider a modular extension to the game of Nim, which we call $m$-Modular Nim, and explore its optimal strategy. In $m$-Modular Nim, a player can either make a standard Nim move or remove a multiple of $m$ tokens in…
As established by R T. Rockafellar, real valued convex-concave functions are generically differentiable. It this paper we shall show that for a convex-concave function defined on an open convex set $C \times D,$ there exist dense subsets…
Visualizing the features captured by Convolutional Neural Networks (CNNs) is one of the conventional approaches to interpret the predictions made by these models in numerous image recognition applications. Grad-CAM is a popular solution…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
In this paper, we study generalized line bundles over $C_n$, a primitive multiple curve of arbitrary multiplicity $n$, where $n$ is a positive integer. In particular, we give a structure theorem for them and we characterize their…
Given two finite sets of integers $S\subseteq\NNN\setminus\{0\}$ and $D\subseteq\NNN\setminus\{0,1\}$,the impartial combinatorial game $\IMARK(S,D)$ is played on a heap of tokens. From a heap of $n$ tokens, each player can moveeither to a…
To make the best use of the underlying minute and subtle differences, fine-grained classifiers collect information about inter-class variations. The task is very challenging due to the small differences between the colors, viewpoint, and…
We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…
In this paper we will be examining impartial scoring play games. We first give the basic definitions for what impartial scoring play games are and look at their general structure under the disjunctive sum. We will then examine the game of…
Our main result shows that for every odd natural number n > 1 there is a partition of the rational numbers, x/2n in lowest terms, in the unit interval, the product of whose Gamma values takes the form of powers of 2 and pi.
The conditional gradient method (CGM) is widely used in large-scale sparse convex optimization, having a low per iteration computational cost for structured sparse regularizers and a greedy approach to collecting nonzeros. We explore the…
We define a general notion of centrally $\Gamma$-graded sets and groups and of their graded products, and prove some basic results about the corresponding categories: most importantly, they form braided monoidal categories. Here, $\Gamma$…
We consider distributed computation of generalized Nash equilibrium (GNE) over networks, in games with shared coupling constraints. Existing methods require that each player has full access to opponents' decisions. In this paper, we assume…
We use a molecular characterization of generalized Hardy-Morrey spaces, to provide a norm controls of Calder\'on-Zygmund operators and their associated commutators in the above mention spaces.