Related papers: Fibonacci-Like Polynomials Produced by m-ary Huffm…
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…
In this paper, by introducing the degenerate Fubini-type polynomials, we give several relations with the help of the Fa\`a di Bruno formula and some properties of Bell polynomials, and generating function methods. Also, we derive some new…
In this paper, we define multi poly-Bernoulli polynomials using multiple polylogarithm and derive some properties parallel to those of poly-Bernoulli polynomials. Furthermore, an explicit formula for certain Hurwitz-Lerch type multi…
We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.
We propose an algorithm for producing Hermite-Pad\'e polynomials of type I for an arbitrary tuple of $m+1$ formal power series $[f_0,\dots,f_m]$, $m\geq1$, about $z=0$ ($f_j\in{\mathbb C}[[z]]$) under the assumption that the series have a…
A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…
In this paper we evaluate sums and integrals of products of Fubini polynomials and have new explicit formulas for Fubini polynomials and numbers. As a consequence of these results new explicit formulas for p-Bernoulli numbers and…
This study presents a new class of poly-Genocchi polynomials constructed through the integration of some interesting polynomials. The resulting family, referred to as the multivariable generalized Hermite-type-Genocchi polynomials of order…
Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability. [See also ``Huffman…
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…
Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
Class polynomials attached to affine Hecke algebras were first introduced by X.~He in \cite{He1}. They play an important role in the study of affine Deligne-Lusztig varieties. Motivated by \cite{He2}, we compute the class polynomials…
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…
In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…