Functors on relational structures which admit both left and right adjoints

DOI10.1137/23m1555223zbMath1542.18002MaRDI QIDQ6573001

Andrei A. Krokhin, Victor Dalmau, Jakub Opršal

Publication date: 16 July 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphhomomorphismrelational structureconstraint satisfaction problemhomomorphism duality

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Digraph functors which admit both left and right adjoints
• Duality theorems for finite structures (characterising gaps and good characterisations)
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Algebraic Approach to Promise Constraint Satisfaction
• Improved hardness for H-colourings of G-colourable graphs
• $(2+\varepsilon)$-Sat Is NP-hard
• A Characterisation of First-Order Constraint Satisfaction Problems
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• The right adjoints into the categories of relational systems
• Topology and Adjunction in Promise Constraint Satisfaction
• Combinatorial gap theorem and reductions between promise CSPs

This page was built for publication: Functors on relational structures which admit both left and right adjoints