On the uncommonness of minimal rank-2 systems of linear equations
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917652863123456 |
|---|---|
| author | Altman, Daniel Liebenau, Anita |
| author_facet | Altman, Daniel Liebenau, Anita |
| contents | We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kamčev, Morrison and the second author. Moreover, we prove that any large system containing such a $(2\times k)$-system as a minimal subsystem is uncommon. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_18908 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the uncommonness of minimal rank-2 systems of linear equations Altman, Daniel Liebenau, Anita Combinatorics Number Theory Probability We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kamčev, Morrison and the second author. Moreover, we prove that any large system containing such a $(2\times k)$-system as a minimal subsystem is uncommon. |
| title | On the uncommonness of minimal rank-2 systems of linear equations |
| topic | Combinatorics Number Theory Probability |
| url | https://arxiv.org/abs/2404.18908 |