Skip to main content

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups

  • Conference paper
  • 1287 Accesses

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

Abstract

Let G = 〈S〉 be a solvable subgroup of the symmetric group S n given as input by the generator set S. We give a deterministic polynomial-time algorithm that computes an expanding generator set of size Õ(n 2) for G. As a byproduct of our proof, we obtain a new explicit construction of ε-bias spaces of size Õ\((n{\rm poly}({\rm log} d))({{1}\over{\varepsilon}})^{O(1)}\) for the groups \(\mathbb{Z}_d^n\).

Keywords

  • Normal Subgroup
  • Permutation Group
  • Cayley Graph
  • Quotient Group
  • Solvable Group

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Iwaniec, H., Komlós, J., Pintz, J., Szemerédi, E.: Construction of a thin set with small Fourier coeffciients. Bull. London Math. Soc. 22, 583–590 (1990)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2), 509–516 (1992)

    CrossRef  MATH  Google Scholar 

  3. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289–304 (1992)

    CrossRef  MATH  Google Scholar 

  4. Alon, N., Roichman, Y.: Random Cayley Graphs and Expanders. Random Struct. Algorithms 5(2), 271–285 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Arvind, V., Mukhopadhyay, P., Nimbhorkar, P.: Erdös-Rényi Sequences and Deterministic construction of Expanding Cayley Graphs. Electronic Colloquium on Computational Complexity (ECCC) 18, 81 (2011)

    Google Scholar 

  6. Arvind, V., Mukhopadhyay, P., Nimbhorkar, P., Vasudev, Y.: Expanding generator sets for solvable permutation groups. Electronic Colloquium on Computational Complexity (ECCC) 18, 140 (2011)

    Google Scholar 

  7. Azar, Y., Motwani, R., Naor, J.: Approximating Probability Distributions Using Small Sample Spaces. Combinatorica 18(2), 151–171 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: STOC, pp. 164–174 (1991)

    Google Scholar 

  9. Dixon, J.D.: The solvable length of a solvable linear group. Mathematische Zeitschrift 107, 151–158 (1968), doi:10.1007/BF01111027

    CrossRef  MathSciNet  Google Scholar 

  10. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439–561 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Lubotzky, A., Weiss, B.: Groups and expanders. In: Friedman, J. (ed.) Expanding Graphs. DIMACS Ser. Discrete Math. Theoret. Compt. Sci, vol. 10, pp. 95–109 (1993)

    Google Scholar 

  12. Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261–277 (1988)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Luks, E.M.: Permutation groups and polynomial-time computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139–175 (1993)

    Google Scholar 

  14. Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17:1–17:24 (2008)

    CrossRef  MathSciNet  Google Scholar 

  15. Reingold, O., Vadhan, S.P., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: FOCS, pp. 3–13 (2000)

    Google Scholar 

  16. Rozenman, E., Vadhan, S.P.: Derandomized Squaring of Graphs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 436–447. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  17. Wigderson, A., Xiao, D.: Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory of Computing 4(1), 53–76 (2008)

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, V., Mukhopadhyay, P., Nimbhorkar, P., Vasudev, Y. (2012). Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)