English
Related papers

Related papers: On few-class $Q$-polynomial association schemes: f…

200 papers

It was shown by LeCompte, Martin, and Oweans in 2010 that the existence of mutually unbiased Hadamard matrices and the identity matrix, which coincide with mutually unbiased bases, is equivalent to that of a $Q$-polynomial association…

Combinatorics · Mathematics 2014-12-18 Hadi Kharaghani , Sara Sasani , Sho Suda

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

Multilevel programming is the standard framework for modeling hierarchical decision-making. In this paper, we characterize the computational complexity of deciding the existence of feasible and optimal solutions, as well as computing the…

Optimization and Control · Mathematics 2026-05-26 Nagisa Sugishita , Margarida Carvalho

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

In this short paper, we establish connection formulae for trivariate $q$-polynomials.

Combinatorics · Mathematics 2022-05-03 Sama Arjika , Zouhaïr Mouayn

We give three constructions of three-class association schemes as fusion schemes of the cyclotomic scheme, two of which are primitive

Combinatorics · Mathematics 2012-11-14 Tao Feng , Koji Momihara

Penttila and Williford constructed a $4-$class association scheme from a generalized quadrangle with a doubly subtended subquadrangle. We show that an association scheme with appropriate parameters and satisfying some assumption about…

Combinatorics · Mathematics 2022-05-12 Giusy Monzillo , Alessandro Siciliano

We describe primitive association schemes $\mathfrak{X}$ of degree $n$ such that $\mathrm{Aut}(\mathfrak{X})$ is imprimitive and $|\mathrm{Aut}(\mathfrak{X})| \geq \exp(n^{1/8})$, contradicting a conjecture of Babai. This and other examples…

Combinatorics · Mathematics 2023-05-11 Sean Eberhard

In this paper, we investigate hypergroups which arise from association schemes in a canonical way; this class of hypergroups is called realizable. We first study basic algebraic properties of realizable hypergroups. Then we prove that two…

Combinatorics · Mathematics 2017-04-24 Jaiung Jun

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.

Combinatorics · Mathematics 2008-02-21 Eiichi Bannai , Etsuko Bannai

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

Group Theory · Mathematics 2020-09-25 Peter J. Cameron , Sean Eberhard

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

Combinatorics · Mathematics 2016-01-20 Jianmin Ma , Jack Koolen

In this paper, we study the characters of homogeneous monotonic P-polynomial table algebras with finite dimension d>=5. We then apply them to association schemes. To this end, we develop some methods using tridiagonal matrices and…

Combinatorics · Mathematics 2019-07-11 Masoumeh Koohestani , Amir Rahnamai Barghi , Amirhossein Amiraslani

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…

Number Theory · Mathematics 2018-10-16 Alexander Berkovich , Ali K. Uncu

Association schemes on triples (ASTs) are ternary analogues of classical association schemes, whose relations and adjacency algebras are ternary instead of binary. We provide a survey of the current progress in the study of ASTs,…

Combinatorics · Mathematics 2022-06-22 Jose Maria P. Balmaceda , Dom Vito A. Briones

We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give…

Representation Theory · Mathematics 2019-01-23 Pavel Pyatov , Anastasia Trofimova

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

Combinatorics · Mathematics 2024-04-18 Allen Herman

In this article, we investigate the existence and schurity problem of association schemes whose thin residues are isomorphic to an elementary abelian $p$-group of rank $2$.

Combinatorics · Mathematics 2015-11-03 Mitsugu Hirasaka , Kijung Kim

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Number Theory · Mathematics 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz