Search arXivSearch

arXiv · 1809.03761

Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier-Hermite polynomials

Abstract

Generalizing previous work of Hora (1998) on the asymptotic spectral analysis for the Hamming graph $H(n,q)$ which is the $n^{\mathrm{th}}$ Cartesian power $K_q^{\square n}$ of the complete graph $K_q$ on $q$ vertices, we describe the possible limits of the joint spectral distribution of the pair $(G^{\square n},\overline{G}\vphantom{G}^{\square n})$ of the $n^{\mathrm{th}}$ Cartesian powers of a strongly regular graph $G$ and its complement $\overline{G}$, where we let $n\rightarrow\infty$, and $G$ may vary with $n$. This result is an analogue of the bivariate central limit theorem, and we obtain in this way the bivariate Poisson distributions and the standard bivariate Gaussian distribution, together with the product measures of univariate Poisson and Gaussian distributions. We also report a family of bivariate hypergeometric orthogonal polynomials with respect to the last distributions, which we call the bivariate Charlier-Hermite polynomials, and prove basic formulas for them. This family of orthogonal polynomials seems previously unnoticed, possibly because of its peculiarity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Vincent S. Morales, Nobuaki Obata, Hajime Tanaka. 2018-09-11. Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier-Hermite polynomials. https://doi.org/10.4064/cm7724-7-2019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO