Heffter arrays over partial loops
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914998505177088 |
|---|---|
| author | Falcón, Raúl M. Mella, Lorenzo |
| author_facet | Falcón, Raúl M. Mella, Lorenzo |
| contents | A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$. In this paper, this notion is naturally generalized to that of $\mathcal{B}$-Heffter array over a partial loop, where $\mathcal{B}$ is a set of block-sum polynomials over an affine $1$-design on the set of entries in $A$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23216 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Heffter arrays over partial loops Falcón, Raúl M. Mella, Lorenzo Combinatorics 05B15, 20N05 A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$. In this paper, this notion is naturally generalized to that of $\mathcal{B}$-Heffter array over a partial loop, where $\mathcal{B}$ is a set of block-sum polynomials over an affine $1$-design on the set of entries in $A$. |
| title | Heffter arrays over partial loops |
| topic | Combinatorics 05B15, 20N05 |
| url | https://arxiv.org/abs/2410.23216 |