Skip to main content
SpringerLink
Log in

Factoring Groups Efficiently

  • Conference paper
Automata, Languages and Programming (ICALP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5555))

Included in the following conference series:

Abstract

We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B, if such a decomposition exists.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind, Toran: Solvable group isomorphism is (almost) in NP intersect coNP. In: Proceedings of the 19th Annual Conference on Computational Complexity, pp. 91–103 (2004)

    Google Scholar 

  2. Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: Proceedings of the 24th FOCS, pp. 162–171 (1979)

    Google Scholar 

  3. Babai, L., Seress, A., Luks, E.M.: Permutation groups in nc. In: Proceedings of 19th STOC, pp. 409–420 (1987)

    Google Scholar 

  4. Chen, L., Fu, B.: Linear and sublinear time algorithms for the basis of abelian groups. In: Electronic Colloquium on Computational Complexity, Technical report TR07-052 (2007)

    Google Scholar 

  5. Le Gall, F.: Efficient isomorphism testing for a class of group extensions. In: Proceedings of the annual Symposium on Theoretical Aspects of Computer Science (2009)

    Google Scholar 

  6. Herstein, I.N.: Topics in Algebra, 2nd edn. John Wiley & Sons, New York (1975)

    MATH  Google Scholar 

  7. Hulpke, A.: Gap project repository, http://www.math.colostate.edu/~hulpke/gapproj/projects.htm

  8. Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73. Springer, New York (1974)

    MATH  Google Scholar 

  9. Kantor, W.M.: Polynomial-time algorithms for finding elements of prime order and sylow subgroups. Journal of Algorithms 6, 478–514 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kantor, W.M.: Sylow’s theorem in polynomial time. J. Comp. Syst. Sci. 30, 359–394 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kantor, W.M.: Finding sylow normalizers in polynomial time. Journal of Algorithms 11, 523–563 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kavitha, T.: Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6), 986–996 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kantor, W.M., Taylor, D.E.: Polynomial-time versions of sylow’s theorem. Journal of Algorithms 9, 1–17 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  14. Luks, E.: Lectures on polynomial-time computation in groups, http://ix.cs.uoregon.edu/~luks

  15. Luks, E.M.: Computing the composition factors of a permutation group in polynomial time. Combinatorica 7, 87–99 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Miller, G.: On the nlog n isomorphism technique. In: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Lab India, 196/36 2nd Main, Sadashivanagar, Bangalore, 560080, India

    Neeraj Kayal

  2. Lehigh University, Pennsylvania, USA

    Timur Nezhmetdinov

Authors
  1. Neeraj Kayal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timur Nezhmetdinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer and Systems Sciences, Sapienza University of Rome, Via Ariosto 25, 00184, Roma, Italy

    Alberto Marchetti-Spaccamela

  3. Google R&D Center, School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yossi Matias

  4. University of Patras and CTI, N. Kazantzaki Street 1, 26504 Rion, Patras, Greece

    Sotiris Nikoletseas

  5. RWTH Aachen, Lehrstuhl Informatik 7, Ahornstraße 55, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kayal, N., Nezhmetdinov, T. (2009). Factoring Groups Efficiently. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02927-1_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02927-1_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02926-4

  • Online ISBN: 978-3-642-02927-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation