X is a finite set and R is a partition of ลฝ . X = X. We say that X, R is quasi-thin if each element of R has a valency of at most two. In this paper we focus on quasi-thin association schemes with an odd ลฝ . number of points and obtain that X, R has a regular automorphism group when n is square-free
On Quasi-thin Association Schemes
โ Scribed by Mitsugu Hirasaka; Mikhail Muzychuk
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 144 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
โฆ Synopsis
An association scheme (or simply, a scheme) is called thin if each of its basic relations has valency 1. It is easy to see that thin schemes can be viewed as groups and, conversely, groups can be seen as thin schemes. In the present paper, we investigate schemes the basic relations of which have valency 1 or 2. We call these schemes quasi-thin. In order to formulate our results we let (X, R) denote a scheme (in the sense of P.-H. Zieschang). We first offer three sufficient conditions for (X, R) to have an automorphism group acting transitively on X. These conditions are
R possesses an element r such that OrP=R and Orr g P=Or g rP. We then prove that, if , 4, 7, 8, 12, 16}. As a consequence of the latter result, we obtain a classification of the quasi-thin schemes with |X|=4p, where p is a prime number.
๐ SIMILAR VOLUMES
We offer a sufficient condition for a closed subset in an association scheme to be maximal. The result generalizes naturally the well-known (group-theoretical) fact that the one-point-stabilizer of a flag transitive automorphism group of a 2-design with \*=1 must be a maximal subgroup. In finite gro
We characterize that the image of the embedding of the Q-polynomial association scheme into the first eigenspace by primitive idempotent E 1 is a spherical t-design in terms of the Krein numbers. Furthermore, we show that the strengths of Pand Q-polynomial schemes as spherical designs are bounded by
We describe fission schemes of most known classical self-dual association schemes, such as the Hamming scheme H(n, q) when q is a prime power. These fission schemes are themselves self-dual, with the exception of certain quadratic forms schemes in even characteristic.
In this paper, we investigate the semisimplicity of adjacency algebras of association schemes over positive characteristic fields. Our main result is that the Frame number characterizes semisimplicity of an adjacency algebra. In a sense, this is a generalization of Maschke's theorem.