The Rado Multiplicity Problem in Vector Spaces over Finite Fields

MaRDI QIDQ6431710zbMATH OpenFDO

Authors Juanjo Rué, Christoph Spiegel

Publication date 1 April 2023

Has companion code repository https://github.com/FordUniver/rs_radomult_23

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic progressions (11B25)

Abstract: We study an analogue of the Ramsey multiplicity problem for additive structures, in particular establishing the minimum number of monochromatic 3-APs in 3-colorings of $mathbb{F}_3^n$ as well as obtaining the first non-trivial lower bound for the minimum number of monochromatic 4-APs in 2-colorings of $mathbb{F}_5^n$. The former parallels results by Cumings et al (2013) in extremal graph theory and the latter improves upon results of Saad and Wolf (2017) The lower bounds are notably obtained by extending the flag algebra calculus of Razborov (2007) to additive structures in vector spaces over finite fields.

This page was built for publication: The Rado Multiplicity Problem in Vector Spaces over Finite Fields

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