zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients. (English) Zbl 0868.11009
The interest in prime factors of binomial coefficients during the last ten years or so has been motivated to a great extent by a conjecture of Erdös asserting that ${{2n}\choose n}$ is not squarefree for any $n>4$. This was recently proved by {\it G. Velammal} [Hardy-Ramanujan J. 18, 23-45 (1995; Zbl 0817.11011)], and another proof is given in the present paper, among many other interesting results. As a sharpening of the Erdös conjecture, it is shown that the coefficient in question is divisible even by the square of a prime $\geq \sqrt{n/5}$ for all $n\geq 2082$. On the other hand, ${{1572}\choose {786}}$ is not divisible by the square of any odd prime (it is divisible by $2^4$), and it is the largest coefficient of this kind. In addition to the middle of the Pascal triangle, the authors consider it as a whole, in particular its edges. Squarefree values (other than 1) do occur near the edges, and only there. For instance, there are infinitely many integers $n$ such that ${n\choose k}$ is squarefree for all $k\leq (1/5)\log n$. On the other hand, it is shown that if ${n\choose k}$ is squarefree, then $n$ or $n-k$ is $\ll\exp(c(\log n)^{2/k} (\log\log n)^{1/3})$ for some constant $c$, and it is conjectured that this bound can be reduced to $\ll(\log n\log\log n)^2$, which would be close to being best possible. A curious statistical result indicating the scarcity of the squarefree binomial coefficients is that the average number of these in a row of the Pascal triangle is about $10.66$. An important tool in previous work related to the Erdös conjecture has been the exponential sums of the type $\sum_n \Lambda(n)e(x/n)$, where $n$ thus runs essentially over primes, and the same is the case also in the present paper, where explicit estimates for such sums are given and applied as a key ingredient of the argument.
Reviewer: M.Jutila (Turku)

11B65Binomial coefficients, etc.
11L20Sums over primes
11L07Estimates on exponential sums
Full Text: DOI