arXiv (All)
open access
An Efficient, Lean 4 Verified Necessary and Sufficient Condition for Membership in Pedigree Polytopes
The set \(P_{n}\) consists of the characteristic vectors of pedigrees, which are combinatorial encodings in one-to-one correspondence with Hamiltonian cycles. For \(n \geq 4\) and \(τ_{n} = \binom{n}{3}-1\), the Membership Problem for the Pedigree Polytope (M3P) asks whether a given vector \(X \in \
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
- Finding Shortest Reconfiguration Sequences on Independent Set Polytopes#820440
- A Study on Kakeya Needle Problem for $(n-1)$-Rectifiable Sets#635965
- A Study on Kakeya Needle Problem for $(n-1)$-Rectifiable Sets#633616
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#635641
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#633292
Record · ID 1327504
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