Related papers: The Binomial Coefficient for Negative Arguments

We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…

An algorithm for computing the incomplete gamma function $\gamma^*(a,z)$ for real values of the parameter $a$ and negative real values of the argument $z$ is presented. The algorithm combines the use of series expansions, Poincar\'e-type…

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}$.

Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

We find an inverse factorial series expansion for the ratio of products of gamma functions whose arguments are linear functions of the variable. We a give recurrence relation for the coefficients in terms of the N{\o}rlund-Bernoulli…

We characterize the bialgebraic varieties of the $\Gamma$ function, that is, if $V,W\subseteq\mathbb{C}^n$ are irreducible affine algebraic variety which satisfy $\dim V =\dim W$ and $\Gamma(V)\subseteq W$, then the equations defining $V$…

Interpretations for the q-binomial coefficient evaluated at -q are discussed. A (q,t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.

We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…

In this article, we study the representability of integers as sums of pentagonal numbers, where a pentagonal number is an integer of the form $P_5(x)=\frac{3x^2-x}{2}$ for some non-negative integer $x$. In particular, we prove the…

We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix…

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Many sequences of binomial coefficients share various unimodality properties. In this paper we consider the unimodality problem of a sequence of binomial coefficients located in a ray or a transversal of the Pascal triangle. Our results…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Using a probabilistic approach, we derive several interesting identities involving beta functions. Our results generalize certain well-known combinatorial identities involving binomial coefficients and gamma functions.

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

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…

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].