The formula for the number of order-preserving selfmappings of a fence
From MaRDI portal
Publication:1803663
DOI10.1007/BF00814405zbMATH Open0773.06007MaRDI QIDQ1803663FDOQ1803663
Publication date: 29 June 1993
Published in: Order (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)
Cites Work
Cited In (15)
- The rank of the semigroup of order-, fence-, and parity-preserving partial injections on a finite set
- A presentation for a submonoid of the symmetric inverse monoid
- The maximal subsemigroups of the ideals in a monoid of partial injections
- Regular semigroups of partial transformations preserving a fence N
- Congruences on infinite semigroups of transformations preserving a zig-zag order
- Generating sets of an infinite semigroup of transformations preserving a zig-zag order
- The rank of the inverse semigroup of all partial automorphisms on a finite crown
- Regularity of semigroups of transformations with restricted range preserving an alternating orientation order
- The rank of the inverse semigroup of partial automorphisms on a finite fence
- The rank of the semigroup of all order-preserving transformations on a finite fence
- Counting the number of isotone selfmappings of crowns
- Regularity in the semigroup of transformations preserving a zig-zag order
- The number of strictly increasing mappings of fences
- The number of order-preserving maps between fences and crowns
- On the semigroup of all partial fence-preserving injections on a finite set
This page was built for publication: The formula for the number of order-preserving selfmappings of a fence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803663)