Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T10:01:36.660Z Has data issue: false hasContentIssue false

Permutations with Confined Displacements

Published online by Cambridge University Press:  20 November 2018

N. S. Mendelsohn*
Affiliation:
University of Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A fundamental problem in combinatorial analysis is the classification of the permutations of 1, 2, …, n which satisfy a system of constraints. Thus one may ask such questions as how many permutations are there which have exactly r k-cycles; how many have at least s cycles regardless of cycle length. Again, one may ask how many permutations are there in which k ascending sequences appear; or how many permutations are there in which specified numbers may not appear in specified places or at specified distances from other numbers. The literature on these problems is quite extensive. References [1,2,5,7,10,14,17] give an indication of the present, status of these problems.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1961