974 research outputs found
Algorithmic aspects of branched coverings
This is the announcement, and the long summary, of a series of articles on
the algorithmic study of Thurston maps. We describe branched coverings of the
sphere in terms of group-theoretical objects called bisets, and develop a
theory of decompositions of bisets.
We introduce a canonical "Levy" decomposition of an arbitrary Thurston map
into homeomorphisms, metrically-expanding maps and maps doubly covered by torus
endomorphisms. The homeomorphisms decompose themselves into finite-order and
pseudo-Anosov maps, and the expanding maps decompose themselves into rational
maps.
As an outcome, we prove that it is decidable when two Thurston maps are
equivalent. We also show that the decompositions above are computable, both in
theory and in practice.Comment: 60-page announcement of 5-part text, to apper in Ann. Fac. Sci.
Toulouse. Minor typos corrected, and major rewrite of section 7.8, which was
studying a different map than claime
Parallel algorithms for solvable permutation groups
AbstractA number of basic problems involving solvable and nilpotent permutation groups are shown to have fast parallel solutions. Testing solvability is in NC as well as, for solvable groups, finding order, testing membership, finding centralizers, finding centers, finding the derived series and finding a composition series. Additionally, for nilpotent groups, one can, in NC, find a central composition series, and find pointwise stabilizers of sets. The latter is applied to an instance of graph isomorphism. A useful tool is the observation that the problem of finding the smallest subspace containing a given set of vectors and closed under a given set of linear transformations (all over a small field) belongs to NC
- …