Related papers: The Graph Structure of Chebyshev Polynomials over …
In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
This research is concerned with finding the roots of a function in an interval using Chebyshev Interpolation. Numerical results of Chebyshev Interpolation are presented to show that this is a powerful way to simultaneously calculate all the…
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…
We determine the cardinality of the value sets of bivariate Chebyshev maps over finite fields. We achieve this using the dynamical properties of these maps and the algebraic expressions of their fixed points in terms of roots of unity.
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic three.
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…
We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…
In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic two. Formulas are given for the length of the cycles and the depth of the trees relying…
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
In this paper we describe polynomials orthogonal to all powers of a Chebyshev polynomial on a segment.
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic five.
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…