Translation nets: A survey
From MaRDI portal
Publication:1199606
DOI10.1016/0012-365X(92)90550-YzbMath0797.05022MaRDI QIDQ1199606
Dirk Hachenberger, Dieter Jungnickel
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Finite partial geometries (general), nets, partial spreads (51E14) Other finite incidence structures (geometric aspects) (51E30) Research exposition (monographs, survey articles) pertaining to geometry (51-02)
Related Items
Groups admitting a Kantor family and a factorized normal subgroup, Multiple factorizations of cyclic groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Translation nets and fixed-point-free group automorphisms
- Bruck nets with a transitive direction
- Maximal partial spreads and translation nets of small deficiency
- Groups with a large number of large disjoint subgroups
- Existence results for translation nets. II
- Bruck nets, codes, and characters of loops
- Maximal sets of mutually orthogonal Latin squares. I
- Improvement of Bruck's completion theorem
- Constructions of large translation nets with nonabelian translation groups
- Maximal sets of mutually orthogonal Latin squares. II
- On the existence of translation nets
- Maximal partial spreads and transversal-free translation nets
- Collineations and extensions of translation nets
- Blocking sets and partial spreads in finite projective spaces
- Hadamard difference sets in groups of order 64
- Nets with critical deficiency
- Unimbeddable nets of small deficiency
- Finite nets. II: Uniqueness and imbedding
- Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
- Partial Spreads and Replaceable Nets
- Finite Nets, I. Numerical Invariants
- The Construction of Orthogonal Latin Squares
- On a combinatorial problem in group theory
