Partition Rank and Partition Lattices
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914950856835072 |
|---|---|
| author | Omar, Mohamed |
| author_facet | Omar, Mohamed |
| contents | We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we call a partition indicator. The advantages of partition indicators are two-fold: they diagonalize tensors that are constant when specified sets of variables are equal, and even in more general settings they can often substantially reduce the partition rank as compared to when a distinctness indicator is applied. The key to our discoveries is integrating the partition rank method with Möbius inversion on the lattice of partitions of a finite set. Through this we unify disparate applications of the partition rank method in the literature. We then use our theory to address a finite field analogue of a question of Erdős, thereby generalizing results of Hart and Iosevich and independently Shparlinski. Furthermore we generalize work of Pach, et al. on bounding sizes of sets avoiding right triangles to bounding sizes of sets avoiding right $k$-configurations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_06932 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Partition Rank and Partition Lattices Omar, Mohamed Combinatorics 05D40 We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we call a partition indicator. The advantages of partition indicators are two-fold: they diagonalize tensors that are constant when specified sets of variables are equal, and even in more general settings they can often substantially reduce the partition rank as compared to when a distinctness indicator is applied. The key to our discoveries is integrating the partition rank method with Möbius inversion on the lattice of partitions of a finite set. Through this we unify disparate applications of the partition rank method in the literature. We then use our theory to address a finite field analogue of a question of Erdős, thereby generalizing results of Hart and Iosevich and independently Shparlinski. Furthermore we generalize work of Pach, et al. on bounding sizes of sets avoiding right triangles to bounding sizes of sets avoiding right $k$-configurations. |
| title | Partition Rank and Partition Lattices |
| topic | Combinatorics 05D40 |
| url | https://arxiv.org/abs/2208.06932 |