arXiv (All)
open access
Balanced weightings and permutation matchings applied to the monoid of order-preserving mappings
We give a necessary and sufficient condition for a combinatorial D-class of a finite semigroup to have a permutation matching: that its structure matrix admit a balanced weighting, that is, non-negative weights with constant row sums and constant column sums. This weakens the regularity hypothesis,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Uncountably many enumerations of well-quasi-ordered permutation classes#158600
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Aggregation, Balancing, and Respect for the Claims of Individuals#71960
- Orbital integrals and ideal class monoids for a Bass order#974160
- Further Remarks on Separating Words#818962
Record · ID 1157183
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive