A lower bound for the discriminant of polynomials related to Chebyshev polynomials
Chebyshev polynomialdiscriminantlower boundMoore graphsorthogonal polynomialsspectral excess theorem
Vertex degrees (05C07) Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
The discriminant of a polynomial \(f=a\prod_{i=0}^m (x-\alpha_i)\) is defined by \[D(f)=a^{2m-2}\prod_{1\leq i<j\leq m} (\alpha_j-\alpha_i)^2.\] The discriminant is a useful tool to get information about the roots of a high-degree polynomial. In this paper, the author gives a lower bound for the discriminant of the polynomials \(\{G_{k,i}\}\) defined by \(G_{k,0}(x)=1\), \(G_{k,1}(x)=x+1\) and then recursively \[G_{k,i+2}(x)=xG_{k,i+1}(x)-(k-1)G_{k,i}(x).\] These polynomials have been used for the study of graphs and their girth (this is the length of the shortest circuit in the graph), specially due to its relation with the Moore Bound \[M_{d,k}=\begin{cases} 1+d\frac{(d-1)^{k-1}-1}{d-2}& d>2\\ 2k+1& d=2 \end{cases},\] which relates the degree, the order, the diameter and the girth of a graph. The discriminant of these polynomials have been used to prove the existence of graphs with certain degree or girth as in [\textit{C. Delorme} and \textit{G. Pineda-Villavicencio}, Electron. J. Comb. 17, No. 1, Research Paper R143, 25 p. (2010; Zbl 1204.05043)]. While all of this is addressed in the second section of the paper and the author suggests a path to proof his main result in a graph-theoretical way, most of the document is devoted to proof the result in a more elementary way. The main idea is to use orthogonality of some polynomials related to \(\{G_{k,i}\}\) and from there stablish a relation through simple inequalities with the discriminant of \(G_{k,d}\). While the notation could be a little heavy, the results are quite simple to follow, leading to the following bound for the discriminant: \[D(G_{k,d})>d^d(k-2)\left[\sqrt{k(k-1)^2-2}\right]^{d-2}.\]
- Lower bounds for discriminants of polynomials
- Lower bounds for the number of integral polynomials with given order of discriminants
- On the distance between the roots of a polynomial
- Discriminants of polynomials related to Chebyshev polynomials: the ``Mutt and Jeff syndrome
- The geometry of the discriminant of a polynomial
- A simple proof of the spectral excess theorem for distance-regular graphs
- A survey on the missing Moore graph
- An inequality for the discriminant of a polynomial
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 48956 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- Locally pseudo-distance-regular graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- On a version of the spectral excess theorem
- On graphs with cyclic defect or excess
- On Minimal graphs of maximum even girth
- On Moore Graphs with Diameters 2 and 3
- Resultants and discriminants of Chebyshev and related polynomials
- The Resultant of the Cyclotomic Polynomials F m (ax) and F n (bx)
- The spectral excess theorem for distance-regular graphs: a global (over)view
- The infinite sums of reciprocals and the partial sums of Chebyshev polynomials
- On symmetric association schemes and associated quotient-polynomial graphs
- Discriminants of Chebyshev-like polynomials and their generating functions
- Lower bounds for discriminants of polynomials
- Discriminants of polynomials related to Chebyshev polynomials: the ``Mutt and Jeff syndrome
This page was built for publication: A lower bound for the discriminant of polynomials related to Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222939)
