5,908 research outputs found

    Finding involutions with small support

    Full text link
    We show that the proportion of permutations gg in SnS_n or AnA_n such that gg has even order and g∣g∣/2g^{|g|/2} is an involution with support of cardinality at most ⌈nε⌉\lceil n^\varepsilon \rceil is at least a constant multiple of ε\varepsilon. Using this result, we obtain the same conclusion for elements in a classical group of natural dimension nn in odd characteristic that have even order and power up to an involution with (−1)(-1)-eigenspace of dimension at most ⌈nε⌉\lceil n^\varepsilon \rceil for a linear or unitary group, or 2⌈⌊n/2⌋ε⌉2\lceil \lfloor n/2 \rfloor^\varepsilon \rceil for a symplectic or orthogonal group

    Finding involutions with small support

    Full text link
    We show that the proportion of permutations gg in SnS_n or AnA_n such that gg has even order and g∣g∣/2g^{|g|/2} is an involution with support of cardinality at most ⌈nε⌉\lceil n^\varepsilon \rceil is at least a constant multiple of ε\varepsilon. Using this result, we obtain the same conclusion for elements in a classical group of natural dimension nn in odd characteristic that have even order and power up to an involution with (−1)(-1)-eigenspace of dimension at most ⌈nε⌉\lceil n^\varepsilon \rceil for a linear or unitary group, or 2⌈⌊n/2⌋ε⌉2\lceil \lfloor n/2 \rfloor^\varepsilon \rceil for a symplectic or orthogonal group

    Algorithmic aspects of branched coverings

    Get PDF
    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
    • …
    corecore