Net in finite geometry

From Encyclopedia of Mathematics
Revision as of 16:58, 1 July 2020 by Maximilian Janisch (talk | contribs) (AUTOMATIC EDIT (latexlist): Replaced 48 formulas out of 48 by TEX code with an average confidence of 2.0 and a minimal confidence of 2.0.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


In the language of design theory (cf. Block design and the links given there), a net of order $s$, degree $r$ and index $\mu$ (for short, an $( s , r , \mu )$-net) is the same as an affine resolvable $1 - ( s ^ { 2 } \mu , s \mu , r )$-design (see Tactical configuration; Affine design). Thus, it is an incidence structure $\mathcal{D} = ( V , \mathcal{B} )$ for which the set of blocks $\mathcal{B}$ is partitioned into parallel classes each of which in turn partitions the point set $V$, and such that any two non-parallel blocks intersect in exactly $\mu$ points. Moreover, there are $r \geq 3$ parallel classes each consisting of $s$ blocks; then each block has $k = s \mu$ points. The dual of an $( s , r , \mu )$-net is called a transversal design (denoted a $\operatorname{TD} _ { \mu } [ r , s ]$); in this setting, the parallel classes of blocks of a net become the point classes of the transversal design. In a more combinatorial language, a net is also equivalent to an orthogonal array of strength $t = 2$. For detailed studies of nets, transversal designs and orthogonal arrays, see [a1] and [a3].

Any net $\mathcal{D}$ satisfies the inequality

\begin{equation} \tag{a1} r \leq \frac { s ^ { 2 } \mu - 1 } { \mu - 1 }, \end{equation}

and equality holds if and only the net is an (affine) $2$-design; then $\mathcal{D}$ is also called a complete net. If the dual transversal design is also resolvable (that is, if "not being joined" induces an equivalence relation on the point set of $\mathcal{D}$), a stronger bound holds, namely $r \leq s \mu$; in the case of equality (in which case the dual of $\mathcal{D}$ is again an $( s , s \mu ; \mu$-net), it is referred to as a symmetric net (or a symmetric transversal design). The classical examples for complete nets are the affine designs $A G _ { d -1} ( d , q )$ formed by the points and hyperplanes of the $d$-dimensional finite affine spaces $A G ( d , q )$ (cf. also Affine space) over the Galois field $\operatorname {GF} ( q )$ of order $q$ (so $q$ is a prime power here); and the classical symmetric nets can be obtained from the complete ones by omitting all hyperplanes parallel to some selected line.

As of 2001, the outstanding problem in this area is the determination of the triples $( s , r , \mu )$ for which an $( s , r , \mu )$-net exists. This problem is exceedingly difficult; for instance, it includes the famous problem of deciding whether or not a projective plane of order not a prime power exists, and, more generally, the existence problem for affine designs (cf. also Affine design). Many constructions and a thorough discussion of the existence problem can be found in [a1], and an extensive set of tables is given in [a2].

In general, a net is not characterized just by its parameters. For instance, the number of non-isomorphic nets with the same parameters as $A G _ { d -1} ( d , q )$ grows exponentially with a growth rate of at least $e ^ { k .\operatorname { ln } k }$, where $k = q ^ { d - 1 }$, and a similar assertion holds for symmetric nets. Hence, it is desirable to characterize the classical examples among the complete and symmetric nets. For instance, a symmetric net $\mathcal{D}$ with $\mu > 1$ and $s > 2$ in which every line (that is, the intersection of all blocks through two given points) has cardinality $s$ is isomorphic to a classical example; see Affine design for similar results in the complete case. There is also considerable interest in nets with "nice" automorphism groups, for instance in translation nets, a generalization of the well-known translation planes (cf. Plane). As a further example, any generalized Hadamard matrix (see Hadamard matrix) is equivalent to a "class-regular" symmetric net. These topics are discussed in detail in [a1], see also [a4].

The case $\mu = 1$ has received particular attention. An $( s , r , 1 )$-net is often called a Bruck net and is simply referred to as an $( s , r )$-net. Here the dual structure is denoted by $\operatorname{TD} [ r , s ]$ (see also Transversal system) and the corresponding orthogonal arrays are equivalent to sets of mutually orthogonal Latin squares. The Bruck nets satisfying the bound (a1) with equality are precisely the affine planes of order $s$ (see also Affine space; Plane). An $( s , r )$-net is called maximal if it cannot be extended to an $( s , r + 1 )$-net by adding a new parallel class of lines. Any candidate for a new line necessarily is an $s$-set of points which meets every existing line in a unique point; such a set is called a transversal. Many known constructions of maximal nets actually yield transversal-free nets. A related problem is deciding whether or not a given net is maximal, and to find conditions guaranteeing that nets may be extended to larger nets. There is also considerable interest in determining the spectrum of all pairs $( s , r )$ for which a maximal $( s , r )$-net exists, a problem even harder than the existence problem discussed above and in Orthogonal Latin squares. See [a1] for a detailed study of all these topics and [a2] for an extensive set of tables. For a survey emphasizing the geometric properties of nets as well as their automorphism groups, see [a4].


[a1] T. Beth, D. Jungnickel, H. Lenz, "Design theory" , Cambridge Univ. Press (1999) (Edition: Second)
[a2] C.J. Colbourn, J.H. Dinitz, "The CRC handbook of combinatorial designs" , CRC (1996)
[a3] A.S. Hedayat, N.J.A. Sloane, J. Stufken, "Orthogonal arrays" , Springer (1999)
[a4] D. Jungnickel, "Latin squares, their geometries and their groups" D.K. Ray-Chaudhuri (ed.) , Coding Theory and Design Theory Part II , Springer (1990) pp. 166–225
How to Cite This Entry:
Net in finite geometry. Encyclopedia of Mathematics. URL:
This article was adapted from an original article by Dieter Jungnickel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article