arXiv (All)
open access
Optimality of Kløve Arrays within the Symmetric Kløve-Mossige Class
Rajam$\unicode{228}$ki and Koivunen asked whether minimum-redundancy symmetric Kl$\unicode{248}$ve-Mossige arrays with contiguous sum co-arrays are always Kl$\unicode{248}$ve arrays. We give a computer-assisted proof that, at every fixed sensor count, every maximizing sensor set belongs to the Kl$\u
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
- Ambiguity Analysis and Design of Sparse Arrays via Generalized Vandermonde Rank Conditions#1062916
- An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42#792938
- An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42#788934
- Extremal problems for cancellative and locally thin hypergraphs#986484
- New Upper bounds on the Mondrian Art Problem#822406
Record · ID 987005
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