Abstract
Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is\(n\left( {\left( {\begin{array}{*{20}c} {2n} \\ n \\ \end{array} } \right) + 2} \right)\). The number of all order-preserving selfmappings of a 2n-element crown is
Similar content being viewed by others
References
J. D. Currie and T. I. Visentin (1991) The number of order-preserving maps of fences and crowns,Order 8, 133–142.
D. Duffus, V. Rodl, B. Sands, and R. Woodrow, Enumeration of order-preserving maps, preprint.
L. Lovász (1979)Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest.
A. Rutkowski (1992) The formula for the number of order-preserving selfmappings of a fence,Order 9, 127–137.
N. Zaguia (1993) Isotone Maps: Enumeration and Structure, inFinite and Infinite Combinatorics in Sets and Logic (N. W. Saueret al. eds.), Kluwer Acad. Publ., NATO ASI, pp. 421–430.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Supported by KBN Contract 2 2037 92 03.
Rights and permissions
About this article
Cite this article
Parol, K., Rutkowski, A. Counting the number of isotone selfmappings of crowns. Order 10, 221–226 (1993). https://doi.org/10.1007/BF01110543
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01110543