Abstract
A finite orthant-order system is the indexed family of preorders obtained by independently reversing the coordinate chains of a finite data set. The orientations that compare a given unordered pair form a union of antipodal Boolean faces. For a fixed anchor, compatible orientations form an affine binary space when nonempty; signed-graph balance gives exact counts and certificates. Minimal obstructions give Helly number d, while a bipartite sign-completion model and Dowker duality describe the compatibility complex. Finding a largest compatible subset is NP-hard. Anchored incomparability instead leads to signed not-all-equal constraints, with a tractability boundary between supports of size two and three. A fixed-orientation Poisson limit describes antichains in the continuous product model. Products of posets distinguish intrinsic coordinate incomparability from disagreement between coordinate directions.
Cite this version
Wuming Pan. Finite Orthant-Order Systems: Compatibility, Incomparability, and Counting. 1id1, v1, 20 November 2026. 1id1:core:20261120-0002@v1. https://1id1.net/id/core/20261120-0002/v1/
Files & integrity
| File | Size |
|---|---|
| Paper PDF | 584 KB |
| LaTeX source archive | 32 KB |
SHA-256 checksums
Version history
First fixed 1id1 release of the combinatorial paper. It cites the distinct learning-theory preprint (1id1:core:20261120-0001@v1) for the definition and shared results, and distinguishes fixed-orientation and all-direction antichain thresholds.
Provenance & verification
Author preprint. AI-assisted editing is disclosed in the paper. This deposit does not assert journal publication or peer review.
The typesetting sources compile independently. All 34 proof environments are unchanged from the source manuscript. These editorial checks are not a formal verification of the theorems.