2016
DOI: 10.1002/jcd.21526
|View full text |Cite
|
Sign up to set email alerts
|

New Regular Parallelisms of PG(3, 5)

Abstract: We construct all regular parallelisms of PG(3,5) with automorphisms of order 3. Their number is 8. The two cyclic parallelisms found by Prince are among them. The other six ones are the first examples of noncyclic regular parallelisms and the first examples of regular parallelisms that do not belong to the infinite families of Penttila and Williams.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…The method is suitable for resolutions of designs with big automorphism groups. It was developed and to be useful in connection with problems concerning classification of parallelisms of P G(3, 4) and P G(3, 5) with predefined automorphisms [20], [19], [21], [22]. The advantages of the present method in these cases are based on the fact that the considered resolutions possess predefined automorphisms and this algorithm uses the predefined groups, while general purpose algorithms do not.…”
Section: Algorithm 2 Construction Of a Necessary Set Of Conjugatesmentioning
confidence: 99%
See 3 more Smart Citations
“…The method is suitable for resolutions of designs with big automorphism groups. It was developed and to be useful in connection with problems concerning classification of parallelisms of P G(3, 4) and P G(3, 5) with predefined automorphisms [20], [19], [21], [22]. The advantages of the present method in these cases are based on the fact that the considered resolutions possess predefined automorphisms and this algorithm uses the predefined groups, while general purpose algorithms do not.…”
Section: Algorithm 2 Construction Of a Necessary Set Of Conjugatesmentioning
confidence: 99%
“…Since not many different types of parallelisms are known, computer-aided constructions are of particular interest. A great deal of the computer-aided investigations imply classifications of t-parallelisms with predefined automorphism groups [12], [13], [14], [15], [17], [18], [20], [19], [21], [22], [23]. In all these works the authors use the normalizer of the constructive automorphism group in order to filter away isomorphic parallelisms.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…by specifying the ground field or by adding topological conditions. Recent contributions in this spirit are [2], [3], and [27]; see also the references at the end of Section 2. In the present article we are concerned with regular parallelisms, that is, parallelisms that are made from regular spreads.…”
Section: Introductionmentioning
confidence: 99%