1,112 research outputs found
Symmetries and reversing symmetries of polynomial automorphisms of the plane
The polynomial automorphisms of the affine plane over a field K form a group
which has the structure of an amalgamated free product. This well-known
algebraic structure can be used to determine some key results about the
symmetry and reversing symmetry groups of a given polynomial automorphism.Comment: 27 pages, AMS-Late
Base sizes for primitive groups with soluble stabilisers
Let be a finite primitive permutation group on a set with point
stabiliser . Recall that a subset of is a base for if its
pointwise stabiliser is trivial. We define the base size of , denoted
, to be the minimal size of a base for . Determining the base size
of a group is a fundamental problem in permutation group theory, with a long
history stretching back to the 19th century. Here one of our main motivations
is a theorem of Seress from 1996, which states that if
is soluble. In this paper we extend Seress' result by proving that for all finite primitive groups with a soluble point
stabiliser . This bound is best possible. We also determine the exact base
size for all almost simple groups and we study random bases in this setting.
For example, we prove that the probability that random elements in
form a base tends to as tends to infinity.Comment: 43 pages; to appear in Algebra and Number Theor
Some constant weight codes from primitive permutation groups
In recent years the detailed study of the construction of constant weight codes has been extended from length at most 28 to lengths less than 64. Andries Brouwer maintains web pages with tables of the best known constant weight codes of these lengths. In many cases the codes have more codewords than the best code in the literature, and are not particularly easy to improve. Many of the codes are constructed using a specified permutation group as automorphism group. The groups used include cyclic, quasi-cyclic, affine general linear groups etc. sometimes with fixed points. The precise rationale for the choice of groups is not clear.
In this paper the choice of groups is made systematic by the use of the classification of primitive permutation groups. Together with several improved techniques for finding a maximum clique, this has led to the construction of 39 improved constant weight codes
- …