Journal of Number TheoryB. Bolloba´s and I. Leader, The number of k-sums modulo k, J. Number Theory 78 (1999), 27-35.B. Bollob´as and I. Leader, The number of k-sums modulo k, J. Number Theory 78 (1999), 27 - 35....
Let a1, …, ar be a sequence of elements of Zk, the integers modulo k. Calling the sum of k terms of the sequence a k-sum, how small can the set of k-sums be? Our aim in this paper is to show that if 0 is not a k-sum then there are at least rk+1 k-sums. This resul...
Open Problem 1 What is the integral sum number of Kn,n-E(nK2)? The concept of mod sum graph was introduced by Boland et al. [1] in 1990. A mod sum graph is a sum graph with S⊂Zm⧹{0} and all arithmetic performed modulo m where m⩾|S|+1. Trees on n⩾3 vertices, ...
this covers all types of smooth spherical fano threefolds. the case n features a number of structural novelties; most notably, one may lose regularity
2Asymptotics of Nahm sums LetNbe a natural number. Suppose thatQ = (A, b, c, d)is a quadruple whereA \in \mathbb {Q}^{N \times N}is a matrix,b \in \mathbb {Q}^Nis a vector,c \in \mathbb {Q}is a scalar, andd \in \mathbb {Z}_{>0}^Nis a vector, such thatADis sy...
Central Limit Theorems in Analytic Number Theory 48:39 Kantorovich operators and their ergodic properties 01:02:06 L-Functions of Elliptic Curves Modulo Integers 49:33 The Bootstrap Learning Algorithm 20:49 A logarithmic improvement in the Bombieri-Vinogradov theorem 01:00:48 A Reintroduction...
K Eisentraeger,K Lauter - 《Mathematics》 被引量: 113发表: 2004年 Elementary Number Theory the exponent 4, as well as the basic theory of Gaussian integers culminating with the fact that primes that are congruent to 1 modulo 4 are sums of ... A Masters - McGraw-Hill 被引量: 117发表:...
43 Adversarial training through the lens of optimal transport 1:16:40 Central Limit Theorems in Analytic Number Theory 48:39 Kantorovich operators and their ergodic properties 1:02:06 L-Functions of Elliptic Curves Modulo Integers 49:33 The Bootstrap Learning Algorithm 20:49 A logarithmic ...
the algebra of modulo-2 sums disk failure recovery x=y x_+_y=0 The bit in any position is the modulo-2 sum of all the bits in the corresponding positions of all other disks.
Our approach relies on the study of the geometric properties of the varieties defined by the systems involved. We apply these results to a generalization of Waring's problem and the distribution of solutions of congruences modulo a prime number....