5,739 research outputs found
Efficient Isomorphism Testing for a Class of Group Extensions
The group isomorphism problem asks whether two given groups are isomorphic or
not. Whereas the case where both groups are abelian is well understood and can
be solved efficiently, very little is known about the complexity of isomorphism
testing for nonabelian groups. In this paper we study this problem for a class
of groups corresponding to one of the simplest ways of constructing nonabelian
groups from abelian groups: the groups that are extensions of an abelian group
A by a cyclic group of order m. We present an efficient algorithm solving the
group isomorphism problem for all the groups of this class such that the order
of A is coprime with m. More precisely, our algorithm runs in time almost
linear in the orders of the input groups and works in the general setting where
the groups are given as black-boxes.Comment: 17 pages, accepted to the STACS 2009 conferenc
An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups
are isomorphic. Whereas the case where both groups are abelian is well
understood and can be solved efficiently, very little is known about the
complexity of isomorphism testing for nonabelian groups. Le Gall has
constructed an efficient classical algorithm for a class of groups
corresponding to one of the most natural ways of constructing nonabelian groups
from abelian groups: the groups that are extensions of an abelian group by
a cyclic group with the order of coprime with . More precisely,
the running time of that algorithm is almost linear in the order of the input
groups. In this paper we present a quantum algorithm solving the same problem
in time polynomial in the logarithm of the order of the input groups. This
algorithm works in the black-box setting and is the first quantum algorithm
solving instances of the nonabelian group isomorphism problem exponentially
faster than the best known classical algorithms.Comment: 20 pages; this is the full version of a paper that will appear in the
Proceedings of the 27th International Symposium on Theoretical Aspects of
Computer Science (STACS 2010
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism testing for nonabelian
groups. Le Gall has constructed an efficient classical algorithm for a class of groups corresponding to one of the most natural ways of constructing nonabelian groups from abelian groups: the groups that are extensions of an abelian group by a cyclic group with the order of coprime with .
More precisely, the running time of that algorithm is almost linear in the order of the input groups.
In this paper we present a emph{quantum} algorithm solving the same problem in time polynomial in the emph{logarithm} of the order of the input groups. This algorithm works in the black-box setting and is the first quantum algorithm solving instances of the nonabelian group isomorphism problem exponentially faster than the best known classical algorithms
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
Tabulation of cubic function fields via polynomial binary cubic forms
We present a method for tabulating all cubic function fields over
whose discriminant has either odd degree or even degree
and the leading coefficient of is a non-square in , up
to a given bound on the degree of . Our method is based on a
generalization of Belabas' method for tabulating cubic number fields. The main
theoretical ingredient is a generalization of a theorem of Davenport and
Heilbronn to cubic function fields, along with a reduction theory for binary
cubic forms that provides an efficient way to compute equivalence classes of
binary cubic forms. The algorithm requires field operations as . The algorithm, examples and numerical data for
are included.Comment: 30 pages, minor typos corrected, extra table entries added, revamped
complexity analysis of the algorithm. To appear in Mathematics of Computatio
- …