Abstract
The study of arithmetic properties of binomial coefficients has a rich history. A recurring theme is that p-adic statistics reflect the base-p representations of integers. We discuss many results expressing the number of binomial coefficients \(\left( {\begin{array}{c}n\\ m\end{array}}\right) \) with a given p-adic valuation in terms of the number of occurrences of a given word in the base-p representation of n, beginning with a result of Glaisher from 1899, up through recent results by Spiegelhofer–Wallner and Rowland.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allouche, J.-P., Shallit, J.: The ring of \(k\)-regular sequences. Theor. Comput. Sci. 98, 163–197 (1992)
Barat, G., Grabner, P.J.: Distribution of binomial coefficients and digital functions. J. Lond. Math. Soc. 64, 523–547 (2001)
Carlitz, L.: The number of binomial coefficients divisible by a fixed power of a prime. Rend. del Circ. Mat. di Palermo 16, 299–320 (1967)
Davis, K., Webb, W.: Pascal’s triangle modulo \(4\). Fibonacci Q. 29, 79–83 (1989)
Fine, N.: Binomial coefficients modulo a prime. Am. Math. Mon. 54, 589–592 (1947)
Glaisher, J.W.L.: On the residue of a binomial-theorem coefficient with respect to a prime modulus. Q. J. Pure Appl. Math. 30, 150–156 (1899)
Howard, F.T.: The number of binomial coefficients divisible by a fixed power of \(2\). Proc. Am. Math. Soc. 29, 236–242 (1971)
Huard, J.G., Spearman, B.K., Williams, K.S.: Pascal’s triangle (mod 9). Acta Arith. 78, 331–349 (1997)
Huard, J.G., Spearman, B.K., Williams, K.S.: Pascal’s triangle (mod 8). Eur. J. Comb. 19, 45–62 (1998)
Kummer, E.: Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen. J. für die rein und angewandte Math. 44, 93–146 (1852)
The OEIS Foundation, The On-Line Encyclopedia of Integer Sequences. http://oeis.org
Rowland, E.: The number of nonzero binomial coefficients modulo \(p^\alpha \). J. Comb. Num. Theor. 3, 15–25 (2011)
Rowland, E.: A matrix generalization of a theorem of Fine. https://arxiv.org/abs/1704.05872
Spiegelhofer, L., Wallner, M.: An explicit generating function arising in counting binomial coefficients divisible by powers of primes. https://arxiv.org/abs/1604.07089
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Rowland, E. (2017). Binomial Coefficients, Valuations, and Words. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-62809-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62808-0
Online ISBN: 978-3-319-62809-7
eBook Packages: Computer ScienceComputer Science (R0)