Related papers: Gaussian binomial coefficients with negative argum…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of…

We give a new purely algebraic proof of the Baker-Campbell-Hausdorff theorem, which states that the homogeneous components of the formal expansion of $\log(e^Ae^B)$ are Lie polynomials. Our proof is based on a recurrence formula for these…

Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…

Suppose that the distribution of $X_a$ belongs to a natural exponential family concentrated on the nonegative integers and is such that $\E(z^{X_a})=f(az)/f(a)$. Assume that $\Pr(X_a\leq k)$ has the form $c_k\int_a ^{\infty}u^k\mu(du)$ for…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union…

Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using separately two polynomial identities of Kusraeva involving the root mean power…

We show that the multiple divisor functions of integers in invertible residue classes modulo a prime number, as well as the Fourier coefficients of GL(N) Maass cusp forms for all N larger than 2, satisfy a central limit theorem in a…

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…

We obtain a representation theorem for Banach space valued Gaussian random variables as integrals against a white noise. As a corollary we obtain necessary and sufficient conditions for the existence of a white noise representation for a…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…