English
Related papers

Related papers: On the isomorphism of certain primitive $Q$-polyno…

200 papers

We investigate intriguing sets of an association scheme introduced by Penttila and Williford (2011) that was the basis for their construction of primitive cometric association schemes that are not $P$-polynomial nor the dual of a…

Combinatorics · Mathematics 2019-02-12 John Bamberg , Klaus Metsch

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…

Combinatorics · Mathematics 2012-02-28 Sho Suda

We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…

Combinatorics · Mathematics 2017-08-01 Ferdinand Ihringer

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…

Combinatorics · Mathematics 2019-08-28 Alexander L. Gavrilyuk , Janoš Vidali , Jason S. Williford

In this paper, we study association schemes on the anisotropic points of classical polar spaces. Our main result concerns non-degenerate elliptic and hyperbolic quadrics in PG$(n,q)$ with $q$ odd. We define relations on the anisotropic…

Combinatorics · Mathematics 2026-01-28 Sam Adriaensen , Maarten De Boeck

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

The group $PGL(2,q)$ has an embedding into $PGL(3,q)$ such that it acts as the group fixing a nonsingular conic in $PG(2,q)$. This action affords a coherent configuration $R(q)$ on the set $L(q)$ of non-tangent lines of the conic. We show…

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

The action of $PGL(2,2^m)$ on the set of exterior lines to a nonsingular conic in $PG(2,2^m)$ affords an association scheme, which was shown to be pseudocyclic in Hollmann's thesis in 1982. It was further conjectured in Hollmann's thesis…

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Combinatorics · Mathematics 2024-08-20 Youming Qiao

n [D. de Caen, E.R. van Dam. Fissioned triangular schemes via the cross-ratio, {Europ. J. Combin.}, 22 (2001) 297-301], de Caen and van Dam constructed a fission scheme $\FT(q+1)$ of the triangular scheme on $\PG(1,q)$. This fission scheme…

Combinatorics · Mathematics 2011-07-05 Jianmin Ma , Kaishun Wang

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

Combinatorics · Mathematics 2007-05-23 Zhongming Tang , Zhe-xian Wan

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

Combinatorics · Mathematics 2017-02-21 Bo Ling , Ben Gong Lou , Ci Xuan Wu

The study of $P$-polynomial association schemes (distance-regular graphs) and $Q$-polynomial association schemes, and in particular $P$- and $Q$-polynomial association schemes, has been a central theme not only in the theory of association…

Combinatorics · Mathematics 2024-03-11 Eiichi Bannai , Hirotake Kurihara , Da Zhao , Yan Zhu

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

Rings and Algebras · Mathematics 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First

We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of…

Combinatorics · Mathematics 2009-11-11 J. H. Koolen , W. S. Lee , W. J. Martin

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

Combinatorics · Mathematics 2025-08-07 Priti Prasanna Mondal , M. Rajesh Kannan , Fouzul Atik

Let $H(n, q^2)$ be a non-degenerate Hermitian variety of $PG(n,q^2)$, $n \geq 2$. Let $NU(n+1,q^2)$ be the graph whose vertices are the points of $PG(n,q^2) \setminus H(n,q^2)$ and two vertices $u,~v$ are adjacent if the line joining $u$…

Combinatorics · Mathematics 2022-03-04 Federico Romaniello , Valentino Smaldore

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…

Combinatorics · Mathematics 2016-06-13 Sho Kubota

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…

Combinatorics · Mathematics 2023-08-17 Eiichi Bannai , Hirotake Kurihara , Da Zhao , Yan Zhu

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

Combinatorics · Mathematics 2022-10-27 Ada Chan , William J. Martin
‹ Prev 1 2 3 10 Next ›