Repository navigation
Prove exact unequal query capacity for every odd cycle - #5023
Merged
Mister-Meeseeks merged 2 commits intoOct 23, 2026
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Exact query-dimension contract
For every odd cycle
C_(2k+1),k>=2, arbitrary nonnegative payload widths and every coefficient field, the minimum fitting rank is exactlymax(maximum independent-set payload weight, ceil(total/2)). Permitted directed rectangular blocks may be nonsymmetric and noncommuting. A compressed edge/private-channel constructor attains the bound withO(n log(max(d)+2))integer operations andO(n)compressed storage; it does not expand payload coordinates.The all-field proof sums the rotated one-edge-plus-isolates subspace bounds. Classical fractional vertex-cover duality and half-integral cycle matching give attainment, and a concave closing-edge search implements it without a solver. Seven width-two payloads need seven query coordinates, versus eight for two scalar solutions;
(2,1,2,1,2,1,1)instead needs six because of its heavier independent set.This answers a distinct longer-cycle interface question alongside Tekalign #3362's C5 theorem and Nick Petalas #4909's bipartite theorem. It does not claim literature priority for classical odd-cycle coding or matching. Family gate: expand the mask class once, close this dimension contract, then stop before any unfunded physical construction. Canonical investigation/claim: Discussion #1587. Base canonical main
bee95ce88f9f19802f0613f92838895cd0e14a1f, priority revision 7; selected conditional kappa 0.00302015 unchanged. Initial overlap covered 310 open PRs, 4096 Discussion records and all 6690 tracked notes, with complete reported inventories; arbitrary diffs and unpublished work remain limits.Verification
1b069fc3d6bb463ab212f3ebc644abe838efa550(13 files). Official export integrity passes; Git-free normal/optimized cold replays pass in 0.584/0.604 seconds. Source corruption and a bool-for-integer receipt mutation reject.Reproduce:
python3.12 -B scripts/research_package.py --package research/odd-cycle-query-capacity.Remaining obligations and credit
This counts intermediate linear field-coordinate dimension. Physical reads/copies, dirty compensation/restoration, ownership, frames, hosting, coefficient preparation, stock/precision, fixed tapes, compiler/outer recovery and an actual P112/caller embedding remain unknown. No selected cold replay, Lean, Docker, full multiplier theorem, native supplier admission or new kappa is claimed.
Credit Tekalign #3362; Sagar Thakrar #2484; ywz65 #2471; Nick Petalas #4909; Cinna Davis, Adam Gall, ctoth, Philippe Van Velzen and the retained P112/native lineage. New scoped proof, constructor and checks: JoyboyBrian, with substantial OpenAI Codex assistance and separately assigned peer review. Apache-2.0.
Submission refresh (2026-10-23 06:22–06:24 UTC): fetched canonical
f259dabc7d70e0db8d6d36bfda888f008bbfecc1preserves guidance, selected record and all declared input bytes from scientific basebee95ce88f9f19802f0613f92838895cd0e14a1f. New package paths are disjoint from upstream changes. Refreshed remote coverage304PR/4114Discussion, local6690base notes complete; no novelty guarantee.Supplemental AI peer review is local-only evidence; the committed written proof, source bindings and registered verifiers are the public reproduction artifacts. Peer-only observations do not constitute independent human or scientific acceptance.