Skip to main content
SpringerLink
Log in

A note on permutations without runs of given length

  • Research papers
  • Published:
Aequationes mathematicae Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Abramson, M. andMoser, W. O. J.,Permutations without rising or falling w-sequences. Ann. Math. Statist.38 (1967), 1245–1254.

    Article  MathSciNet  MATH  Google Scholar 

  2. Riordan, J.,Permutations without 3-sequences. Bull. Amer. Math. Soc.51 (1945), 745–748.

    Article  MathSciNet  MATH  Google Scholar 

  3. Riordan, J.,Introduction to Combinatorial Analysis. Wiley, New York, 1958 (page 50).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada

    D. M. Jackson & R. C. Read

Authors
  1. D. M. Jackson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. C. Read
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Research Council of Canada grants A8235 and A8142.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jackson, D.M., Read, R.C. A note on permutations without runs of given length. Aequat. Math. 17, 336–343 (1978). https://doi.org/10.1007/BF01818572

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01818572

AMS (1970) subject classification

Search

Navigation