Related papers: Identically vanishing $k$-generalized Fibonacci po…

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

It is known that the elementary symmetric polynomials $e_k(x)$ have the property that if $ x, y \in [0,\infty)^n$ and $e_k(x) \leq e_k(y)$ for all $k$, then $||x||_p \leq ||y||_p$ for all real $0\leq p \leq 1$, and moreover $||x||_p \geq…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.

We study paths in the p-Bratteli diagram associated with hook partitions, where p is an odd prime. By comparing blocks along a path, we define inversions and descents. We prove that the sign balance derived from inversions vanishes at every…

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

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…

It is known that, for any positive non-square integer multiplier $k$, there is an infinity of multiples of triangular numbers which are triangular numbers. We analyze the congruence properties of the indices $\xi$ of triangular numbers that…

For a pair of positive integers (k,r) with r>1 such that k+1 and r-1 are relatively prime, we describe the space of symmetric polynomials in variables x_1,...,x_n which vanish at all diagonals of codimension k of the form…

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…

Computing asymptotics of the recurrence coefficients of X1-Jacobi polynomials we investigate the limit of Christoffel function. We also study the relation between the normalized counting measure based on the zeros of the modified average…

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We study arithmetic and asymptotic properties of polynomials provided by $Q_n(x):= x \sum_{k=1}^n k \, Q_{n-k}(x)$ with initial value $Q_0(x)=1$. The coefficients satisfy a central limit theorem and a local limit theorem involving Fibonacci…

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

Given a natural number $n \geq 2$, an integer $k$ and for a judiciously chosen $l = l(n)$ we give necessary and sufficient conditions for the polynomial $f_{n,k} = \big( \sum_{i=1}^{l} x_{i}^{n} \big) - k$ to have roots modulo every…