Induced arithmetic removal for partition-regular patterns of complexity 1

DOI10.1016/J.JCTA.2025.106126MaRDI QIDQ6889287zbMATH OpenFDO

Authors Valeriia Gladkova

Publication date 5 December 2025

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2025.106126

zbMATH Keywords

additive combinatoricsarithmetic removalremoval lemmas

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Cites work

• A new proof of Szemerédi's theorem
• A Szemerédi-type regularity lemma in abelian groups, with applications
• A unified framework for testing linear-invariant properties
• An improved lower bound for arithmetic regularity
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• Efficient testing of large graphs
• General systems of linear forms: equidistribution and true complexity
• Graph removal lemmas
• scientific article; zbMATH DE number 426324 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 5219603 (Why is no real title available?)
• Induced arithmetic removal: complexity 1 patterns over finite fields
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• On the number of monochromatic solutions of integer linear systems on abelian groups
• Partition theorems for Abelian groups
• Studien zur Kombinatorik
• Testing Linear-Invariant Properties
• The true complexity of a system of linear equations

This page was built for publication: Induced arithmetic removal for partition-regular patterns of complexity 1

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