Related papers: Generalised Binomial coefficients and Jarden's The…

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…

We consider products of two Macdonald polynomials of type A, indexed by dominant weights which are respectively a multiple of the first fundamental weight and a weight having zero component on the k-th fundamental weight. We give the…

This note states and proves a representation theorem for regular quantity functions, based on the theory of quantity spaces, thereby giving a new perspective on dimensional analysis and the classical $\pi$ theorem.

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

In this paper, we gave some properties of binomial coefficient.

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

We prove universal recursive formulas for Branson's $Q$-curvatures in terms of respective lower-order $Q$-curvatures, lower-order GJMS-operators and holographic coefficients.

Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…

We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…

We establish a generalization of Bourgain double recurrence theorem and ergodic Bourgain-Sarnak's theorem by proving that for any aperiodic $1$-bounded multiplicative function $\boldsymbol{\nu}$, for any map $T$ acting on a probability…

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where…

The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…

In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…