Modular periodicity of binomial coefficients

We prove that if the signed binomial coefficient viewed modulo p is a periodic function of i with period h in the range 0?i?k, then k+1 is a power of p, provided h is not too large compared to k. (In particular, 2h?k suffices). As an application, we prove that if G and H are multiplicative subgroups of a finite field, with H<G, and such that 1-α∈G for all α∈G?H, then G∪{0} is a subfield.     

On congruences related to central binomial coefficients

It is known that

     

Congruences for sums of binomial coefficients

Let q>1 and m>0 be relatively prime integers. We find an explicit period νm(q) such that for any integers n>0 and r we have

     

On sums of binomial coefficients and their applications

In this paper we study recurrences concerning the combinatorial sum and the alternate sum , where m>0, n?0 and r are integers. For example, we show that if n?m-1 then

     

A congruence involving products of q-binomial coefficients

In this paper we establish a q-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.     

Generalized Levinson-Durbin sequences, binomial coefficients and autoregressive estimation

For a discrete time second-order stationary process, the Levinson-Durbin recursion is used to determine the coefficients of the best linear predictor of the observation at time k+1, given k previous observations, best in the sense of minimizing the mean square error. The coefficients determined by the recursion define a Levinson-Durbin sequence. We also define a generalized Levinson-Durbin sequence and note that binomial coefficients form a special case of a generalized Levinson-Durbin sequence. All generalized Levinson-Durbin sequences are shown to obey summation formulas which generalize formulas satisfied by binomial coefficients. Levinson-Durbin sequences arise in the construction of several autoregressive model coefficient estimators. The least squares autoregressive estimator does not give rise to a Levinson-Durbin sequence, but least squares fixed point processes, which yield least squares estimates of the coefficients unbiased to order 1/T, where T is the sample length, can be combined to construct a Levinson-Durbin sequence. By contrast, analogous fixed point processes arising from the Yule-Walker estimator do not combine to construct a Levinson-Durbin sequence, although the Yule-Walker estimator itself does determine a Levinson-Durbin sequence. The least squares and Yule-Walker fixed point processes are further studied when the mean of the process is a polynomial time trend that is estimated by least squares.     

On some identities for the Fibonomial coefficients via generating function

Some new identities for the Fibonomial coefficients are derived. These identities are related to the generating function of the kth powers of the Fibonacci numbers. Proofs are based on manipulation with the generating function of the sequence of “signed Fibonomial triangle”.     

On Euler numbers modulo powers of two

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M.A. Stern.     

Factors of binomial sums from the Catalan triangle

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial coefficients and an odd power of a natural number. For example, we prove that for all positive integers n₁,…,nm, nm+1=n₁, and any nonnegative integer r, the expression

     

Cubic and quartic congruences modulo a prime

Let p>3 be a prime, and denote the number of solutions of the congruence . In this paper, using the third-order recurring sequences we determine the values of N_p(x³+a₁x²+a₂x+a₃) and N_p(x⁴+ax²+bx+c), and construct the solutions of the corresponding congruences, where a₁,a₂,a₃,a,b,c are integers.     

q-Analogs of some congruences involving Catalan numbers

We present some variations on the Greene–Krammer?s identity which involve q-Catalan numbers. Our method reveals an intriguing analogy between these new identities and some congruences modulo a prime.     

On congruences of Euler numbers modulo powers of two

In this paper, we establish some identities involving the Euler numbers, the Euler numbers of order 2 and the central factorial numbers, and give a new proof of a classical result due to M.A. Stern.

Video abstract

For a video summary of this paper, please visit http://www.youtube.com/watch?v=kdNsdTDA-FE.     

Fundamental solution of a multidimensional difference equation with periodical and matrix coefficients

Summary The multidimensional (partial) difference equation with periodical coefficients is transformed into an equation for a vector sequence. Integral formulae for the vector fundamental solution are developed and some results about its asymptotic properties are explained. As an example, the results are used for a simple difference equation on a hexagonal grid.     

A combinatorial identity with application to Catalan numbers

By a very simple argument, we prove that if l,m,n∈{0,1,2,…} then

     

Some curious congruences modulo primes

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence:

     

A note on the Mordell-Weil rank modulo n

Conjecturally, the parity of the Mordell-Weil rank of an elliptic curve over a number field K is determined by its root number. The root number is a product of local root numbers, so the rank modulo 2 is (conjecturally) the sum over all places of K of a function of elliptic curves over local fields. This note shows that there can be no analogue for the rank modulo 3, 4 or 5, or for the rank itself. In fact, standard conjectures for elliptic curves imply that there is no analogue modulo n for any n>2, so this is purely a parity phenomenon.     

The density of 0's in recurrence double sequences

Let be a double sequence over a finite field satisfying a linear recurrence with constant coefficients, with at most finitely many nonzero elements on each row. Given a nonzero element g of , we show how to obtain an explicit formula for the number of g's in the first qⁿ rows of A. We also characterize the cases when the density of 0's is 1.     

Applications of the classical umbral calculus

We describe applications of the classical umbral calculus to bilinear generating functions for polynomial sequences, identities for Bernoulli and related numbers, and Kummer congruences.Dedicated to the Memory of Gian-Carlo Rota