Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2605.19277 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917510133055488 |
|---|---|
| author | Kang, Ming-Hsuan Chou, Shin-Hsun |
| author_facet | Kang, Ming-Hsuan Chou, Shin-Hsun |
| contents | A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine lines presents additional difficulties arising from parallelism.
We prove that universal cycles exist for affine lines in $\mathrm{AG}(n,q)$ for all $n \ge 2$ and all prime powers $q$. Our construction embeds the problem into $\mathrm{PG}(n,q)$, using points at infinity to encode directions, and proceeds via a decomposition into pairwise and triple configurations combined with a recursive lifting and gluing argument.
We further interpret the construction in the Grassmannian $G_q(2,n+1)$, where affine lines correspond to the outer shell of $2$-subspaces, thereby extending known constructions for Grassmannians. A Python implementation is provided as supplementary material. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_19277 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Universal Cycles on Affine Lines Kang, Ming-Hsuan Chou, Shin-Hsun Combinatorics Dynamical Systems A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine lines presents additional difficulties arising from parallelism. We prove that universal cycles exist for affine lines in $\mathrm{AG}(n,q)$ for all $n \ge 2$ and all prime powers $q$. Our construction embeds the problem into $\mathrm{PG}(n,q)$, using points at infinity to encode directions, and proceeds via a decomposition into pairwise and triple configurations combined with a recursive lifting and gluing argument. We further interpret the construction in the Grassmannian $G_q(2,n+1)$, where affine lines correspond to the outer shell of $2$-subspaces, thereby extending known constructions for Grassmannians. A Python implementation is provided as supplementary material. |
| title | Universal Cycles on Affine Lines |
| topic | Combinatorics Dynamical Systems |
| url | https://arxiv.org/abs/2605.19277 |