2006
DOI: 10.37236/1076
|View full text |Cite
|
Sign up to set email alerts
|

$3$-Designs from PGL$(2,q)$

Abstract: The group PGL$(2,q)$, $q=p^n$, $p$ an odd prime, is $3$-transitive on the projective line and therefore it can be used to construct $3$-designs. In this paper, we determine the sizes of orbits from the action of PGL$(2,q)$ on the $k$-subsets of the projective line when $k$ is not congruent to $0$ and 1 modulo $p$. Consequently, we find all values of $\lambda$ for which there exist $3$-$(q+1,k,\lambda)$ designs admitting PGL$(2,q)$ as automorphism group. In the case $p\equiv 3$ mod 4, the results and some previ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 58 publications
(81 citation statements)
references
References 6 publications
(6 reference statements)
0
81
0
Order By: Relevance
“…Since T is not regular, T αβ ∼ = Z 2 , and so G αβ ≤ T . Thus N G (G αβ ) ∼ = D 8 by [3], so N G (G αβ ) = G α . Then there are no x ∈ N G (G α ) and y ∈ N G (G αβ ) such that G α , x, y = G, a contradiction.…”
Section: Proofmentioning
confidence: 95%
See 2 more Smart Citations
“…Since T is not regular, T αβ ∼ = Z 2 , and so G αβ ≤ T . Thus N G (G αβ ) ∼ = D 8 by [3], so N G (G αβ ) = G α . Then there are no x ∈ N G (G α ) and y ∈ N G (G αβ ) such that G α , x, y = G, a contradiction.…”
Section: Proofmentioning
confidence: 95%
“…Then G = PSL(2, p) or PGL (2, p). Inspecting subgroups of G listed in [13,Chapter II,8.27] and [3], G does not have subgroups isomorphic to S 4 ×S 2 . Thus, G α is isomorphic to one of S 3 , D 12 , and S 4 .…”
Section: Lemma 63 Let G Be Almost Simple With Socle Soc(g) = T Asmentioning
confidence: 99%
See 1 more Smart Citation
“…The forthcoming results exploit the following fairly known facts about PGL 2 (q) and PSL 2 (q) (for details we refer to [22] and [38]):…”
Section: Remark 51mentioning
confidence: 99%
“…These cases correspond to k = 4, 5, 6 in Theorem 3.2 by Cusack et al [10] and Omidi et al [22]; k = 4, 5, 6, 7 in Theorem 3.3 by Keranen et al [15] and Li et al [19,20]; k = 4, 5 in Theorem 3.4 by van Leijenhorst [26]. In particular, Cameron et al [7,8] considered all the cases of k ≡ 0, 1 (mod p) and p n ≡ 1, 3 (mod 4). Although the expressions of the lower bounds in Theorems 3.2-3.4 are lengthy, they generalize the above-mentioned known results and unify all the cases of 3 ≤ k ≤ q + 1.…”
Section: -Seeds From Pgl(2 Q) or Psl(2 Q)mentioning
confidence: 99%