On Pseudocyclic Association Schemes

M. E. Muzychuk, I. N. Ponomarenko

Introduction

A commutative association scheme is called pseudocyclic if the multiplicity of its non-principal irreducible character does not depend on the choice of the character (for a background on theory of association schemes and coherent configurations we refer to and Section 8). It can be proved that such a scheme is equivalenced, i.e. the valencies of its non-reflexive basis relations are pairwise equal. A classical example of a commutative pseudocyclic scheme is a cyclotomic scheme over a finite field; two other series of such schemes were constructed in . A motivation to study pseudocyclic schemes is that any of them produces special 22-designs.

In this paper we define an association scheme (not necessary commutative) to be pseudocyclic if the ratio of the multiplicity and degree of its non-principal irreducible character does not depend on the choice of the character. Clearly, in the commutative case both definitions give the same concept. To formulate one of the main results of this paper (which, in particular, shows that non-commutative pseudocyclic schemes do exist) we make two remarks. First, as in the commutative case we can prove (Theorem 2.2) that any pseudocyclic scheme is equivalenced; the valency of its non-reflexive basis relation is called the valency of the scheme. Secondly, under a Frobenius scheme we mean the scheme of a Frobenius group (in its standard permutation representation in which the one point stabilizer coincides with the Frobenius complement). Our first result is an immediate consequence of Theorems 2.1 and 6.4.

Any Frobenius scheme is pseudocyclic. Conversely, there exists a function f(k)f(k) such that any pseudocyclic scheme of valency k>1k>1 and rank at least f(k)f(k) is a Frobenius scheme.

The rough upper bound on the function f(k)f(k) obtained in the proof is O(k4)O(k^{4}). On the other hand, the scheme of a non-Desarguesian affine plane of order qq is non-schurian (see Subsection 3.5), and hence can not be a Frobenius scheme. Besides, it is pseudocyclic of valency q−1q-1 and rank q+2q+2. Thus f(k)≥k+3f(k)\geq k+3.

The proof of the second part of Theorem 1.1 is based on Theorem 4.4 giving together with Theorem 6.1 a sufficient condition for an equivalenced scheme to be schurian.

The celebrated Hanaki-Uno theorem states that any scheme of prime degree is pseudocyclic . Therefore as an immediate consequence of Theorem 1.1 we have the following result.

Any scheme of prime degree, valency kk and rank at least f(k)f(k) is schurian.

One of the most important problems in association scheme theory is to determine a scheme up to isomorphism by means of the intersection number array. For example, the intersection number array of the scheme of a distance-regular graph is uniquely determined by the parameters of the graph. Therefore the most part of characterizations of the classical distance-regular graphs given in are in fact the characterizations of their schemes in the above sense (we refer to for a survey of relevant results). In this paper we prove the following theorem.

Any Frobenius scheme of valency kk and rank at least f(k)f(k) is determined up to isomorphism by its intersection number array.

All undefined terms and results concerning permutation groups can be found in monographs . To make the paper as self-contained as possible we cite the background on association schemes and coherent configurations in Section 8. Section 2 contains the definition of a pseudocyclic scheme, several useful results on these schemes and the proof of the first part of Theorem 1.1 (Theorem 2.1). In Section 3 we give a brief exposition of known families of pseudocyclic schemes. In Sections 4 and 5 under a special assumption we explicitly find a one point extension of a pseudocyclic scheme and a one point extension of any algebraic isomorphism from it to another scheme (Theorems 4.4 and 5.2). Based on these results we prove our main theorems in Section 6. Section 7 includes some concluding remarks and special results concerning pseudocyclic schemes.

Notation. Throughout the paper Ω\Omega denotes a finite set. Set 1Ω={(α,α): α∈Ω}1_{\Omega}=\{(\alpha,\alpha):\ \alpha\in\Omega\} and 1α=1{α}1_{\alpha}=1_{\{\alpha\}} for all α∈Ω\alpha\in\Omega. For a relation r⊂Ω×Ωr\subset\Omega\times\Omega we set r∗={(β,α): (α,β)∈r}r^{*}=\{(\beta,\alpha):\ (\alpha,\beta)\in r\} and αr={β∈Ω: (α,β)∈r}\alpha r=\{\beta\in\Omega:\ (\alpha,\beta)\in r\} for all α∈Ω\alpha\in\Omega. The adjacency matrix of rr is denoted by A(r)A(r). For s⊂Ω×Ωs\subset\Omega\times\Omega we set r⋅s={(α,γ): (α,β)∈r, (β,γ)∈sr\cdot s=\{(\alpha,\gamma):\ (\alpha,\beta)\in r,\ (\beta,\gamma)\in s for some β∈Ω}\beta\in\Omega\}. If SS and TT are sets of relations, we set S⋅T={s⋅t: s∈S, t∈T}S\cdot T=\{s\cdot t:\ s\in S,\,t\in T\}. For a permutation group G≤Sym⁡(Ω)G\leq\operatorname{Sym}(\Omega) we denote by Orb⁡(G)=Orb⁡(G,Ω)\operatorname{Orb}(G)=\operatorname{Orb}(G,\Omega) the set of GG-orbits.

Pseudocyclic schemes

A scheme (Ω,S)(\Omega,S) is called pseudocyclic if the number mP/nPm_{\scriptscriptstyle P}/n_{\scriptscriptstyle P} does not depend on the choice of the central primitive idempotent P∈P#P\in{\cal P}^{\#} (see Subsection 8.9). In the commutative case nP=1n_{\scriptscriptstyle P}=1 for all P∈PP\in{\cal P}, and our definition is compatible with that from . Any regular scheme (not necessarily commutative) is pseudocyclic because in this case mP=nPm_{\scriptscriptstyle P}=n_{\scriptscriptstyle P} for all PP. More elaborated example of a non-commutative pseudocyclic scheme arises from a Frobenius group with non-abelian kernel. In what follows we use the family of such groups given in [26, pp.187-189].

Example. Let qq be a prime power and n>1n>1 an odd integer. Set HH to be a subgroup of GL⁡(3,qn)\operatorname{GL}(3,q^{n}) that consists of all matrices of the form

Then the mapping σ:A(a,b)↦A(ca,c1+qb)\sigma:A(a,b)\mapsto A(ca,c^{1+q}b) is a fixed point free automorphism of HH whenever the multiplicative order of cc equals (qn−1)/(q−1)(q^{n}-1)/(q-1). So the semidirect product G=HKG=HK where K=⟨σ⟩K=\langle\sigma\rangle, is a Frobenius group with non-abelian kernel HH and complement KK. The natural action of GG on HH produces an equivalenced scheme of degree ∣H∣=q2n|H|=q^{2n}, rank qn+1−qn+qq^{n+1}-q^{n}+q and valency (qn−1)/(q−1)(q^{n}-1)/(q-1). A straightforward calculation for (q,n)=(2,3)(q,n)=(2,3) shows that the adjacency algebra of the corresponding scheme has exactly four irreducible characters the multiplicities and degrees of which are as follows:

In particular, the scheme is not commutative but is pseudocyclic because mP/nP=7m_{\scriptscriptstyle P}/n_{\scriptscriptstyle P}=7 for all P∈P#P\in{\cal P}^{\#}. In fact, this example is a special case of the following theorem.

Any Frobenius scheme is pseudocyclic. Moreover, it is commutative if and only if the kernel of the associated Frobenius group is abelian.

Proof. Let (Ω,S)(\Omega,S) be a Frobenius scheme, G≤Sym⁡(Ω)G\leq\operatorname{Sym}(\Omega) the corresponding Frobenius group and the mapping

and hence the same set of central primitive idempotents, say P{\cal P}. Moreover, one can see that nP=mχPn_{{\scriptscriptstyle P}}=m_{\chi_{\scriptscriptstyle P}} and mP=χP(1)m_{{\scriptscriptstyle P}}=\chi_{{\scriptscriptstyle P}}(1) for all P∈PP\in{\cal P} where χP\chi_{P} is the irreducible character of GG corresponding to the central primitive idempotent PP. Since GG is a Frobenius group, by Theorem 8.4 this implies that

where KK is the complement of GG. Thus (Ω,S)(\Omega,S) is a pseudocyclic scheme.

(Indeed, CC contains a−1ca=a−1acca^{-1}ca=a^{-1}a^{c}c for all a∈Aa\in A and c∈Cc\in C. On the other hand, since c∉Ac\not\in A, the mapping a↦a−1aca\mapsto a^{-1}a^{c}, a∈Aa\in A, is a bijection. Thus CA=CCA=C. Taking into account that π(A+)=JΩ\pi(A^{+})=J_{\Omega}, we conclude that π(C+)\pi(C^{+}) is a scalar multiple of JΩJ_{\Omega}.) This implies that

Next, the group KK acts semiregularly on the set of non-trivial conjugacy classes of AA. So any set C∈Cla⁡G(A)C\in\operatorname{Cla}_{G}(A) other than {1}\{1\} is a disjoint union of exactly k=∣K∣k=|K| of these classes. This shows that

By (2) and (3) this is true if and only if ∣Cla⁡(A)∣=∣A∣|\operatorname{Cla}(A)|=|A|, i.e. the group AA is commutative.

We would like to have a characterization of a pseudocyclic scheme in terms of its intersection number array. For commutative case it was done in [5, Proposition 2.2.7].

The following two statements are equivalent:

(Ω,S)(\Omega,S) is a pseudocyclic scheme with mP/nP=km_{\scriptscriptstyle P}/n_{\scriptscriptstyle P}=k for all P∈P#P\in{\cal P}^{\#},

(Ω,S)(\Omega,S) is an equivalenced scheme of valency kk with c(r)=k−1c(r)=k-1 for all r∈S#r\in S^{\#}.

Moreover, any pseudocyclic scheme with pairwise equal non-principal dimensions of irreducible representations is commutative.

Proof. Set n=∣Ω∣n=|\Omega| and r=∣S∣r=|S|. We will use the following identity proved in Proposition 3.4 and Lemma 3.8(i) of :

where reg⁡(s∗)=∑t∈Scs∗tt\operatorname{reg}(s^{*})=\sum_{t\in S}c_{s^{*}t}^{t}. Suppose that mP/nP=km_{\scriptscriptstyle P}/n_{\scriptscriptstyle P}=k for all P∈P#P\in{\cal P}^{\#}. Then taking into account that I=J/n+∑P∈P#PI=J/n+\sum_{P\in{\cal P}^{\#}}P where II is the identity matrix, from (4) we obtain

By comparison of the diagonal and non-diagonal entries of the matrices in both sides of this equality we conclude (after rearrangements) that

This implies that ns=f=(n−1)/(r−1)n_{s}=f=(n-1)/(r-1) for all s∈S#s\in S^{\#}. Due to (6) this means that (Ω,S)(\Omega,S) is an equivalenced scheme of valency kk with c(r)=reg⁡(r)=k−1c(r)=\operatorname{reg}(r)=k-1 for all r∈S#r\in S^{\#}.

Assume now that (Ω,S)(\Omega,S) is an equivalenced scheme of valency kk with c(r)=k−1c(r)=k-1 for all r∈S#r\in S^{\#}. Then reg⁡(s)=c(r)\operatorname{reg}(s)=c(r) for all rr. So the left side of (4) is a linear combination of the matrices II and JJ. After multiplying both sides of that equality by P∈P#P\in{\cal P}^{\#} we see that mP/nP=km_{P}/n_{P}=k. Thus the scheme (Ω,S)(\Omega,S) is pseudocyclic with mP/nP=km_{P}/n_{P}=k for all P∈P#P\in{\cal P}^{\#}.

Let now (Ω,S)(\Omega,S) be a pseudocyclic scheme such that nPn_{P} does not depend on P∈P#P\in{\cal P}^{\#}. Denote this number by aa. Then by the first part of the proof the scheme is equivalenced of valency kk where ka=mPka=m_{P} for each P∈P#P\in{\cal P}^{\#}. So from (31) it follows that ∣P#∣a2=r−1=(n−1)/k|{\cal P}^{\#}|a^{2}=r-1=(n-1)/k. Therefore aa is coprime to nn. Taking into account that ns=kn_{s}=k for all s∈S#s\in S^{\#}, the Frame number of the scheme (Ω,S)(\Omega,S) can be computed as follows

Since this number is an integer and r>1r>1, we conclude that a=1a=1. Thus nP=1n_{P}=1 for all PP and the scheme is commutative.

There is a lot of equivalenced schemes (Ω,S)(\Omega,S) for which the group of algebraic isomorphisms acts transitively on S#S^{\#}. These schemes were first studied by Ikuta, Ito and Munemasa , and include the cyclotomic schemes over finite fields and the schemes of affine planes (see Section 3). The following statement shows that all of them are pseudocyclic.

Let (Ω,S)(\Omega,S) be an equivalenced scheme. Suppose that a group of its algebraic isomorphisms acts transitively on S#S^{\#}. Then (Ω,S)(\Omega,S) is a pseudocyclic scheme.

Proof. From the hypothesis it follows that the number c(s)c(s) does not depend on s∈S#s\in S^{\#}. So by Lemma 8.2 this number equals k−1k-1 and we are done by Theorem 2.2.

Sometimes one can construct a new pseudocyclic scheme by means of an appropriate algebraic fusion defined as follows. Let GG be a group of algebraic isomorphisms of a coherent configuration (Ω,S)(\Omega,S). Set

where sGs^{G} is the union of the relations sgs^{g}, g∈Gg\in G. It is easily seen that the pair (Ω,SG)(\Omega,S^{G}) is a coherent configuration. Moreover, if the group GG is half-transitive on S#S^{\#} and the coherent configuration (Ω,S)(\Omega,S) is equivalenced, then (Ω,SG)(\Omega,S^{G}) is an equivalenced scheme. An analog of this statement holds for commutative pseudocyclic schemes.Using Theorem 2.4 enables us to reduce substantially the proofs in [20, Section 3].

Let (Ω,S)(\Omega,S) be a commutative pseudocyclic scheme of valency kk and GG a group of algebraic isomorphisms of it. Suppose that GG acts semiregularly on S#S^{\#}. Then (Ω,SG)(\Omega,S^{G}) is a commutative pseudocyclic scheme of valency kmkm where m=∣G∣m=|G|.

Proof. We observe that (Ω,SG)(\Omega,S^{G}) being a fusion of a commutative scheme is also commutative. Since it is equivalenced of valency kmkm (see above), we have

Finally, any GG-orbit in P{\cal P} is of cardinality at most mm. Since P0P_{0} leaved fixed under GG and ∣P∣=∣S∣|{\cal P}|=|S|, this implies that

and the equality holds exactly when any GG-orbit in P#{\cal P}^{\#} is of size mm. Together with (7) and (8) this shows that ∣PG∣=∣P′∣|{\cal P}^{G}|=|{\cal P}^{\prime}|. Therefore mPG=mmP=mkm_{\scriptscriptstyle P^{G}}=mm_{P}=mk and nPG=1n_{\scriptscriptstyle P^{G}}=1 for all P∈P#P\in{\cal P}^{\#}. Thus the scheme (Ω,SG)(\Omega,S^{G}) is pseudocyclic.

A schurian equivalenced non-regular scheme is nothing but the scheme of 3/23/2-transitive group. In general, the latter is not a Frobenius group. However, the following statement holds.

A schurian pseudocyclic scheme of valency k>1k>1 and rank greater than 2(k−1)2(k-1) is a Frobenius scheme the automorphism group of which is a Frobenius group.

Proof. Let (Ω,S)(\Omega,S) be a schurian pseudocyclic scheme of valency k>1k>1 and G=Aut⁡(Ω,S)G=\operatorname{Aut}(\Omega,S). Then the set Fix⁡(g)\operatorname{Fix}(g) of points left fixed by a nonidentity permutation g∈Gg\in G does not coincide with Ω\Omega. So there exists α∈Ω\alpha\in\Omega such that αg≠α\alpha^{g}\neq\alpha. Since r(α,β)=r(αg,β)r(\alpha,\beta)=r(\alpha^{g},\beta) for all β∈Fix⁡(g)\beta\in\operatorname{Fix}(g), Theorem 2.2 implies that

where s=r(α,αg)s=r(\alpha,\alpha^{g}). Thus the permutation character of GG takes the value in the set {0,…,k−1}\{0,\ldots,k-1\} on all nonidentity elements. Therefore by [7, Prop.1] a point stabilizer GαG_{\alpha} has at most 2(k−1)−12(k-1)-1 non-regular orbits. If ∣S∣>2(k−1)|S|>2(k-1), then at least one orbit of GαG_{\alpha} is regular. This implies that so are all non-trivial orbits. Thus GG is a Frobenius group.

Known examples of pseudocyclic schemes

Any pseudocyclic scheme of rank 33 arises from either a conference matrix (symmetric case) or from a skew Hadamard matrix (antisymmetric case) . In any case the intersection number array is uniquely determined by the degree of the scheme. In particular, two such schemes are algebraically isomorphic if and only if they have the same degree. Since there is an infinite number of nn for which there are at least two non-equivalent conference matrices or non-equivalent skew Hadamard matrices of order nn, in general pseudocyclic schemes of rank 33 are not separable. Similarly, one can see that most of them are non-schurian. For instance, it follows from that an antisymmetric pseudocyclic scheme of rank 33 is schurian if and only if it is a scheme of a Paley tournament. Moreover, in [16, p.75] one can find an infinite family of non-schurian pseudocyclic schemes of rank 33 satisfying the 44-condition.

2. The Hollman schemes [5, p.390].

Let q>4q>4 be a power of 22. Denote by Ω\Omega the set of cyclic groups of order q+1q+1 in the group PSL⁡(2,q)\operatorname{PSL}(2,q). The latter acts transitively on Ω\Omega by conjugation and hence produces the scheme of degree (q2−q)/2(q^{2}-q)/2. One can prove that this scheme is symmetric and pseudocyclic of valency q+1q+1. Some algebraic fusions of the Hollman scheme that are also pseudocyclic were studied in .

3. The Passman schemes [25].

Let qq be an odd prime power and GG the group consisting the transformations

where a,b,c∈GF⁡(q)a,b,c\in\operatorname{GF}(q), and a≠0a\neq 0. Then GG is a 3/23/2-transitive group acting on a 22-dimensional space over GF⁡(q)\operatorname{GF}(q). The scheme of this group is equivalenced of degree q2q^{2} and valency 2(q−1)2(q-1). In fact, the Passman scheme is the algebraic fusion of the Frobenius scheme of valency q−1q-1 corresponding to the subgroup of GG of order (q−1)q2(q-1)q^{2} consisting of the first family of permutations from (9). Thus by Theorems 2.1 and 2.4 the Passman scheme is pseudocyclic.

4. Cyclotomic schemes.

Let RR be a finite local commutative ring with identity. Then its multiplicative group R×R^{\times} is the direct product of the Teichmüller group T{\cal T} and the group of principal units . The Teichmüller group is isomorphic to the multiplicative group of the residue field of RR, and acts as a fixed point free automorphism group of the additive group R+R^{+} of RR. Therefore for a given K≤TK\leq{\cal T}, the scheme Cyc⁡(K,R)\operatorname{Cyc}(K,R) of the group (R+⋊K,R+)(R^{+}\rtimes K,R^{+}) is a Frobenius scheme and hence pseudocyclic by Theorem 2.1. This example is a special case of a cyclotomic scheme over a finite commutative ring . In almost the same way one can construct a class of pseudocyclic schemes where the ground ring RR is replaced by a near-field , or even a near-ring.

5. Affine schemes.

Let Ω\Omega be a point set of a finite affine space A{\cal A} (see ). Denote by SS the partition of Ω×Ω\Omega\times\Omega containing 1Ω1_{\Omega} and such that two pairs (α,β),(α′,β′)∈Ω×Ω(\alpha,\beta),(\alpha^{\prime},\beta^{\prime})\in\Omega\times\Omega, α≠β\alpha\neq\beta, α′≠β′\alpha^{\prime}\neq\beta^{\prime}, belong to the same class if and only if the lines αβ\alpha\beta and α′β′\alpha^{\prime}\beta^{\prime} are equal or parallel. Then the pair (Ω,S)(\Omega,S) is a symmetric scheme and nonzero intersection numbers crstc_{rs}^{t} with 1Ω∉{r,s}1_{\Omega}\not\in\{r,s\} are as follows:

where qq is the size of a line in A{\cal A} (called the order of A{\cal A}). It follows that it is a pseudocyclic scheme of valency q−1q-1. Each relation of an affine scheme is an involution in a sense of . It was shown in that a scheme whose relations are involutions is an affine scheme. Thus there is one-to-one correspondence between affine schemes and affine spaces. It is straightforward to prove that the schemes of affine spaces are isomorphic (resp. algebraically isomorphic) if and only if the affine spaces are isomorphic (resp. have the same order).

The scheme of a finite affine space A{\cal A} is schurian if and only if A{\cal A} is Desarguesian.

Proof. By the Veblen-Young theorem (cf. ) a finite affine space A{\cal A} is either a non-Desarguesian affine plane, or the nn-dimensional affine geometry AG⁡(n,q)\operatorname{AG}(n,q) over GF⁡(q)\operatorname{GF}(q). In the latter case the scheme of A{\cal A} coincides with the scheme of the group

where TT is the translation group and CC is the centre of GL⁡(n,q)\operatorname{GL}(n,q). This proves the sufficiency part of the theorem. To prove the necessity assume that the scheme of A{\cal A} is schurian. Then it satisfies the 44-condition and the required statement immediately follows from the lemma below.

Suppose that the scheme of an affine space A{\cal A} satisfies the 44-condition. Then A{\cal A} is Desarguesian.

Proof. Let (Ω,S)(\Omega,S) be the scheme of A{\cal A}. It suffices to verify that given seven distinct points α,α′\alpha,\alpha^{\prime}, β,β′\beta,\beta^{\prime}, γ,γ′\gamma,\gamma^{\prime} and δ\delta, such that αα′\alpha\alpha^{\prime}, ββ′\beta\beta^{\prime}, and γγ′\gamma\gamma^{\prime} are distinct lines through δ\delta and αγ\alpha\gamma is parallel to α′γ′\alpha^{\prime}\gamma^{\prime} and βγ\beta\gamma is parallel to β′γ′\beta^{\prime}\gamma^{\prime}, then αβ\alpha\beta is parallel to α′β′\alpha^{\prime}\beta^{\prime} (see Fig 1).

However, since δγ=δγ′\delta\gamma=\delta\gamma^{\prime}, we have r(δ,γ)=r(δ,γ′)r(\delta,\gamma)=r(\delta,\gamma^{\prime}). Due to the 44-condition there exist points α′′,β′′\alpha^{\prime\prime},\beta^{\prime\prime} such that the 44-sets Δ={δ,γ,α,β}\Delta=\{\delta,\gamma,\alpha,\beta\} and Δ′={δ,γ′,α′′,β′′}\Delta^{\prime}=\{\delta,\gamma^{\prime},\alpha^{\prime\prime},\beta^{\prime\prime}\} have the same type with respect to the pairs (δ,γ)(\delta,\gamma) and (δ,γ′)(\delta,\gamma^{\prime}) respectively. So r(α,δ)=r(α′′,δ)r(\alpha,\delta)=r(\alpha^{\prime\prime},\delta) and r(β,δ)=r(β′′,δ)r(\beta,\delta)=r(\beta^{\prime\prime},\delta). This implies that

On the other hand, r(α,γ)=r(α′′,γ′)r(\alpha,\gamma)=r(\alpha^{\prime\prime},\gamma^{\prime}) and r(β,γ)=r(β′′,γ′)r(\beta,\gamma)=r(\beta^{\prime\prime},\gamma^{\prime}). Therefore αγ\alpha\gamma is parallel to α′′γ′\alpha^{\prime\prime}\gamma^{\prime}, and βγ\beta\gamma is parallel to β′′γ′\beta^{\prime\prime}\gamma^{\prime}. Thus from (11) we conclude that α′′=α′\alpha^{\prime\prime}=\alpha^{\prime} and β′′=β′\beta^{\prime\prime}=\beta^{\prime}. Since also r(α,β)=r(α′′,β′′)r(\alpha,\beta)=r(\alpha^{\prime\prime},\beta^{\prime\prime}), the line αβ\alpha\beta is parallel to α′′β′′=α′β′\alpha^{\prime\prime}\beta^{\prime\prime}=\alpha^{\prime}\beta^{\prime}, and we are done.

6. Amorphic schemes.

A scheme (Ω,S)(\Omega,S) is called amorphic if any its fusion is a scheme. It was shown in that all basis graphs of an amorphic scheme of rank at least four are strongly regular either of Latin square type or of negative Latin square type. If an amorphic scheme is equivalenced, then its group of algebraic automorphisms is Sym⁡(S#)\operatorname{Sym}(S^{\#}). This implies (Corollary 2.3) that (Ω,S)(\Omega,S) is pseudocyclic. A scheme of an affine plane of order qq is an amorphic (q−1)(q-1)-valenced scheme of rank q+2q+2. This yields us the following statement.

Let qq be the order of an affine plane. Then given a divisor mm of q+1q+1 and a partition of {1,…,q+1}\{1,\ldots,q+1\} in mm classes of cardinality (q+1)/m(q+1)/m, there exists an amorphic pseudocyclic scheme of degree q2q^{2}, valency (q2−1)/m(q^{2}-1)/m and rank m+1m+1.

One point extension of an equivalenced scheme.

Let (Ω,S)(\Omega,S) be an equivalenced scheme of valency kk. For each (possibly equal) basis relations u,v∈S#u,v\in S^{\#} we define the splitting set of them as follows:

It is easily seen that D(u,v)=D(v,u)D(u,v)=D(v,u) and uu∗∩ww∗=vv∗∩ww∗={1Ω}uu^{*}\cap ww^{*}=vv^{*}\cap ww^{*}=\{1_{\Omega}\} for all w∈D(u,v)w\in D(u,v). Therefore from Lemma 8.3 it follows that

for all s∈Ss\in S. In particular, ∣u∗w∣=∣w∗v∣=k|u^{*}w|=|w^{*}v|=k.

Given w∈D(u,v)w\in D(u,v) the following statements hold:

∣u∗v∣=k ⇔ u∈D(v,w) ⇔ v∈D(w,u)|u^{*}v|=k\ \Leftrightarrow\ u\in D(v,w)\ \Leftrightarrow\ v\in D(w,u),

∣ab∩u∗v∣=1|ab\cap u^{*}v|=1 for all a∈u∗wa\in u^{*}w and b∈w∗vb\in w^{*}v.

Proof. To prove statement (1) suppose that ∣u∗v∣=k|u^{*}v|=k. Then cu∗vt≤1c_{u^{*}v}^{t}\leq 1 for all t∈St\in S. So from Lemma 8.3 it follows that uu∗∩vv∗={1Ω}uu^{*}\cap vv^{*}=\{1_{\Omega}\}. On the other hand, given a relation s∈(vv∗ ww∗)∩uu∗s\in(vv^{*}\,ww^{*})\cap uu^{*} one can find points α,β∈Ω\alpha,\beta\in\Omega to have the configuration at Fig. 2.

So r(α,β)∈(uu∗ vv∗)∩ww∗={1Ω}r(\alpha,\beta)\in(uu^{*}\,vv^{*})\cap ww^{*}=\{1_{\Omega}\} whence it follows that α=β\alpha=\beta. Therefore s∈vv∗∩uu∗={1Ω}s\in vv^{*}\cap uu^{*}=\{1_{\Omega}\}. Thus s=1Ωs=1_{\Omega}, and hence u∈D(v,w)u\in D(v,w). Conversely, if u∈D(v,w)u\in D(v,w), then (vv∗ ww∗)∩uu∗={1Ω}(vv^{*}\,ww^{*})\cap uu^{*}=\{1_{\Omega}\}. So vv∗∩uu∗={1Ω}vv^{*}\cap uu^{*}=\{1_{\Omega}\}, and hence ∣u∗v∣=k|u^{*}v|=k by Lemma 8.3. This completes the proof of the first equivalence in statement (1). The second equivalence immediately follows from the first one by interchanging uu and vv because D(u,v)=D(v,u)D(u,v)=D(v,u).

To prove statement (2) let a∈u∗wa\in u^{*}w and b∈w∗vb\in w^{*}v. Then w∈ua∩vb∗w\in ua\cap vb^{*}. This implies that ∣ua∩vb∗∣≥1|ua\cap vb^{*}|\geq 1, and hence ∣ab∩u∗v∣≥1|ab\cap u^{*}v|\geq 1. Thus it suffices to verify that ∣ab∩u∗v∣≤1|ab\cap u^{*}v|\leq 1. To do this we need the following auxiliary statement.

Given a relation s∈ab∩u∗vs\in ab\cap u^{*}v and points α,β,γ∈Ω\alpha,\beta,\gamma\in\Omega such that r(α,β)=sr(\alpha,\beta)=s, r(α,γ)=ar(\alpha,\gamma)=a and r(γ,β)=br(\gamma,\beta)=b there exists a unique point δ∈Ω\delta\in\Omega for which r(δ,α)=ur(\delta,\alpha)=u, r(δ,β)=vr(\delta,\beta)=v and r(δ,γ)=wr(\delta,\gamma)=w (see Fig. 3)

Proof. Since a∈u∗wa\in u^{*}w and b∈w∗vb\in w^{*}v, there exist points λ\lambda, μ\mu, ν\nu such that r(λ,α)=ur(\lambda,\alpha)=u, r(λ,β)=vr(\lambda,\beta)=v, r(μ,α)=ur(\mu,\alpha)=u, r(μ,γ)=wr(\mu,\gamma)=w and r(ν,γ)=wr(\nu,\gamma)=w, r(ν,β)=vr(\nu,\beta)=v (see Fig. 4).

Now r(μ,ν)∈(uu∗ vv∗)∩ww∗={1Ω}r(\mu,\nu)\in(uu^{*}\,vv^{*})\cap ww^{*}=\{1_{\Omega}\}. Thus μ=ν\mu=\nu. Denote this point by δ\delta. Then for δ\delta the statement of the lemma holds. To prove the uniqueness we note if δ1\delta_{1} and δ2\delta_{2} are two points forming Fig. 3, then the relation r(δ1,δ2)r(\delta_{1},\delta_{2}) belongs to the set ww∗∩uu∗∩vv∗={1Ω}ww^{*}\cap uu^{*}\cap vv^{*}=\{1_{\Omega}\}, and hence δ1=δ2\delta_{1}=\delta_{2}.

To complete the proof of Theorem 4.1 suppose that ab∩u∗v⊃{s1,s2}ab\cap u^{*}v\supset\{s_{1},s_{2}\} with s1≠s2s_{1}\neq s_{2}. Then there exist points α,γ,β1,β2∈Ω\alpha,\gamma,\beta_{1},\beta_{2}\in\Omega, such that β1≠β2\beta_{1}\neq\beta_{2}, r(α,γ)=ar(\alpha,\gamma)=a and r(γ,βi)=br(\gamma,\beta_{i})=b, r(α,βi)=sir(\alpha,\beta_{i})=s_{i} for i=1,2i=1,2. By Lemma 4.2 with s=sis=s_{i} one can find a point δi\delta_{i} for which r(δi,α)=ur(\delta_{i},\alpha)=u, r(δi,β)=vr(\delta_{i},\beta)=v and r(δi,γ)=wr(\delta_{i},\gamma)=w (see Fig. 5).

Since the relation r(δ1,δ2)r(\delta_{1},\delta_{2}) belongs to the set ww∗∩uu∗={1Ω}ww^{*}\cap uu^{*}=\{1_{\Omega}\}, we have δ1=δ2\delta_{1}=\delta_{2}. Denote this point by δ\delta. Then r(δ,βi)=vr(\delta,\beta_{i})=v. Since r(βi,γ)=b∗r(\beta_{i},\gamma)=b^{*}, r(δ,γ)=wr(\delta,\gamma)=w and β1≠β2\beta_{1}\neq\beta_{2}, this implies that cvb∗w≥2c_{vb^{*}}^{w}\geq 2. So by equivalencity (X,Ω)(X,\Omega) and (33) we conclude that cw∗vb≥2c_{w^{*}v}^{b}\geq 2 which contradicts to (13).

2. A one point extension.

By means of splitting sets we are going to find explicitly the α0\alpha_{0}-extension of the scheme (Ω,S)(\Omega,S) for any point α0∈Ω\alpha_{0}\in\Omega. To do this for any relations u,v∈Su,v\in S set

It is easily seen that the union of relations from S(u,v)S(u,v) coincides with the set α0u×α0v\alpha_{0}u\times\alpha_{0}v. Suppose that w∈D(u,v)w\in D(u,v). Then from statement (2) of Theorem 4.1 it follows that

where S(u,v;w)=Sα0(u,v;w)=S(u,w)⋅S(w,v)S(u,v;w)=S_{\alpha_{0}}(u,v;w)=S(u,w)\cdot S(w,v). Suppose, in addition, that ∣u∗v∣=k|u^{*}v|=k. Then any relation in S(u,v)S(u,v) is of cardinality kk. Since the same is true for the relations in S(u,v;w)S(u,v;w), we conclude that

In particular, in this case the relations from S(u,v;w)S(u,v;w) form a partition of the set α0u×α0v\alpha_{0}u\times\alpha_{0}v. For arbitrary uu and vv we will prove the latter only under the following additional assumption:

In this case obviously D(u,v)≠∅D(u,v)\neq\emptyset.

Let u,v∈S#u,v\in S^{\#} be such that (17) holds. Then the set S(u,v;w)S(u,v;w) forms a partition of the set α0u×α0v\alpha_{0}u\times\alpha_{0}v, and this partition does not depend on the choice of the relation w∈D(u,v)w\in D(u,v).

Proof. Let w,w′∈D(u,v)w,w^{\prime}\in D(u,v). Then ∣u∗w∣=∣u∗w′∣=∣v∗w∣=∣v∗w′∣=k|u^{*}w|=|u^{*}w^{\prime}|=|v^{*}w|=|v^{*}w^{\prime}|=k. On the other hand, due to (17) one can find a relation

Let a∈S(u,t)a\in S(u,t) and b∈S(t,v)b\in S(t,v). Since obviously b∗∈S(v,t)b^{*}\in S(v,t) by (18) with (x,y)=(u,w)(x,y)=(u,w) and (x,y)=(v,w)(x,y)=(v,w) we obtain

So the element a⋅b∈S(u,v;w)a\cdot b\in S(u,v;w) has at least kk different representations (one for each choice of cc) of the form a⋅b=(a⋅c)(c∗⋅b)a\cdot b=(a\cdot c)(c^{*}\cdot b) with c∗⋅b∈S(w,v)c^{*}\cdot b\in S(w,v). Since ∣S(u,w)∣=∣S(w,v)∣=k|S(u,w)|=|S(w,v)|=k this implies that ∣S(u,v;w)∣=k|S(u,v;w)|=k. Thus S(u,v;w)S(u,v;w) is a partition of α0u×α0v\alpha_{0}u\times\alpha_{0}v and S(u,v;w)=S(u,v;t)S(u,v;w)=S(u,v;t). Similarly, using equalities (18) with (x,y)=(u,w′)(x,y)=(u,w^{\prime}) and (x,y)=(v,w′)(x,y)=(v,w^{\prime}) one can prove that S(u,v;w′)S(u,v;w^{\prime}) is a partition of α0u×α0v\alpha_{0}u\times\alpha_{0}v and that S(u,v;w′)=S(u,v;t)S(u,v;w^{\prime})=S(u,v;t). Thus

By Lemma 4.3 we can define a uniquely determined partition of the set Ω0×Ω0\Omega_{0}\times\Omega_{0} where Ω0=Ω∖{α0}\Omega_{0}=\Omega\setminus\{\alpha_{0}\}, as follows

It is easily seen that 1α0u∈S01_{\alpha_{0}u}\in S_{0} for all u∈S#u\in S^{\#}. Therefore 1Ω0∈S0∪1_{\Omega_{0}}\in S_{0}^{\cup}. Besides, since obviously S(u,v;w)∗=S(v,u;w)S(u,v;w)^{*}=S(v,u;w) for all u,v,wu,v,w, the partition S0S_{0} is closed with respect to ∗*. Finally, the condition (27) is satisfied for S=S0S=S_{0}. Therefore if (Ω0,S0)(\Omega_{0},S_{0}) is a coherent configuration, then it is semiregular. We will prove the former under the following assumption:

Let (Ω,S)(\Omega,S) be an equivalenced scheme satisfying conditions (17) and (20) for all u,v∈S#u,v\in S^{\#}. Then

In particular, the α0\alpha_{0}-extension of (Ω,S)(\Omega,S) is a semiregular coherent configuration on Ω0\Omega_{0} the fibers of which are α0u\alpha_{0}u, u∈Su\in S.

Proof. It suffices to verify that (Ω0,S0)(\Omega_{0},S_{0}) is a coherent configuration. Indeed, if it is so and S′=S0(α0)∪S1(α0)S^{\prime}=S_{0}(\alpha_{0})\cup S_{1}(\alpha_{0}), then obviously (Ω,S′)(\Omega,S^{\prime}) is a semiregular coherent configuration the fibers of which are α0u\alpha_{0}u, u∈Su\in S. Therefore due to (15) we have 1α0∈S′1_{\alpha_{0}}\in S^{\prime} and S⊂(S′)∪S\subset(S^{\prime})^{\cup}. By the minimality of the α0\alpha_{0}-extension this implies that

On the other hand, it is easily seen that the set S(u,v)S(u,v), and hence the set S(u,v;w)=S(u,w)⋅S(w,v)S(u,v;w)=S(u,w)\cdot S(w,v) is contained in (Sα0)∪(S_{\alpha_{0}})^{\cup} for all u,v,w∈Su,v,w\in S. Therefore S′⊂(Sα0)∪S^{\prime}\subset(S_{\alpha_{0}})^{\cup}. Together with (21) this shows that (Sα0)∪=(S′)∪(S_{\alpha_{0}})^{\cup}=(S^{\prime})^{\cup}. Thus Sα0=S′S_{\alpha_{0}}=S^{\prime} and we are done.

Let us prove that (Ω0,S0)(\Omega_{0},S_{0}) is a coherent configuration. We observe that due to (17) Lemma 4.3 implies that S0S_{0} is a partition of Ω0×Ω0\Omega_{0}\times\Omega_{0}. Thus it suffices to verify that if b,c∈S0b,c\in S_{0} with b⋅c≠∅b\cdot c\neq\emptyset, then b⋅c∈S0b\cdot c\in S_{0} (see the remarks after (19)). However, for such bb and cc we have

for appropriate u,v,w∈S#u,v,w\in S^{\#}. By condition (20) one can find

Since b=a1⋅a2b=a_{1}\cdot a_{2} for some a1∈S(u,v;t)a_{1}\in S(u,v;t) and a2∈S(v,w;t)a_{2}\in S(v,w;t), this implies that ∣S(v,t)∣=∣S(w,t)∣=k|S(v,t)|=|S(w,t)|=k where kk is the valency of (Ω,S)(\Omega,S). So by statement (1) of Theorem 4.1 we have w∈D(v,t)w\in D(v,t). Therefore a2∗∈S(v,t;w)a_{2}^{*}\in S(v,t;w) and hence there exists a3∈S(t,w)a_{3}\in S(t,w) such that c=a2∗⋅a3c=a_{2}^{*}\cdot a_{3}. Thus

This means that b⋅c∈S0b\cdot c\in S_{0} which completes the proof.

One point extension of an algebraic isomorphism

We keep the notation of Section 4. Let (Ω′,S′)(\Omega^{\prime},S^{\prime}) be a scheme and let

be an algebraic isomorphism. Then obviously (Ω′,S′)(\Omega^{\prime},S^{\prime}) is an equivalenced scheme of valency kk, and

Let us fix a point α0′∈Ω′\alpha^{\prime}_{0}\in\Omega^{\prime}. Take u,v∈Su,v\in S. Since cuvw=cu′v′w′c_{uv}^{w}=c_{u^{\prime}v^{\prime}}^{w^{\prime}} for all w∈Sw\in S, the mapping φ\varphi induces a bijection

where a=s∩(α0u×α0v)a=s\cap(\alpha_{0}u\times\alpha_{0}v) and a′=s′∩(α0′u′×α0′v′)a^{\prime}=s^{\prime}\cap(\alpha^{\prime}_{0}u^{\prime}\times\alpha^{\prime}_{0}v^{\prime}). Below we set S′(u′,v′)=Sα0′(u′,v′)S^{\prime}(u^{\prime},v^{\prime})=S_{\alpha^{\prime}_{0}}(u^{\prime},v^{\prime}).

Let u,v∈S#u,v\in S^{\#} be such that (17) holds. Then for any relations w1,w2∈D(u,v)w_{1},w_{2}\in D(u,v) we have

for all bi∈S(u,wi)b_{i}\in S(u,w_{i}) and ci∈S(wi,v)c_{i}\in S(w_{i},v), i=1,2i=1,2.

Proof. Suppose that b1⋅c1=b2⋅c2b_{1}\cdot c_{1}=b_{2}\cdot c_{2} where bi∈S(u,wi)b_{i}\in S(u,w_{i}) and ci∈S(wi,v)c_{i}\in S(w_{i},v), i=1,2i=1,2. Then ∣u∗w1∣=∣u∗w2∣=∣v∗w1∣=∣v∗w2∣=k|u^{*}w_{1}|=|u^{*}w_{2}|=|v^{*}w_{1}|=|v^{*}w_{2}|=k. Besides, by (17) one can find a relation

Take any a1∈S(u,t)a_{1}\in S(u,t). By (22) we have d1:=a1∗b1∈S(t,w1)d_{1}:=a_{1}^{*}b_{1}\in S(t,w_{1}) and d2:=a1∗⋅b2∈S(t,w2)d_{2}:=a_{1}^{*}\cdot b_{2}\in S(t,w_{2}). Since w1∈D(t,v)w_{1}\in D(t,v), we also have a2:=d1⋅c1∈S(t,v)a_{2}:=d_{1}\cdot c_{1}\in S(t,v). Thus

whence it follows that c2=d2∗⋅a2c_{2}=d_{2}^{*}\cdot a_{2} (Figure 6).

Let us define a mapping φ0:S0→S0′\varphi_{0}:S_{0}\to S^{\prime}_{0} where S0=Sα0S_{0}=S_{\alpha_{0}} and S0′=Sα0′′S^{\prime}_{0}=S^{\prime}_{\alpha^{\prime}_{0}}, as follows. Take s∈S0s\in S_{0}. Then s⊂α0u×α0vs\subset\alpha_{0}u\times\alpha_{0}v for some u,v∈Su,v\in S. Set

where w∈D(u,v)w\in D(u,v) and s1∈S(u,w)s_{1}\in S(u,w), s2∈S(w,v)s_{2}\in S(w,v) are such that s1⋅s2=ss_{1}\cdot s_{2}=s. By Theorem 4.4 and Lemma 5.1 the mapping φ0\varphi_{0} is a correctly defined bijection.

Let (Ω,S)(\Omega,S) be an equivalenced scheme satisfying conditions (17) and (20) for all u,v∈S#u,v\in S^{\#}, and φ:(Ω,S)→(Ω′,S′)\varphi:(\Omega,S)\to(\Omega^{\prime},S^{\prime}) an algebraic isomorphism. Then φ0\varphi_{0} is the (α0,α0′)(\alpha_{0},\alpha^{\prime}_{0})-extension of φ\varphi.

Proof. We observe that relations (29) hold by statement (2) of Theorem 4.1. Therefore it suffices to verify that

To do this take such relations bb and cc. Then there exist u,v,w∈S#u,v,w\in S^{\#} such that

By condition (20) one can find t∈D(u,v)∩D(v,w)∩D(w,u)t\in D(u,v)\cap D(v,w)\cap D(w,u). Since b∈S0b\in S_{0}, there exist a1∈S(u,t)a_{1}\in S(u,t) and a2∈S(t,v)a_{2}\in S(t,v) such that b=a1⋅a2b=a_{1}\cdot a_{2}. However, ∣S(u,t)∣=∣S(t,v)∣=k|S(u,t)|=|S(t,v)|=k. Therefore bφ0=a1φ0⋅a2φ0b^{\varphi_{0}}=a_{1}^{\varphi_{0}}\cdot a_{2}^{\varphi_{0}} (if ∣u∗v∣=k|u^{*}v|=k, then this follows from statement (2) of Theorem 4.1; otherwise this immediately follows from the definition of φ0\varphi_{0}). On the other hand, we have ∣S(v,t)∣=∣S(w,t)∣=k|S(v,t)|=|S(w,t)|=k. Therefore a2∗∈S(v,t)a_{2}^{*}\in S(v,t) and there exists a3∈S(t,w)a_{3}\in S(t,w) such that c=a2∗⋅a3c=a_{2}^{*}\cdot a_{3} (see Figure 7).

As above one can see that cφ0=(a2∗)φ0⋅a3φ0c^{\varphi_{0}}=(a_{2}^{*})^{\varphi_{0}}\cdot a_{3}^{\varphi_{0}} and that (a1⋅a3)φ0=(a1)φ0⋅a3φ0(a_{1}\cdot a_{3})^{\varphi_{0}}=(a_{1})^{\varphi_{0}}\cdot a_{3}^{\varphi_{0}}. Thus

Schurity and separability of equivalenced schemes

The conclusion of Theorem 4.4 gives a sufficient condition for a scheme to be schurian.

Let (Ω,S)(\Omega,S) be a scheme such that for each α∈Ω\alpha\in\Omega the coherent configuration (Ω,Sα)(\Omega,S_{\alpha}) is semiregular on Ω∖{α}\Omega\setminus\{\alpha\} and its fibers are αs\alpha s, s∈Ss\in S. Then (Ω,S)(\Omega,S) is a regular or Frobenius scheme.

Proof. Let α∈Ω\alpha\in\Omega. Then by Theorem 8.1 the coherent configuration (Ω,Sα)(\Omega,S_{\alpha}) is schurian, and hence due to (28) any set αs\alpha s, s∈Ss\in S, is the orbit of the group GαG_{\alpha} where G=Aut⁡(Ω,S)G=\operatorname{Aut}(\Omega,S). Since obviously Gα,β=id⁡ΩG_{\alpha,\beta}=\operatorname{id}_{\Omega} for all α≠β\alpha\neq\beta, it suffices to verify that the group GG is transitive. To do this we note that semiregularity of GαG_{\alpha} on Ω∖{α}\Omega\setminus\{\alpha\} implies that

Let Δ∈Orb⁡(G,Ω)\Delta\in\operatorname{Orb}(G,\Omega). Since any orbit of GG is a disjoint union of some orbits of the group GαG_{\alpha}, the number ∣Δ∣|\Delta| is divided by kk if and only if α∉Δ\alpha\not\in\Delta. However, this is impossible if Δ≠Ω\Delta\neq\Omega. Thus GG is transitive.

Let (Ω,S)(\Omega,S) be the scheme of an affine space A{\cal A}. Then from (10) it follows that D(u,v)=S#∖uvD(u,v)=S^{\#}\setminus uv for all u,v∈S#u,v\in S^{\#}. Therefore conditions (17) and (20) are satisfied whenever the dimension of A{\cal A} is at least 33. Thus in this case by Theorems 4.4 and 6.1 the scheme (Ω,S)(\Omega,S) is schurian. Since the scheme is imprimitive, its automorphism group is a Frobenius group in its natural permutation representation. Using properties of Frobenius groups one can prove, without using Veblen-Young Theorem, that the scheme (Ω,S)(\Omega,S) is an affine scheme of a Desarguesian affine space.

2. Separability.

Similarly to the previous subsection the conclusion of Theorem 5.2 gives a sufficient condition for a scheme to be separable.

In the condition of Theorem 6.1 the scheme (Ω,S)(\Omega,S) is separable.

Proof. From Theorem 5.2 it follows that any algebraic isomorphism φ:(Ω,S)→(Ω,S′)\varphi:(\Omega,S)\to(\Omega,S^{\prime}) has the (α,α′)(\alpha,\alpha^{\prime})-extension

for all (α,α′)∈Ω×Ω′(\alpha,\alpha^{\prime})\in\Omega\times\Omega^{\prime}. By Theorem 4.4 the coherent configuration (Ω,Sα)(\Omega,S_{\alpha}) is semiregular on Ω∖{α}\Omega\setminus\{\alpha\}, and hence is separable (Theorem 8.1). This implies that the algebraic isomorphism φα,α′\varphi_{\alpha,\alpha^{\prime}} is induced by an isomorphism. Due to the right-hand side of (29) this shows that the same isomorphism induces the algebraic isomorphism φ\varphi. Thus any algebraic isomorphism of the scheme (Ω,S)(\Omega,S) is induced by an isomorphism and hence this scheme is separable.

3. Pseudocyclic schemes

Let (Ω,S)(\Omega,S) be an equivalenced scheme of valency kk and indistinguishing number cc.

∣D‾(u,v)∣<ck3|\overline{D}(u,v)|<ck^{3}, u,v∈S#u,v\in S^{\#} where D‾(u,v)=S#∖D(u,v)\overline{D}(u,v)=S^{\#}\setminus D(u,v).

Proof. Let u,v∈S#u,v\in S^{\#}. Then it is easily seen that ∣uu∗ vv∗∣≤k3|uu^{*}\,vv^{*}|\leq k^{3}. Besides, given t∈uu∗ vv∗t\in uu^{*}\,vv^{*}, t∈S#t\in S^{\#}, there exist at most c(t)−1≤cc(t)-1\leq c relations w∈S#w\in S^{\#} such that t∈ww∗t\in ww^{*}. Thus for at most ck3ck^{3} relations ww the set (uu∗ vv∗)∩ww∗(uu^{*}\,vv^{*})\cap ww^{*} contains an element t∈S#t\in S^{\#}. This means that ∣D‾(u,v)∣<ck3|\overline{D}(u,v)|<ck^{3}.

Suppose that the scheme (Ω,S)(\Omega,S) is pseudocyclic. Then by Theorem 2.2 we have c=k−1c=k-1. If, in addition, ∣S∣≥4ck3|S|\geq 4ck^{3}, then by Lemma 6.3 conditions (17) and (20) are satisfied for all u,v∈S#u,v\in S^{\#}. By Theorem 4.4 this implies that given α∈Ω\alpha\in\Omega the α\alpha-extension of the scheme (Ω,S)(\Omega,S) is a semiregular coherent configuration on Ω∖{α}\Omega\setminus\{\alpha\} the fibers of which are αu\alpha u, u∈Su\in S. So by Theorems 6.1 and 6.2 we obtain the following statement.

Any pseudocyclic scheme of valency k>1k>1 and rank at least 4(k−1)k34(k-1)k^{3} is a separable Frobenius scheme.

Miscellaneous

Any commutative pseudocyclic scheme of of valency kk on nn points produces a 2−(n,k,k−1)2-(n,k,k-1)-design [5, Corollary 2.2.8]. The same is also true in the non-commutative case (Theorem 7.1). It would be interesting to study these designs in detail.

A scheme (Ω,S)(\Omega,S) on nn points is pseudocyclic of valency kk if and only if the pair (Ω,B)(\Omega,B) with B={αs:α∈Ω, s∈S#}B=\{\alpha s:\alpha\in\Omega,\ s\in S^{\#}\} is a 2−(n,k,k−1)2-(n,k,k-1)-design.

Proof. The pair (Ω,B)(\Omega,B) is an 2−(n,k,k−1)2-(n,k,k-1)-design if and only if ∣αs∣=k|\alpha s|=k for all α∈Ω\alpha\in\Omega and s∈S#s\in S^{\#}, and the number of blocks αs∈B\alpha s\in B containing two distinct points β,γ∈Ω\beta,\gamma\in\Omega coincides with k−1k-1. However, the number of these blocks is obviously equals c(s)c(s) where s=r(β,γ)s=r(\beta,\gamma). Thus the required statement follows from Theorem 2.2.

2.

It was proved in [12, Lemma 5.13] that a one point extension of an imprimitive equivalenced scheme is “almost semiregular”. The following statement shows that the imprimitivity condition can be removed for pseudocyclic schemes the rank of which is much more than the valency.

Let (Ω,S)(\Omega,S) be a pseudocyclic scheme of valency kk. Suppose that ∣S∣>2k(k−1)+2|S|>2k(k-1)+2. Then given α∈Ω\alpha\in\Omega the coherent configuration (Ω,Sα)(\Omega,S_{\alpha}) is semiregular on Ω∖{α}\Omega\setminus\{\alpha\}.

Proof. For a relation u∈S#u\in S^{\#} set E(u)={v∈S#: ∣u∗v∣=k}E(u)=\{v\in S^{\#}:\ |u^{*}v|=k\}. Since by Theorem 2.2 the indistinguishing number cc of the scheme (Ω,S)(\Omega,S) is k−1k-1, we have

By the theorem hypothesis this implies that

for all non-equal u,v∈S#u,v\in S^{\#}. Set S0={s∈Sα: s⊂Ω0×Ω0}S_{0}=\{s\in S_{\alpha}:\ s\subset\Omega_{0}\times\Omega_{0}\} where Ω0=Ω∖{α}\Omega_{0}=\Omega\setminus\{\alpha\}. To complete the proof it suffices to verify that each s0∈S0s_{0}\in S_{0} is contained in some s∈S0∪s\in S_{0}^{\cup} for which ∣βs∣≤1|\beta s|\leq 1 for all β∈Ω\beta\in\Omega. However, it is easy to see that given s0∈S0s_{0}\in S_{0} one can find u,v∈S#u,v\in S^{\#} such that

Due to (25) there exists w∈E(u)∩E(v)w\in E(u)\cap E(v). Since Sα(u,w)S_{\alpha}(u,w), Sα(w,v)⊂S0∪S_{\alpha}(w,v)\subset S_{0}^{\cup}, we have Sα(u,v;w)⊂S0∪S_{\alpha}(u,v;w)\subset S_{0}^{\cup}. Thus s0⊂ss_{0}\subset s for some s∈Sα(u,v;w)s\in S_{\alpha}(u,v;w). To complete the proof it suffices to note that ∣βs∣≤1|\beta s|\leq 1 for β∈Ω\beta\in\Omega.

In the condition of Theorem 7.2 for any point β∈Ω∖{α}\beta\in\Omega\setminus\{\alpha\} we have ∣βs∣≤1|\beta s|\leq 1 for all s∈Sαs\in S_{\alpha}. Therefore the scheme (Ω,Sα)(\Omega,S_{\alpha}) is 11-regular in the sense of . Thus by Theorem 9.3 of this paper we obtain the following statement.

In the condition of Theorem 7.2 any one point extension of the scheme (Ω,S)(\Omega,S) is schurian and separable.

We complete the subsection by making a remark that Corollary 7.3 together with [13, Theorem 4.6] shows that any pseudocyclic scheme of valency kk and rank O(k2)O(k^{2}) is 22-schurian and 22-separable in the sense of .

3. Affine schemes

The following characterization of the affine schemes was known in commutative case (see ).

Let (Ω,S)(\Omega,S) be a scheme with ns≥3n_{s}\geq 3 for each s∈S#s\in S^{\#}. Then it is the scheme of an affine space if and only if crst≤1c_{rs}^{t}\leq 1 for all r,s,t∈Sr,s,t\in S such that r≠s∗r\neq s^{*}.

Proof. The necessity follows from (10). To prove the sufficiency let s∈S#s\in S^{\#}. Then ∣ss∗∣>1|ss^{*}|>1 because ns>1n_{s}>1, and ss∗∩rr∗={1Ω}ss^{*}\cap rr^{*}=\{1_{\Omega}\} for all r≠sr\neq s (Lemma 8.3). Thus

This implies that there exists a bijection s↦s′s\mapsto s^{\prime} from S#S^{\#} to itself such that ss∗={1Ω,s′}ss^{*}=\{1_{\Omega},s^{\prime}\}. In particular, the scheme (Ω,S)(\Omega,S) is symmetric and cs′ss=ns−1≥2c_{s^{\prime}s}^{s}=n_{s}-1\geq 2. Therefore s′=ss^{\prime}=s for each s∈S#s\in S^{\#}. Thus each relation from SS is an equivalence relation minus a diagonal. All such schemes were classified in where it was proved that each of them is the scheme of an affine space.

4. QI-groups

5. The Terwilliger algebra of a pseudocyclic scheme

6. Equivalenced schemes with bounded indistinguishing number

Theorem 6.4 may be strengthened if we replace the condition of being pseudocyclic by bounding of an indistinguishing number of a scheme. Indeed, the argument used in the proof of Theorem 6.4 yields us that a kk-valenced scheme with indistinguishing number cc of rank at least ck3ck^{3} is a separable Frobenius scheme.

Schemes, coherent configurations and permutation groups

Let Ω\Omega be a finite set and SS a partition of Ω×Ω\Omega\times\Omega. Denote by S∪S^{\cup} the set of all unions of the elements of SS. A pair (Ω,S)(\Omega,S) is called a coherent configuration on Ω\Omega if the following conditions are satisfied:

the diagonal 1Ω1_{\Omega} of Ω×Ω\Omega\times\Omega belongs to S∪S^{\cup},

given r,s,t∈Sr,s,t\in S, the number crst=∣{β∈Ω: (α,β)∈r, (β,γ)∈s}∣c_{rs}^{t}=|\{\beta\in\Omega:\,(\alpha,\beta)\in r,\ (\beta,\gamma)\in s\}| does not depend on the choice of (α,γ)∈t(\alpha,\gamma)\in t.

The elements of Ω\Omega, SS, S∪S^{\cup} and the numbers (S3) are called the points, the basis relations, the relations and the intersection numbers of (Ω,S)(\Omega,S), respectively. The numbers ∣Ω∣|\Omega| and ∣S∣|S| are called the degree and rank of it. The unique basis relation containing a pair (α,β)∈Ω×Ω(\alpha,\beta)\in\Omega\times\Omega is denoted by r(α,β)r(\alpha,\beta). The set of basis relations contained in r⋅sr\cdot s with r,s∈S∪r,s\in S^{\cup} is denoted by rsrs.

2. Homogeneity.

The set Ω\Omega is the disjoint union of fibers of (Ω,S)(\Omega,S), i.e. those Δ⊂Ω\Delta\subset\Omega for which 1Δ∈S1_{\Delta}\in S. For any basis relation s∈Ss\in S there exist uniquely determined fibers Δ,Γ\Delta,\Gamma such that s⊂Δ×Γs\subset\Delta\times\Gamma. Moreover, the number ∣δs∣|\delta s| does not depend on δ∈Δ\delta\in\Delta and coincides with css∗tc_{ss^{*}}^{t} where t=1Δt=1_{\Delta}. We denote it by nsn_{s}. The coherent configuration (Ω,S)(\Omega,S) is called homogeneous or a scheme if Ω\Omega is a fiber of it. In this case

and the number nsn_{s} is called the valency of ss. We say that (Ω,S)(\Omega,S) is an equivalenced scheme of valency kk, when ns=kn_{s}=k for all s∈S#s\in S^{\#} where here and below we put S#=S∖{1Ω}S^{\#}=S\setminus\{1_{\Omega}\}.

3. Isomorphisms and schurity.

Two coherent configurations are called isomorphic if there exists a bijection between their point sets preserving the basis relations. Any such bijection is called an isomorphism of these coherent configurations. The group of all isomorphisms of a coherent configuration (Ω,S)(\Omega,S) contains a normal subgroup

called the automorphism group of (Ω,S)(\Omega,S). Conversely, let G≤Sym⁡(Ω)G\leq\operatorname{Sym}(\Omega) be a permutation group and SS the set of orbits of the componentwise action of GG on Ω×Ω\Omega\times\Omega. Then (Ω,S)(\Omega,S) is a coherent configuration and we call it the coherent configuration of GG. This coherent configuration is homogeneous if and only if the group is transitive; in this case we say that (Ω,S)(\Omega,S) is the scheme of GG. A coherent configuration on Ω\Omega is called schurian if it is the coherent configuration of 22-orbits of some permutation group on Ω\Omega.

4. Algebraic isomorphisms and separability.

Two coherent configurations (Ω,S)(\Omega,S) and (Ω′,S′)(\Omega^{\prime},S^{\prime}) are called algebraically isomorphic if

for some bijection φ:S→S′, r↦r′\varphi:S\to S^{\prime},\ r\mapsto r^{\prime} called an algebraic isomorphism from (Ω,S)(\Omega,S) to (Ω′,S′)(\Omega^{\prime},S^{\prime}). Each isomorphism ff from (Ω,S)(\Omega,S) to (Ω′,S′)(\Omega^{\prime},S^{\prime}) induces in a natural way an algebraic isomorphism between these schemes denoted by φf\varphi_{f}. The set of all isomorphisms inducing the algebraic isomorphism φ\varphi is denoted by Iso⁡(S,S′,φ)\operatorname{Iso}(S,S^{\prime},\varphi). In particular,

where id⁡S\operatorname{id}_{S} is the identical mapping on SS. A coherent configurations (Ω,S)(\Omega,S) is called separable if the set Iso⁡(S,S′,φ)\operatorname{Iso}(S,S^{\prime},\varphi) is non-empty for for each algebraic isomorphism φ\varphi.

5. Semiregularity.

A coherent configuration (Ω,S)(\Omega,S) is called semiregular if

A semiregular scheme is called regular; regular schemes are exactly thin schemes in the sense of . One can see that a coherent configuration (resp. scheme) is semiregular (resp. regular) if and only if it is a coherent configuration (resp. scheme) of a semiregular (resp. regular) permutation group. The proof of this statement as well as the next one can be found in .

Any semiregular configuration is schurian and separable.

6. One point extension.

Let (Ω,S)(\Omega,S) be a coherent configuration and α∈Ω\alpha\in\Omega. Denote by SαS_{\alpha} the set of basis relations of the smallest coherent configuration on Ω\Omega such that 1α∈Sα1_{\alpha}\in S_{\alpha} and S⊂Sα∪S\subset S_{\alpha}^{\cup} (see ). The coherent configuration (Ω,Sα)(\Omega,S_{\alpha}) is called the α\alpha-extension (or a one point extension) of (Ω,S)(\Omega,S). It is easily seen that

Notice that the set αs\alpha s is a union of some fibers of (Ω,Sα)(\Omega,S_{\alpha}) for all s∈Ss\in S, and the relation t∩(αr×αs)t\cap(\alpha r\times\alpha s) belongs to the set Sα∪S_{\alpha}^{\cup} for all r,s,t∈Sr,s,t\in S.

Let (Ω′,S′)(\Omega^{\prime},S^{\prime}) be a coherent configuration and φ:(Ω,S)→(Ω′,S′)\varphi:(\Omega,S)\to(\Omega^{\prime},S^{\prime}) an algebraic isomorphism. Let α′∈Ω′\alpha^{\prime}\in\Omega^{\prime} and ψ:(Ω,Sα)→(Ω,Sα′′)\psi:(\Omega,S_{\alpha})\to(\Omega,S^{\prime}_{\alpha^{\prime}}) be an algebraic isomorphism such that

where s~\widetilde{s} is the unique basis relation of (Ω,S)(\Omega,S) that contains ss. Then ψ\psi is uniquely determined by φ\varphi. We say that φα,α′:=ψ\varphi_{\alpha,\alpha^{\prime}}:=\psi is the (α,α′)(\alpha,\alpha^{\prime})-extension (or one point extension) of φ\varphi.

7. t𝑡t-condition.

The following definition goes back to [16, p.70]. Let (Ω,S)(\Omega,S) be a coherent configuration. Two sets Δ,Δ′⊂Ω\Delta,\Delta^{\prime}\subset\Omega have the same type with respect to the pair (α,β)∈Ω×Ω(\alpha,\beta)\in\Omega\times\Omega if α,β∈Δ∩Δ′\alpha,\beta\in\Delta\cap\Delta^{\prime} and there exists a bijection Δ→Δ′,δ↦δ′\Delta\to\Delta^{\prime},\delta\mapsto\delta^{\prime} such that α′=α\alpha^{\prime}=\alpha, β′=β\beta^{\prime}=\beta and

Let t≥2t\geq 2 be an integer. The coherent configuration (Ω,S)(\Omega,S) satisfies the tt-condition at a relation s∈S∪s\in S^{\cup} if for each k=2,…,tk=2,\ldots,t the number of kk-subsets of Ω\Omega of each fixed type with respect to the pair (α,β)∈s(\alpha,\beta)\in s does not depend on the choice of this pair. If the tt-condition is satisfied at each s∈Ss\in S, we say that (Ω,S)(\Omega,S) satisfies the tt-condition. It can be proved that the scheme on nn points is schurian if and only if it satisfies the tt-condition for all t=2,…,n−1t=2,\ldots,n-1.

8. Indistinguishing number.

Let (Ω,S)(\Omega,S) be a scheme. The indistinguishing number of a relation s∈Ss\in S is defined to be the number

The term goes back to [2, p.563] where the number n−c(s)n-c(s) with n=∣Ω∣n=|\Omega| was called the distinguishing number of ss. Clearly, c(1Ω)=nc(1_{\Omega})=n. The maximum of c(s)c(s), s∈S#s\in S^{\#}, is called the indistinguishing number of (Ω,S)(\Omega,S).

Let (Ω,S)(\Omega,S) be an equivalenced scheme of valency kk. Then the arithmetical mean of c(s)c(s), s∈S#s\in S^{\#}, equals k−1k-1.

Proof. Set n=∣Ω∣n=|\Omega|. Then ∣S#∣=(n−1)/k|S^{\#}|=(n-1)/k and ∣s∣=nk|s|=nk for all s∈S#s\in S^{\#}. Counting the number of Ω\Omega-triples (α,β,γ)(\alpha,\beta,\gamma) such that r(α,β)=r(α,γ)∈S#r(\alpha,\beta)=r(\alpha,\gamma)\in S^{\#} by two ways we obtain that

9. Adjacency algebra.

10. Intersection numbers.

There is a lot of useful identities for the intersection numbers of an arbitrary scheme . One of them is (32), another one is

Let (Ω,S)(\Omega,S) be a scheme and r,s∈S#r,s\in S^{\#}. Then cr∗st≤1c_{r^{*}s}^{t}\leq 1 for all t∈St\in S if and only if rr∗∩ss∗={1Ω}rr^{*}\cap ss^{*}=\{1_{\Omega}\}.

and the bound is attained if and only if rr∗∩ss∗={1Ω}rr^{*}\cap ss^{*}=\{1_{\Omega}\}, where ⟨rr∗,ss∗⟩=⟨A(r)A(r∗),A(s)A(s∗)⟩\langle rr^{*},ss^{*}\rangle=\langle A(r)A(r^{*}),A(s)A(s^{*})\rangle. Similarly, from (32) it follows that

and the bound is attained if and only if cr∗st≤1c_{r^{*}s}^{t}\leq 1 for all t∈St\in S. Since ⟨rr∗,ss∗⟩=⟨r∗s,r∗s⟩\langle rr^{*},ss^{*}\rangle=\langle r^{*}s,r^{*}s\rangle we are done.

11. Frobenius groups.

In this subsection we recall some well-known group theoretical facts on the Frobenius groups . A non-regular transitive permutation group G≤Sym⁡(Ω)G\leq\operatorname{Sym}(\Omega) is called a Frobenius group if Gα,β={id⁡Ω}G_{\alpha,\beta}=\{\operatorname{id}_{\Omega}\} for all non-equal points α,β∈Ω\alpha,\beta\in\Omega. Any Frobenius group GG has a uniquely determined regular normal subgroup AA called the kernel of GG. Therefore G=AKG=AK where KK is a one point stabilizer of GG, and GCD⁡(∣A∣,∣K∣)=1\operatorname{GCD}(|A|,|K|)=1.

Let G≤Sym⁡(Ω)G\leq\operatorname{Sym}(\Omega) be a finite non-regular transitive permutation group with point stabilizer KK and

the decomposition of the permutation character θ\theta of GG into irreducibles. Then GG is a Frobenius group if and only if χ(1)/mχ=∣K∣\chi(1)/m_{\chi}=|K| for each character χ∈Irr⁡(G)#\chi\in\operatorname{Irr}(G)^{\#} with mχ≠0m_{\chi}\neq 0.

Proof. To prove the necessity suppose that GG is a Frobenius group with a complement KK. Then from [18, p.318-319] it follows that given φ∈Irr⁡(K)#\varphi\in\operatorname{Irr}(K)^{\#} the class function χφ=φG−φ(1)θ′\chi_{\varphi}=\varphi^{G}-\varphi(1)\theta^{\prime} is an irreducible character of GG of degree φ(1)\varphi(1) and

where 1{\bf 1} and ρ\rho are the principal and regular characters of GG, and θ′=θ−1\theta^{\prime}=\theta-{\bf 1}. Since χφ∈Irr⁡(G)\chi_{\varphi}\in\operatorname{Irr}(G), we have [ρ,χφ]=χφ(1)=φ(1)[\rho,\chi_{\varphi}]=\chi_{\varphi}(1)=\varphi(1). Therefore by (34) we obtain

where Φ={1}∪{χφ: φ∈Irr⁡(K)#}\Phi=\{{\bf 1}\}\cup\{\chi_{\varphi}:\ \varphi\in\operatorname{Irr}(K)^{\#}\}. Thus χ(1)=∣K∣mχ\chi(1)=|K|m_{\chi} for each character χ∈Irr⁡(G)#\chi\in\operatorname{Irr}(G)^{\#} with mχ≠0m_{\chi}\neq 0.

To prove the sufficiency suppose that χ(1)/mχ=∣K∣\chi(1)/m_{\chi}=|K| for each non-principal character χ∈Irr⁡(G)\chi\in\operatorname{Irr}(G) with mχ≠0m_{\chi}\neq 0. Since ∑χmχ2=r−1\sum_{\chi}m_{\chi}^{2}=r-1 where r=∣Orb⁡(K)∣r=|\operatorname{Orb}(K)| (see [18, Th. 16.6.14]), we have

Therefore ∣K∣=(∣Ω∣−1)/(r−1)|K|=(|\Omega|-1)/(r-1). Since each non-trivial orbit of KK has cardinality at most ∣K∣|K| and there are r−1r-1 orbits, we obtain that each non-trivial KK-orbit has cardinality KK, that is Gα,β={id⁡Ω}G_{\alpha,\beta}=\{\operatorname{id}_{\Omega}\} whenever α≠β\alpha\neq\beta.

References