A note on sparse supersaturation and extremal results for linear homogeneous systems (Q2401424)

Summary: We study the thresholds for the property of containing a solution to a linear homogeneous system in random sets. We expand a previous sparse Szémeredi-type result of \textit{M. Schacht} [Ann. Math. (2) 184, No. 2, 333--365 (2016; Zbl 1351.05207)] to the broadest class of matrices possible. We also provide a shorter proof of a sparse Rado result of \textit{E. Friedgut} et al. [Random Struct. Algorithms 37, No. 4, 407--436 (2010; Zbl 1228.05284)], based on a hypergraph container approach due to \textit{R. Nenadov} and \textit{A. Steger} [Comb. Probab. Comput. 25, No. 1, 130--144 (2016; Zbl 1371.05272)]. Lastly we further extend these results to include some solutions with repeated entries using a notion of non-trivial solutions due to \textit{I. Z. Ruzsa} [Acta Arith. 65, No. 3, 259--282 (1993; Zbl 1042.11525)] as well as \textit{J. Rué} et al. [Math. Z. 288, No. 1--2, 333--360 (2018; Zbl 1429.60059); Preprint, \url{arXiv:1212.5496}].