Mostra el registre d'ítem simple
Non-homogenizable classes of finite structures
dc.contributor.author | Atserias, Albert |
dc.contributor.author | Torunczyk, Szymon Abram |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2017-01-27T10:51:13Z |
dc.date.available | 2017-01-27T10:51:13Z |
dc.date.issued | 2016 |
dc.identifier.citation | Atserias, A., Torunczyk, S. Non-homogenizable classes of finite structures. A: Annual Conference of the European Association for Computer Science Logic. "25th EACSL Annual Conference on Computer Science Logic (CSL 2016)". Marseille: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 16:1-16:16. |
dc.identifier.isbn | 978-3-95977-022-4 |
dc.identifier.uri | http://hdl.handle.net/2117/100189 |
dc.description.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. |
dc.language.iso | eng |
dc.publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.lcsh | Computer science -- Mathematics |
dc.subject.other | Fraïssé class |
dc.subject.other | Amalgmation class |
dc.subject.other | Reduct |
dc.subject.other | Constraint satisfaction problem |
dc.subject.other | Bounded width |
dc.title | Non-homogenizable classes of finite structures |
dc.type | Conference report |
dc.subject.lemac | Informàtica -- Matemàtica |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.4230/LIPIcs.CSL.2016.16 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Open Access |
local.identifier.drac | 19264574 |
dc.description.version | Postprint (published version) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR |
local.citation.author | Atserias, A.; Torunczyk, S. |
local.citation.contributor | Annual Conference of the European Association for Computer Science Logic |
local.citation.pubplace | Marseille |
local.citation.publicationName | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) |
local.citation.startingPage | 16:1 |
local.citation.endingPage | 16:16 |