1997
DOI: 10.1090/s0002-9947-97-01794-7
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients

Abstract: Abstract. This paper presents asymptotic formulas for the abundance of binomial, generalized binomial, multinomial, and generalized multinomial coefficients having any given degree of prime-power divisibility. In the case of binomial coefficients, for a fixed prime p, we consider the number of (x, y) with 0 ≤ x, y < p n for which x+y x is divisible by p zn (but not p zn+1 ) when zn is an integer and α < z < β, say. By means of a classical theorem of Kummer and the probabilistic theory of large deviations, we s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 63 publications
0
5
0
Order By: Relevance
“…(note i is never even in the first three sums, since then 2 t + 1 i is false; this justifies the second last equality, since in the last sum j runs through disjoint pairs of consecutive integers) where the last sum is wt(X(2 t , 2 t+1 ℓ − 1) by (12) and so is 2 n−2 by Theorem 4. Thus we have proved that (11) implies (13).…”
Section: Now We Determine Whenmentioning
confidence: 55%
See 1 more Smart Citation
“…(note i is never even in the first three sums, since then 2 t + 1 i is false; this justifies the second last equality, since in the last sum j runs through disjoint pairs of consecutive integers) where the last sum is wt(X(2 t , 2 t+1 ℓ − 1) by (12) and so is 2 n−2 by Theorem 4. Thus we have proved that (11) implies (13).…”
Section: Now We Determine Whenmentioning
confidence: 55%
“…Proof. Assume m i < p. By a known extension of Kummer's result that belongs to Dickson (see [13,Theorem D,p. 3860]) the power of p that divides the multinomial coefficient equals the number of carries when we add m 0 + m 1 + • • • + m n in base p, but the mentioned sum is equal to p, therefore the number of carries is 1.…”
Section: Enumeration Resultsmentioning
confidence: 94%
“…The carries Markov chain is truly ubiquitous; see Chapter 6 of [6] for a survey. Its many appearances in mathematics include: riffle shuffling ( [4], [5]), fractals [9], additive combinatorics [7], and cohomology [10].…”
Section: The Proof Of Theorem 21 Of This Paper Shows Thatmentioning
confidence: 99%
“…Using a theorem of E. Kummer [9] (see also [7]), we obtain the following explicit description of the rational G a -submodule G a • T n . Proposition 1.5.…”
Section: The Colimitmentioning
confidence: 99%