arXiv (All)
open access
Bounded joins of biclosed sets
Dyer conjectured that the join of two biclosed sets of positive roots can be described by increasing Bruhat paths whose reflection labels belong to their union. We give a type-uniform proof of this conjecture for all finite Coxeter groups. More generally, for a $2$-coclosed set $C$ of positive roots
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
- A Proof of Füredi's Conjecture#999431
- The second-order term for the largest $r$-fork-free families#1104535
- The finite basis problem for additively idempotent semirings of order four, IV#1116483
- On Correspondences between the Alexander Polynomials of Special Alternating Links and MOY Graphs#1084730
- A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice#1076804
Record · ID 1063464
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