Related papers: Combinatorial interpretations of binomial coeffici…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

The moments of the Lucas polynomials and of the Chebyshev polynomials of the first kind are (multiples of) central binomial coefficients and the moments of the Fibonacci polynomials and of the Chebyshev polynomials of the second kind are…

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this…

In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…

The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…

In this paper we give a combinatorial interpretation for the coefficient of $s_{\nu}$ in the Kronecker product $s_{(n-p,p)}\ast s_{\lambda}$, where $\lambda=(\lambda_1, ..., \lambda_{\ell(\lambda)})\vdash n$, if $\ell(\lambda)\geq 2p-1$ or…

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we determine all Lucas numbers that are palindromic concatenations of two distinct repdigits.

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

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