Normalizers of Primitive Permutation Groups

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G| < n$ if $G$ is primitive unless $n = 3^{4}$, $5^4$, $3^8$, $5^8$, or $3^{16}$. This bound is sharp when $n$ is prime. In fact, when $G$ is primitive, $|\mathrm{Out}(G)| < n$ unless $G$ is a member of a given infinite sequence of primitive groups and $n$ is different from the previously listed integers. Many other results of this flavor are established not only for permutation groups but also for linear groups and Galois groups.Comment: 44 pages, grant numbers updated, referee's comments include

Computations for Coxeter arrangements and Solomon's descent algebra II: Groups of rank five and six

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear characters of centralizers of elements of $W$. Our refined conjecture relates the character above to a component of a decomposition of the regular character of $W$ related to Solomon's descent algebra of $W$. The refined conjecture has been proved for symmetric and dihedral groups, as well as finite Coxeter groups of rank three and four. In this paper, the second in a series of three dealing with groups of rank up to eight (and in particular, all exceptional Coxeter groups), we prove the conjecture for finite Coxeter groups of rank five and six, further developing the algorithmic tools described in the previous article. The techniques developed and implemented in this paper provide previously unknown decompositions of the regular and Orlik-Solomon characters of the groups considered.Comment: Final Version. 17 page

Algebraic curves with many automorphisms

Let $X$ be a (projective, geometrically irreducible, nonsingular) algebraic curve of genus $g \ge 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. Let $Aut(X)$ be the group of all automorphisms of $X$ which fix $K$ element-wise. It is known that if $|Aut(X)|\geq 8g^3$ then the $p$-rank (equivalently, the Hasse-Witt invariant) of $X$ is zero. This raises the problem of determining the (minimum-value) function $f(g)$ such that whenever $|Aut(X)|\geq f(g)$ then $X$ has zero $p$-rank. For {\em{even}} $g$ we prove that $f(g)\leq 900 g^2$. The {\em{odd}} genus case appears to be much more difficult although, for any genus $g\geq 2$, if $Aut(X)$ has a solvable subgroup $G$ such that $|G|>252 g^2$ then $X$ has zero $p$-rank and $G$ fixes a point of $X$. Our proofs use the Hurwitz genus formula and the Deuring Shafarevich formula together with a few deep results from finite group theory characterizing finite simple groups whose Sylow $2$-subgroups have a cyclic subgroup of index $2$. We also point out some connections with the Abhyankar conjecture and the Katz-Gabber covers

Products of conjugacy classes and fixed point spaces

We prove several results on products of conjugacy classes in finite simple groups. The first result is that there always exists a uniform generating triple. This result and other ideas are used to solve a 1966 conjecture of Peter Neumann about the existence of elements in an irreducible linear group with small fixed space. We also show that there always exist two conjugacy classes in a finite non-abelian simple group whose product contains every nontrivial element of the group. We use this to show that every element in a non-abelian finite simple group can be written as a product of two rth powers for any prime power r (in particular, a product of two squares).Comment: 44 page

Computational Group Theory

This was the seventh workshop on Computational Group Theory. It showed that Computational Group Theory has significantly expanded its range of activities. For example, symbolic computations with groups and their representations and computations with infinite groups play a major role nowadays. The talks also presented connections and applications to cryptography, number theory and the algorithmic theory of algebras

Using the Maple Computer Algebra System as a Tool for Studying Group Theory

The purpose of this study was to show that computers can be powerful tools for studying group theory. Specifically the author examined ways that the computer algebra system Maple can be used to assist in the study of group theory. The study consists of four main parts. After a brief introduction in chapter one, chapter two discusses simple procedures written by the author to study small finite groups. These procedures rely on the fact that for small finite groups, the elements can all be stored on a computer and tested for various properties. All of the procedures are contained in the appendix, and each is described in chapter two. The Maple software comes with a built in set of group theory procedures. The procedures work with two types of groups, permutation groups and finitely presented groups. The author discusses all of the procedures dealing with permutation groups in chapter three and the procedures for finitely presented groups in chapter four. The main theoretical tool for permutation groups is a stabilizer chain, and the main tool for finitely presented groups is the Todd-Coxeter algorithm. Both of these methods and their implementations in Maple are discussed in detail. The study is concluded by examining some applications of group theory. The author discusses check digit schemes, RSA encryption, and permutation factoring. The ability to factor a permutation in terms of a set of generators can be used to solve several puzzles such as the Rubik\u27s cube