Related papers: On b-ary binomial coefficients with negative entri…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far. With the popularity of basis-preserving algorithms,…
The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…
Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
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…
We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
The aim of this paper is to further study some properties and identities on the degenerate Fubini and the degenerate Bell polynomials which are degenerate versions of the Fubini and the Bell polynomials, respectively. Especially, we find…
We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…
We prove positivity results about linearization and connection coefficients for Bessel polynomials. The proof is based on a recursion formula and explicit formulas for the coefficients in special cases. The result implies that the…
The central binomial series at negative integers are expressed as a linear combination of values of certain two polynomials. We show that one of the polynomials is a special value of the bivariate Eulerian polynomial and the other…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…