Singer Groups

1970 ◽  
Vol 22 (3) ◽  
pp. 492-513 ◽  
Author(s):  
Marshall D. Hestenes
Keyword(s):  
Projective Space ◽  
Systematic Study ◽  
Geometric Property ◽  
Difference Sets ◽  
Permutation Groups ◽  
Linear Groups ◽  
Singer Group ◽  
Singer Groups

Interest in the Singer groups has arisen in various places. The name itself results from the connection Singer [7] made between these groups and perfect difference sets, and this is closely associated with the geometric property that a Singer group is regular on the points of a projective space. Some information about these groups appears in Huppert's book [3, p. 187]. Singer groups are frequently useful in constructing examples and counterexamples. Our aim in this paper is to make a systematic study of the Singer subgroups of the linear groups, with a particular view to analyzing the examples they provide of Frobenius regular groups. Frobenius regular groups are a class of permutation groups generalizing the Zassenhaus groups, and Keller [5] has shown recently that they provide a new characterization of A6 and M11.

scholarly journals On the Orbits of Singer Groups and Their Subgroups

10.37236/1632 ◽  
2001 ◽  
Vol 9 (1) ◽  
Author(s):  
Keldon Drudge
Keyword(s):  
The Other ◽  
Permutation Groups ◽  
Projective Geometries ◽  
Other Hand ◽  
Singer Group ◽  
Singer Groups ◽  
Group Covers

We study the action of Singer groups of projective geometries (and their subgroups) on $(d-1)$-flats for arbitrary $d$. The possibilities which can occur are determined, and a formula for the number of orbits of each possible size is given. Motivated by an old problem of J.R. Isbell on the existence of certain permutation groups we pose the problem of determining, for given $q$ and $h$, the maximum co-dimension $f_q(n, h)$ of a flat of $PG(n-1, q)$ whose orbit under a subgroup of index $h$ of some Singer group covers all points of $PG(n-1, q)$. It is clear that $f_q (n, h) < n - \log_q (h)$; on the other hand we show that $f_q(n, h) \geq n - 1 - 2 \log _q (h)$.

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

scholarly journals Characterization of quadric cones in a Galois projective space

2000 ◽  
Vol 218 (1-3) ◽  
pp. 25-31 ◽  
Author(s):  
Rossella Di Monte ◽  
Osvaldo Ferri ◽  
Stefania Ferri
Keyword(s):  
Projective Space

scholarly journals Affine Primitive Groups and Semisymmetric Graphs

10.37236/2549 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Hua Han ◽  
Zaiping Lu
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Infinite Family ◽  
Permutation Groups ◽  
Primitive Groups ◽  
The Third ◽  
Semisymmetric Graphs

In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization,of the complete bipartite graph $K_{p^{sp^t},p^{sp^t}}$ into connected semisymmetric graphs, where $p$ is an prime, $1\le t\le s$ with $s\ge2$ while $p=2$.

Compatible Tight Riesz Orders

1976 ◽  
Vol 28 (1) ◽  
pp. 186-200 ◽  
Author(s):  
A. M. W. Glass
Keyword(s):  
Geometric Characterization ◽  
Permutation Groups ◽  
Algebraic Characterization ◽  
Partially Ordered ◽  
Ordered Field ◽  
Ordered Groups

N. R. Reilly has obtained an algebraic characterization of the compatible tight Riesz orders that can be supported by certain partially ordered groups [13; 14]. The purpose of this paper is to give a “geometric“ characterization by the use of ordered permutation groups. Our restrictions on the partially ordered groups will likewise be geometric rather than algebraic. Davis and Bolz [3] have done some work on groups of all order-preserving permutations of a totally ordered field; from our more general theorems, we will be able to recapture their results.

scholarly journals Geometric applications of critical point theory to submanifolds of complex projective space

1974 ◽  
Vol 55 ◽  
pp. 5-31 ◽  
Author(s):  
Thomas E. Cecil
Keyword(s):  
Projective Space ◽  
Critical Point ◽  
Distance Function ◽  
Complex Projective Space ◽  
Euclidean Distance ◽  
Point Theory ◽  
Euclidean Distance Function ◽  
Complex Projective ◽  
Class Of Functions

In a recent paper, [6], Nomizu and Rodriguez found a geometric characterization of umbilical submanifolds Mn ⊂ Rn+p in terms of the critical point behavior of a certain class of functions Lp, p ⊂ Rn+p, on Mn. In that case, if p ⊂ Rn+p, x ⊂ Mn, then Lp(x) = (d(x,p))2, where d is the Euclidean distance function.

Sign in / Sign up

Export Citation Format

Share Document