arXiv (All)
open access
Projection cubes of symmetric designs
We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,λ)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference sets, and extend some classic families of difference sets to high
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 Polynomial-Time Strict-Sub-One-Third Approximation Theorem for Bimatrix Games#1119836
- On some k-fold generalizations of Lovász theta and their sandwich theorems#973895
- Polynomial-time recognition and maximum independent set in Burling graphs#174041
- Polynomial-time recognition and maximum independent set in Burling graphs#173463
- Polynomial-time recognition and maximum independent set in Burling graphs#173213
Record · ID 1049597
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