Partition Rank and Partition Lattices

arXiv2208.06932MaRDI QIDQ6407832FDOQ6407832

Authors: Mohamed Omar 

Publication date: 14 August 2022

Abstract: 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"{o}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 ErdH{o}s, generalize work of Pach et. al on bounding sizes of sets avoiding right triangles to bounding sizes of sets avoiding right $k$-configurations, and complement work of Sauermann and Tao to determine lower bounds on sizes of sets in $mathbb{F}_p^n$ that must have solutions to a homogeneous linear equation where many but not all variables are equal.

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Partition Rank and Partition Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407832)