The Influence of some embedding properties of subgroups on the structure of a finite group
Bibliographic record
Abstract
In a finite group $G$, a subgroup $H$ is called a $TI$-subgroup if $H$ intersects trivially with distinct conjugates of itself. Suppose that $H$ is a Hall $pi$-subgroup of $G$ which is also a $TI$-subgroup. A famous theorem of Frobenius states that $G$ has a normal $pi$-complement whenever $H$ is self normalizing. In this case, $H$ is called a Frobenius complement and $G$ is said to be a Frobenius group. A first main result in this thesis is the following generalization of Frobenius' Theorem. textbf{Theorem.}textit{ Let $H$ be a $TI$-subgroup of $G$ which is also a Hall subgroup of $N_G(H)$. Then $H$ has a normal complement in $N_G(H)$ if and only if $H$ has a normal complement in $G$. Moreover, if $H$ is nonnormal in $G$ and $H$ has a normal complement in $N_G(H)$ then $H$ is a Frobenius complement.} In the above configuration, the group $G$ need not be a Frobenius group, but the second part of the theorem guarantees the existence of a Frobenius group into which $H$ can be embedded as a Frobenius complement. Another contribution of this thesis is the following theorem, which extends a result of Gow (see Theorem ref{int gow}) to $pi$-separable groups. This result shows that the structure of a $pi$-separable group admitting a Hall $pi$-subgroup which is also a $TI$-subgroup is very restricted. textbf{Theorem.}textit{ Let $H$ be a nonnormal $TI$-subgroup of the $pi$-separable group $G$ where $pi$ is the set of primes dividing the order of $H$. Further assume that $H$ is a Hall subgroup of $N_G(H)$. Then the following hold:} textit{$a)$ $G$ has $pi$-length $1$ where $G=O_{pi'}(G)N_G(H)$;} textit{$b)$ there is an $H$-invariant section of $G$ on which the action of $H$ is Frobenius. This section can be chosen as a chief factor of $G$ whenever $O_{pi'}(G)$ is solvable;} textit{$c)$ $G$ is solvable if and only if $O_{pi'}(G)$ is solvable and $H$ does not involve a subgroup isomorphic to $SL(2,5)$.} In the last chapter we focus on giving alternative proofs without character theory for the following two solvability theorems due to Isaacs (cite{isa3}, Theorem 1 and Theorem 2). Our proofs depend on transfer theory and graph theory. textbf{Theorem.} textit{Let $G$ be a finite group having a cyclic Sylow $p$-subgroup. Assume that every $p'$-subgroup of $G$ is abelian. Then $G$ is either $p$-nilpotent or $p$-closed.} textbf{Theorem.} textit{Let G be a finite group and let $pneq 2$ and $q$ be primes dividing $
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.008 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".