arXiv (All)
open access
Optimal Labeling Schemes for $Γ$-Free Matrices
We study labeling schemes for $p \times q$ $Γ$-free binary matrices, which do not contain a submatrix of the form $Γ= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}$. We give a labeling scheme that uses $O(\log^2 N)$-bit labels for rows and columns, where $N=p+q$, such that any matrix entry can be det
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
- Quantitative universality for products of i.i.d. random matrices#998474
- Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of $ω\le9/4$#1412682
- Fast Deterministic Normal Bases and Circulant Polynomial Determinants#1118631
- A nowhere-zero point for several linear mappings simultaneously#1013667
- Factorisability of Low Dimensional Non-Negative Integer Matrices#1061938
Record · ID 1413425
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