相关论文: A matrix generalization of a theorem of Fine

In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number…

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

In 1959, N. J. Fine showed that the sum of the multinomial coefficients corresponding to the partitions of a natural number $n$ into $r$ parts is a binomial coefficient: $$ \sum_{\substack{k_1 + k_2 + k_3 + {}\ldots = r \\ k_1 + 2k_2 + 3k_3…

Subresultants of two univariate polynomials are one of the most classic and ubiquitous objects in computational algebra and algebraic geometry. In 1948, Habicht discovered and proved interesting relationships among subresultants. Those…

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

The Binomial Theorem has long been essential in mathematics. In one form or another it was known to the ancients and, in the hands of Leibniz, Newton, Euler, Galois, and others, it became an essential tool in both algebra and analysis.…

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

This paper studies properties of the integer sequence $\overline{\overline{G}}_n=\prod_{k=0}^n\binom{n}{k}_{\mathbb{Z},\mathbb{N}}$ which is analogous to $\overline{G}_n=\prod_{k=0}^n\binom{n}{k}$, the product of the elements of the $n$-th…

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

In 1655, John Wallis whilst at the University of Oxford discovered the famous and beautiful formula for pi, now known as Wallis' Product. Since then, several analogous formulae have been discovered generalising the original. One more modern…

In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by…