The formula for the number of order-preserving selfmappings of a fence

DOI10.1007/BF00814405zbMath0773.06007MaRDI QIDQ1803663

Aleksander Rutkowski

Publication date: 29 June 1993

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

partitionfenceorder-preserving selfmappingsstrictly increasing mapping

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Related Items (11)

The number of order-preserving maps between fences and crowns ⋮ The rank of the inverse semigroup of partial automorphisms on a finite fence ⋮ Generating sets of an infinite semigroup of transformations preserving a zig-zag order ⋮ On the semigroup of all partial fence-preserving injections on a finite set ⋮ The rank of the inverse semigroup of all partial automorphisms on a finite crown ⋮ Congruences on infinite semigroups of transformations preserving a zig-zag order ⋮ Regularity of semigroups of transformations with restricted range preserving an alternating orientation order ⋮ The rank of the semigroup of all order-preserving transformations on a finite fence ⋮ Regularity in the semigroup of transformations preserving a zig-zag order ⋮ Regular semigroups of partial transformations preserving a fence N ⋮ Counting the number of isotone selfmappings of crowns

Cites Work

• The number of order-preserving maps of fences and crowns
• Enumeration of order preserving maps
• The number of strictly increasing mappings of fences
• Unnamed Item
• Unnamed Item

This page was built for publication: The formula for the number of order-preserving selfmappings of a fence