Koc University Digital Collections
metadata only
A polynomial embedding of pair of partial orthogonal latin squares
We show that a pair of orthogonal partial Latin squares of order n can be embedded in a pair of orthogonal Latin squares of order at most 16n(4) and all orders greater than or equal to 48n(4). This paper provides the first direct polynomial order embedding construction for pairs of orthogonal partia
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
- Improved bounds on completion of partial Latin squares#1142184
- Mutually orthogonal anti-Latin squares#799315
- Mutually orthogonal anti-Latin squares#797892
- On the uniqueness of a generalized quadrangle of order (4,16)#153049
- On the quadratic length of plane Cremona maps of degree 4#1145110
Record · ID 955075
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