go-v.orgdoi

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes

M. Cámara, Josep M. Fabrega, Miquel Àngel Fiol, E. Garriga · The Electronic Journal of Combinatorics · 2009

  • DOI 10.37236/172
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2009

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009

Abstract

We present some related families of orthogonal polynomials of a discrete variable and survey some of their applications in the study of (distance-regular) graphs and (completely regular) codes. One of the main peculiarities of such orthogonal systems is their non-standard normalization condition, requiring that the square norm of each polynomial must equal its value at a given point of the mesh. For instance, when they are defined from the spectrum of a graph, one of these families is the system of the predistance polynomials which, in the case of distance-regular graphs, turns out to be the sequence of distance polynomials.

The applications range from (quasi-spectral) characterizations of distance-regular graphs, walk-regular graphs, local distance-regularity and completely regular codes, to some results on representation theory.

Open the resolved locator · 10.37236/172

Metadata licence: OpenAlex metadata (CC0)