Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

DOI10.1007/978-3-030-44559-1_13MaRDI QIDQ6316629arXivFDO

Authors Christoph Koutschan, Elaine Wong

Publication date 3 April 2019

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Abstract: We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $1,dots,n$, subject to a coloring with two different colors. Previously, only asymptotic formulas for such bounds were known, and only for $ainmathbbN$. Using symbolic computation techniques, these results are extended here to arbitrary $ainmathbbR$. Furthermore, we give exact formulas for the minimum number of monochromatic Schur triples for $a=1,2,3,4$, and briefly discuss the case $0<a<1$.

This page was built for publication: Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

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