278 research outputs found
Structure computation and discrete logarithms in finite abelian p-groups
We present a generic algorithm for computing discrete logarithms in a finite
abelian p-group H, improving the Pohlig-Hellman algorithm and its
generalization to noncyclic groups by Teske. We then give a direct method to
compute a basis for H without using a relation matrix. The problem of computing
a basis for some or all of the Sylow p-subgroups of an arbitrary finite abelian
group G is addressed, yielding a Monte Carlo algorithm to compute the structure
of G using O(|G|^0.5) group operations. These results also improve generic
algorithms for extracting pth roots in G.Comment: 23 pages, minor edit
Algorithms for group isomorphism via group extensions and cohomology
The isomorphism problem for finite groups of order n (GpI) has long been
known to be solvable in time, but only recently were
polynomial-time algorithms designed for several interesting group classes.
Inspired by recent progress, we revisit the strategy for GpI via the extension
theory of groups.
The extension theory describes how a normal subgroup N is related to G/N via
G, and this naturally leads to a divide-and-conquer strategy that splits GpI
into two subproblems: one regarding group actions on other groups, and one
regarding group cohomology. When the normal subgroup N is abelian, this
strategy is well-known. Our first contribution is to extend this strategy to
handle the case when N is not necessarily abelian. This allows us to provide a
unified explanation of all recent polynomial-time algorithms for special group
classes.
Guided by this strategy, to make further progress on GpI, we consider
central-radical groups, proposed in Babai et al. (SODA 2011): the class of
groups such that G mod its center has no abelian normal subgroups. This class
is a natural extension of the group class considered by Babai et al. (ICALP
2012), namely those groups with no abelian normal subgroups. Following the
above strategy, we solve GpI in time for central-radical
groups, and in polynomial time for several prominent subclasses of
central-radical groups. We also solve GpI in time for
groups whose solvable normal subgroups are elementary abelian but not
necessarily central. As far as we are aware, this is the first time there have
been worst-case guarantees on a -time algorithm that tackles
both aspects of GpI---actions and cohomology---simultaneously.Comment: 54 pages + 14-page appendix. Significantly improved presentation,
with some new result
Finite covers of random 3-manifolds
A 3-manifold is Haken if it contains a topologically essential surface. The
Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite
fundamental group has a finite cover which is Haken. In this paper, we study
random 3-manifolds and their finite covers in an attempt to shed light on this
difficult question. In particular, we consider random Heegaard splittings by
gluing two handlebodies by the result of a random walk in the mapping class
group of a surface. For this model of random 3-manifold, we are able to compute
the probabilities that the resulting manifolds have finite covers of particular
kinds. Our results contrast with the analogous probabilities for groups coming
from random balanced presentations, giving quantitative theorems to the effect
that 3-manifold groups have many more finite quotients than random groups. The
next natural question is whether these covers have positive betti number. For
abelian covers of a fixed type over 3-manifolds of Heegaard genus 2, we show
that the probability of positive betti number is 0.
In fact, many of these questions boil down to questions about the mapping
class group. We are lead to consider the action of mapping class group of a
surface S on the set of quotients pi_1(S) -> Q. If Q is a simple group, we show
that if the genus of S is large, then this action is very mixing. In
particular, the action factors through the alternating group of each orbit.
This is analogous to Goldman's theorem that the action of the mapping class
group on the SU(2) character variety is ergodic.Comment: 60 pages; v2: minor changes. v3: minor changes; final versio
Unsolved Problems in Group Theory. The Kourovka Notebook
This is a collection of open problems in group theory proposed by hundreds of
mathematicians from all over the world. It has been published every 2-4 years
in Novosibirsk since 1965. This is the 19th edition, which contains 111 new
problems and a number of comments on about 1000 problems from the previous
editions.Comment: A few new solutions and references have been added or update
Generalised sifting in black-box groups
We present a generalisation of the sifting procedure introduced originally by
Sims for computation with finite permutation groups, and now used for many
computational procedures for groups, such as membership testing and finding
group orders. Our procedure is a Monte Carlo algorithm, and is presented and
analysed in the context of black-box groups. It is based on a chain of subsets
instead of a subgroup chain. Two general versions of the procedure are worked
out in detail, and applications are given for membership tests for several of
the sporadic simple groups.
Our major objective was that the procedures could be proved to be Monte Carlo
algorithms, and their costs computed. In addition we explicitly determined
suitable subset chains for six of the sporadic groups, and we implemented the
algorithms involving these chains in the {\sf GAP} computational algebra
system. It turns out that sample implementations perform well in practice. The
implementations will be made available publicly in the form of a {\sf GAP}
package
A new algorithm for fast generalized DFTs
We give an new arithmetic algorithm to compute the generalized Discrete
Fourier Transform (DFT) over finite groups . The new algorithm uses
operations to compute the generalized DFT over
finite groups of Lie type, including the linear, orthogonal, and symplectic
families and their variants, as well as all finite simple groups of Lie type.
Here is the exponent of matrix multiplication, so the exponent
is optimal if . Previously, "exponent one" algorithms
were known for supersolvable groups and the symmetric and alternating groups.
No exponent one algorithms were known (even under the assumption )
for families of linear groups of fixed dimension, and indeed the previous
best-known algorithm for had exponent despite being the focus
of significant effort. We unconditionally achieve exponent at most for
this group, and exponent one if . Our algorithm also yields an
improved exponent for computing the generalized DFT over general finite groups
, which beats the longstanding previous best upper bound, for any .
In particular, assuming , we achieve exponent , while the
previous best was
- …