Related papers: A characterization of Q-polynomial association sch…

We give an equivalent condition of the $P$-polynomial property of symmetric association schemes.

We classify the Q-polynomial association schemes with $m_{1} = 4$ which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation $R_1$ if the scheme graph…

We prove some symmetric $q$-congruences.

The notion of multivariate $P$- and $Q$-polynomial association scheme has been introduced recently, generalizing the well-known univariate case. Numerous examples of such association schemes have already been exhibited. In particular, it…

We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our…

We present the tables of feasible parameters of primitive $3$-class $Q$-polynomial association schemes and $4$- and $5$-class $Q$-bipartite association schemes (on up to $2800$, $10000$, and $50000$ vertices, respectively), accompanied by a…

Bivariate P-polynomial association scheme of type $(\alpha,\beta)$ are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to a set of conditions on the intersection parameters.…

A characterization is given of those sequences of quasi-orthogonal polynomials which form also $q$-Appell sets.

The classification problem of $P$- and $Q$-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of $P$- and $Q$-polynomial association schemes to multivariate cases, namely…

A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…

In this paper we characterize "large" regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that "large" association schemes become $P$-polynomial…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

The bivariate $P$- and $Q$-polynomial structures of association schemes based on attenuated spaces are examined using recurrence and difference relations of the bivariate polynomials which form the eigenvalues of the scheme. These…

This paper classifies the contiguity relations for finite families of polynomials within the ($q$-)Askey scheme. The necessary and sufficient conditions for the existence of these contiguity relations are presented first. These conditions…

Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of…

Let Y denote a symmetric association scheme which is Q-polynomial with respect to an ordering E_0,...,E_D of the primitive idempotents. Bannai and Ito conjectured that the associated sequence of multiplicities m_0,...,m_D is unimodal. We…

In this paper we aim to characterize association schemes all of whose symmetric fusion schemes have only integral eigenvalues, and classify those obtained from a regular action of a finite group by taking its orbitals.

We prove that if X is a spherical t-design and s-distance set with $t\geq 2s-3$, then X has the structure of Q-polynomial association scheme of class s. Also, we describe the parameters of the association scheme.

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

We introduce and study a one-parameter generalization of the q-Whittaker symmetric functions. This is a family of multivariate symmetric polynomials, whose construction may be viewed as an application of the procedure of fusion from…