Sums of digits, overlaps, and palindromes.
Allouche, Jean-Paul, Shallit, Jeffrey (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “The structure of maximal zero-sum free sequences”
Sums of digits, overlaps, and palindromes.
Sums of Cubes of Square-Free Numbers.
R.C. Baker, J. Brüdern (1991)
Monatshefte für Mathematik
Similarity:
Two conjectures on an addition theorem
Xiangneng Zeng, Pingzhi Yuan (2011)
Acta Arithmetica
Similarity:
Sums of Cubes of Square-Free Numbers II.
R.C. Baker, J. Brüdern (1991)
Monatshefte für Mathematik
Similarity:
On Some Sets Of Integers With Equal Sums Of Like Powers
Alfred Moessner, George Xeroudakes (1954)
Publications de l'Institut Mathématique
Similarity:
Small maximal sum-free sets.
Giudici, Michael, Hart, Sarah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Conditions on periodicity for sum-free sets.
Calkin, Neil J., Finch, Steven R. (1996)
Experimental Mathematics
Similarity:
Powers of 2 with five distinct summands
Vsevolod F. Lev (2008)
Acta Arithmetica
Similarity:
Restricted sums of subsets of ℤ
Zhi-Wei Sun (2001)
Acta Arithmetica
Similarity:
Sums and differences of power-free numbers
Julia Brandes (2015)
Acta Arithmetica
Similarity:
We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions a, b ∈ ℕ to the equations a + b = n and a - b = n, where a is k-free and b is l-free. This is the first time that this problem has been studied with distinct powers k and l.
On the hybrid mean value of Cochrane sums and generalized Kloosterman sums
Tingting Wang (2012)
Acta Arithmetica
Similarity:
Unification of zero-sum problems, subset sums and covers of .
Sun, Zhiwei (2003)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
Sums of three cubes, II
Trevor D. Wooley (2015)
Acta Arithmetica
Similarity:
Estimates are provided for sth moments of cubic smooth Weyl sums, when 4 ≤ s ≤ 8, by enhancing the author's iterative method that delivers estimates beyond classical convexity. As a consequence, an improved lower bound is presented for the number of integers not exceeding X that are represented as the sum of three cubes of natural numbers.
A reciprocity theorem and a three-term relation for generalized Dedekind-Rademacher sums
L. Carlitz (1980)
Acta Arithmetica
Similarity:
A characterization of sequences with the minimum number of k-sums modulo k
Xingwu Xia, Yongke Qu, Guoyou Qian (2014)
Colloquium Mathematicae
Similarity:
Let G be an additive abelian group of order k, and S be a sequence over G of length k+r, where 1 ≤ r ≤ k-1. We call the sum of k terms of S a k-sum. We show that if 0 is not a k-sum, then the number of k-sums is at least r+2 except for S containing only two distinct elements, in which case the number of k-sums equals r+1. This result improves the Bollobás-Leader theorem, which states that there are at least r+1 k-sums if 0 is not a k-sum.