AI Chat AI Image Generator AI Video Text to Speech

The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications

03/17/2018

∙

by Claudio Qureshi, et al.

∙

∙

We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.

Claudio Qureshi
6 publications
Daniel Panario
15 publications

page 1

page 2

page 3

page 4

research

∙ 11/22/2020

Preimages of p-Linearized Polynomials over p

Linearized polynomials over finite fields have been intensively studied ...

0 Kwang Ho Kim, et al. ∙

research

∙ 03/05/2019

Planar Polynomials arising from Linearized polynomials

In this paper we construct planar polynomials of the type f_A,B(x)=x(x^q...

0 Daniele Bartoli, et al. ∙

research

∙ 04/07/2020

On the Number of Factorizations of Polynomials over Finite Fields

Motivated by coding applications,two enumeration problems are considered...

0 Rachel N. Berman, et al. ∙

research

∙ 01/04/2022

Dynamics of polynomial maps over finite fields

Let 𝔽_q be a finite field with q elements and let n be a positive intege...

0 José Alves Oliveira, et al. ∙

research

∙ 01/30/2021

Certified evaluations of Hölder continuous functions at roots of polynomials

Various methods can obtain certified estimates for roots of polynomials....

0 Parker B. Edwards, et al. ∙

research

∙ 04/22/2021

On the period collapse of a family of Ehrhart quasi-polynomials

A graph whose nodes have degree 1 or 3 is called a {1,3}-graph. Liu and ...

0 Cristina G. Fernandes, et al. ∙

research

∙ 07/17/2018

Model selection for sequential designs in discrete finite systems using Bernstein kernels

We view sequential design as a model selection problem to determine whic...

0 Madhurima Nath, et al. ∙