arXiv (All)
open access
Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori
A de Bruijn sequence packs all $n$-bit binary words into a cycle of length $2^n$. A de Bruijn torus is the two-dimensional analogue in which each word appears exactly once in a rectangular window. Here we consider the natural analogue for permutations using their shorthand representation (i.e., each
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
- Order-Optimal Systematic Permutation Codes for Correcting t Deletions#1141895
- Distributed Renaming with Subquadratic Bits via Scalable Committee Election#200455
- The repugnant conclusion can be avoided with moral intuitions intact#693761
- A hybrid blowfish-based cryptography and chaotic quantization steganography framework with genetic key generation.#258333
- Chosen-prefix collisions on AES-like hashing#370124
Record · ID 1064127
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