On set systems definable in sparse graph classes, discrepancy, and quantifier elimination

05/08/2021
βˆ™
by   Mario Grobler, et al.
βˆ™
0
βˆ™

We study the (hereditary) discrepancy of definable set systems, which is a natural measure for their inherent complexity and approximability. We establish a strong connection between the hereditary discrepancy and quantifier elimination over signatures with only unary relation and function symbols. We prove that set systems definable in theories (over such signatures) with quantifier elimination have constant hereditary discrepancy. We derive that set systems definable in bounded expansion classes, which are very general classes of uniformly sparse graphs, have bounded hereditary discrepancy. We also derive that nowhere dense classes, which are more general than bounded expansion classes, in general do not admit quantifier elimination over a signature extended by an arbitrary number of unary function symbols. We show that the set systems on a ground set U definable on a monotone nowhere dense class of graphs π’ž have hereditary discrepancy at most |U|^c (for someΒ c<1/2) and that, on the contrary, for every monotone somewhere dense class π’ž and for every positive integer d there is a set system of d-tuples definable in π’ž with discrepancy Ξ©(|U|^1/2). We further prove that if π’ž is a class of graphs with bounded expansion and Ο•(xΜ…;yΜ…) is a first-order formula, then we can compute in polynomial time, for an input graph Gβˆˆπ’ž, a mapping Ο‡:V(G)^|xΜ…|β†’{-1,1} witnessing the boundedness of the discrepancy of the set-system defined byΒ Ο•, an Ξ΅-net of size π’ͺ(1/Ξ΅), and an Ξ΅-approximation of size π’ͺ(1/Ξ΅).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 11/07/2022

Modulo-Counting First-Order Logic on Bounded Expansion Classes

We prove that, on bounded expansion classes, every first-order formula w...
research
βˆ™ 07/07/2022

Fast Discrepancy Minimization with Hereditary Guarantees

Efficiently computing low discrepancy colorings of various set systems, ...
research
βˆ™ 04/21/2021

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

The concept of bounded expansion provides a robust way to capture sparse...
research
βˆ™ 02/01/2023

Flip-width: Cops and Robber on dense graphs

We define new graph parameters, called flip-width, that generalize treew...
research
βˆ™ 11/27/2019

Properties of nowhere dense graph classes related to independent set problem

A set is called r-independent, if every two vertices of it are in distan...
research
βˆ™ 05/09/2018

Parameterized circuit complexity of model checking first-order logic on sparse structures

We prove that for every class C of graphs with effectively bounded expan...
research
βˆ™ 02/18/2022

Sketching Distances in Monotone Graph Classes

We study the problems of adjacency sketching, small-distance sketching, ...

Please sign up or login with your details

Forgot password? Click here to reset