Non-homogenizable classes of finite structures

DOI10.4230/LIPICS.CSL.2016.16MaRDI QIDQ5278402zbMATH OpenOpenAlexFDO

Authors Albert Atserias, Szymon Toruńczyk

Publication date 19 July 2017

Full work available at URL https://arxiv.org/abs/1605.01199

zbMATH Keywords

amalgmation classbounded widthconstraint satisfaction problemFraïssé classreduct

Mathematics Subject Classification ID

Model theory of finite structures (03C13)

Abstract: Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through (finite) model theory. A few sufficient conditions for a class of finite structures to allow homogenization are known, and here we provide a necessary condition. This lets us show that certain natural classes are not homogenizable: 1) the class of locally consistent systems of linear equations over the two-element field or any finite Abelian group, and 2) the class of finite structures that forbid homomorphisms from a specific MSO-definable class of structures of treewidth two. In combination with known results, the first example shows that, up to pp-interpretability, the CSPs that are solvable by local consistency methods are distinguished from the rest by the fact that their classes of locally consistent instances are homogenizable. The second example shows that, for MSO-definable classes of forbidden patterns, treewidth one versus two is the dividing line to homogenizability.

Recommendations

• Homogenizable relational structures
• Homogenizable structures and model completeness
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Constraint satisfaction problems for reducts of homogeneous graphs
• scientific article; zbMATH DE number 2191987

Cited in

(7)

• Remarks on weak amalgamation and large conjugacy classes in non-Archimedean groups
• scientific article; zbMATH DE number 1192201 (Why is no real title available?)
• Nondiversity in substructures
• Solving infinite-domain CSPs using the patchwork property
• Promise and infinite-domain constraint satisfaction
• Homogeneity and homogenizability: hard problems for the logic SNP
• Homogenizable relational structures

This page was built for publication: Non-homogenizable classes of finite structures

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