The number of orthogonal permutations

DOI10.1016/0195-6698(95)90091-8zbMath0828.05004OpenAlexW2032291542MaRDI QIDQ1345530

Masahiro Miyakawa, Akihiro Nozaki, Ivo G. Rosenberg, Grant R. Pogosyan

Publication date: 18 December 1995

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90091-8

zbMATH Keywords

partitionsenumerationorthogonal permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (10)

The lattice of quasiorder lattices of algebras on a finite set. ⋮ Weak orders admitting a perpendicular linear order ⋮ Semirigid sets of diamond orders ⋮ On scattered convex geometries ⋮ Pairs of orthogonal countable ordinals ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ The order on the rationals has an orthogonal order with the same order type ⋮ Countable linear orders with disjoint infinite intervals are mutually orthogonal ⋮ Permutations avoiding certain partially-ordered patterns ⋮ Orthogonal countable linear orders

Cites Work

• Relational systems with trivial endomorphisms and polymorphisms
• Unary polynomials in algebras. I
• Ramsey properties for classes of relational systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of orthogonal permutations