Related papers: Binomial arrays and generalized Vandermonde identi…
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
In this paper, we derive some new combinatorial inequalities by applying well known real analytic results like H\"{o}lder's inequality, Young's inequality, and Minkowiski's inequality to the recursively defined sequence $f_n$ of functions…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…
This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…
The purpose of this manuscript is to derive two distinct integral representations of the generalized polylogarithm using two different techniques. The first approach involves the Dirichlet series and its Laplace representation, which leads…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
We represent a general bilinear Calder\'on-Zygmund operator as a sum of simple dyadic operators. The appearing dyadic operators also admit a simple proof of a sparse bound. In particular, the representation implies a so called sparse T1…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…
The primary purpose is to introduce and explore projective varieties, $\text{GRASS}_{\bf d}(\Lambda)$, parametrizing the full collection of those modules over a finite dimensional algebra $\Lambda$ which have dimension vector $\bf d$. These…
Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…