Koc University Digital Collections
metadata only
The existence of square non-integer Heffter arrays
A Heffter array H(n; k) is an n x n matrix such that each row and column contains k filled cells, each row and column sum is divisible by 2nk + 1 and either x or -x appears in the array for each integer 1 <= x <= nk. Heffter arrays are useful for embedding the graph K-2(nk+1) on an orientable surfac
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 Sparse Corner-Difference MILP for Minimum Square Tiling#1035855
- The Davenport–Heilbronn method: 80 years on#392156
- Wall Drawing #63: A wall is divided into four horizontal parts. In the top row are four equal vertical divisions, each with lines in a different direction. In the second row, six double combinations; in the third row, four triple combinations; in the bottom row, all four combinations superimposed#498552
- Multivalued forbidden numbers of two-rowed configurations -- the missing cases#1116082
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
Record · ID 955830
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