On a function related of multinomial coefficients. I.
Let \(p\) be a prime number, \(t\) and \(n\) be positive integers, and \(F_{p,t}(n)\) denote the number of coefficients of \((x_1+\dots+x_t)^{j}\) for \(0\leq j\leq n-1\) which are not divisible by \(p\). Set \(G_{p,t}(n)=F_{p,t}(n)/n^{\theta}\), where \(\theta=\log({p+t-1\choose t})/\log p\). By prior work of the authors, it is known that the \(\liminf_{n\rightarrow \infty} G_{p,t}(n)=\beta(p,t)\) is a positive real number. In this paper, the authors show that both \(F_{p,t}\) and \(G_{p,t}\) can be extended to continuous functions on \({\mathbb R}^+\), denoted by \(F\) and \(G\), respectively, which further satisfy various conditions such as \(F(px)=p^{\theta}F(x)\) and \(G(px)=G(x)\). Moreover, \(F\) is strictly increasing on \({\mathbb R}^+\), \(G\) is nowhere monotonic on \({\mathbb R}^+\) and both sets of differential and nondifferential points of \(G(x)\) are dense in \({\mathbb R}^+\). The function \(F(x)\) is explicitly given in the sense that given \(x\in {\mathbb R}^+\), the authors give a formula for \(F(x)\) in terms of the base \(p\) expansion of \(x\). Thus, in order to prove all their results, it just remains to check that \(F\) (and \(G\)) have all the announced properties, a task which is achieved in 14 pages of cumbersome algebraic manipulations with power series.
- A summation formula related to the binary digits
- Asymptotic behavior of Pascal's triangle modulo a prime
- Binomial Coefficients Modulo a Prime
- Distribution of polynomial coefficients, congruent modulo \(p^ N\)
- Exponential sums of sum-of-digit functions
- Exponential Sums Related to Binomial Coefficient Parity
- Formulas for the Number of Binomial Coefficients Divisible by a Fixed Power of a Prime
- scientific article; zbMATH DE number 4132253 (Why is no real title available?)
- scientific article; zbMATH DE number 166136 (Why is no real title available?)
- scientific article; zbMATH DE number 1354891 (Why is no real title available?)
- scientific article; zbMATH DE number 722337 (Why is no real title available?)
- Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
- Notes on Binomial Coefficients Ii-The Least N such that pe Divides an r -Nomial Coefficient of Rank n †
- Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
- Number of Odd Binomial Coefficients
- On Binomial Coefficient Residues
- On the number of odd binomial coefficients
- Pascal's triangle (mod 9)
- Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
- Reducing multinomial coefficients modulo a prime power
- The Number of 1’s in Binary Integers: Bounds and Extremal Properties
- The Number of Binomial Coefficients Divisible by a Fixed Power of 2
- The number of binomial coefficients in residue classes modulo p and p².
- The number of multinomial coefficients divisible by a fixed power of a prime
This page was built for publication: On a function related of multinomial coefficients. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1565979)
