Related papers: Matrix products of binomial coefficients and unsig…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…
A random number of items each independently marked with one of a collection of colours gives rise to the multinomial marking, which generalises binomial thinning. A multivariate version, where previously marked items are then re-marked, has…
We use the symmetric product to describe the resultant scheme and discriminant scheme of polynomials two variables.
In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…
For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
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…
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,…