Skip to main content

The Symmetric Group as a Polynomial Space

  • Conference paper

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 50))

Abstract

A design in a polynomial space is a natural generalisation of the concepts of design and orthogonal array in design theory. In this paper we further develop the second author’s theory of polynomial spaces. As a consequence we prove that a subgroup of the symmetric group is a t-design if and only it is t-transitive.

Support from the N. Z. Lottery grants Board and the Aukland University Research Committee is gratefully acknowledged.

Support from grant OGP0093041 of the National Sciences and Engineering Research Council of Canada is gratefully acknowledged.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. J. Cameron, M. Deza and P. Frankl, Sharp sets of permutations, J. Algebra, 111 (1987), pp. 220–247.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. J. Collins, Representations and Characters of Finite Groups, Cambridge U. P. (Cambridge) 1990.

    MATH  Google Scholar 

  3. C. D. Godsil, Polynomial spaces, Discrete Math. 73 (1988/89), pp. 71–88.

    Google Scholar 

  4. C. D. Godsil, Q-Polynomial spaces, submitted.

    Google Scholar 

  5. G. James and A. Kerber, The Representation Theory of the Symmetric Group, Addison-Wesley (Reading, Massachusetts) 1981.

    MATH  Google Scholar 

  6. R. Mathon, Bounds for equidistant permutation arrays of index one, in Combinatorial Mathematics: Proceedings of the the Third International Conference. Eds. G. S. Bloom, R. L. Graham, J. Malkevitch, Annals N. Y. Acad. Sci. Vol. 555 (1989).

    Google Scholar 

  7. M. Newman, Integral Matrices, Academic Press (New York) 1972.

    MATH  Google Scholar 

  8. D. K. Ray-Chaudhuri and R. M. Wilson, On t-designs, Osaka J. Math. 12 (1975), pp. 737–744.

    MathSciNet  MATH  Google Scholar 

  9. G. H. J. van Rees and S. A. Vanstone, Equidistant permutation arrays: a bound, J. Austral. Math. Soc. (Series A) 33 (1982), pp. 262–274.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Conder, M., Godsil, C.D. (1993). The Symmetric Group as a Polynomial Space. In: Brualdi, R.A., Friedland, S., Klee, V. (eds) Combinatorial and Graph-Theoretical Problems in Linear Algebra. The IMA Volumes in Mathematics and its Applications, vol 50. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8354-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-8354-3_12

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-8356-7

  • Online ISBN: 978-1-4613-8354-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics