Functors on relational structures which admit both left and right adjoints

02/27/2023
by   Victor Dalmau, et al.
0

This paper describes several cases of adjunction in the homomorphism order of relational structures. For these purposes, we say that two functors Γ and Δ between categories of relational structures are adjoint if for all structures A and B, we have that Γ(A) maps homomorphically to B if and only if A maps homomorphically to Δ(B). If this is the case Γ is called the left adjoint to Δ and Δ the right adjoint to Γ. In 2015, Foniok and Tardif described some functors category of digraphs that allow both left and right adjoints. The main contribution of Foniok and Tardif is a construction of right adjoints to some of the functors identified as right adjoints by Pultr in 1970. We generalise results of Foniok and Tardif to arbitrary relational relational structures, and coincidentely, we also provide more right adjoints on digraphs, and since these constructions are connected to finite duality, we also provide a new construction of duals to trees. Our results are motivated by the application in promise constraint satisfaction – it has been shown that such functors can be used as efficient reductions between these problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2021

Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems

A temporal (constraint) language is a relational structure with a first-...
research
05/19/2020

Unlocking New York City Crime Insights using Relational Database Embeddings

This version withdrawn by arXiv administrators because the author did no...
research
10/10/2020

Constraint Satisfaction Problems over Finite Structures

We initiate a systematic study of the computational complexity of the Co...
research
09/04/2023

Intranasal Chemosensory Lateralization Through the Multi-electrode Transcutaneous Electrical Nasal Bridge Stimulation

Numerous studies have been conducted on display techniques for intranasa...
research
11/25/2020

Left Lyndon tree construction

We extend the left-to-right Lyndon factorisation of a word to the left L...
research
04/25/2023

Finitely accessible arboreal adjunctions and Hintikka formulae

Arboreal categories provide an axiomatic framework in which abstract not...
research
01/14/2019

Long range actions, connectedness, and dismantlability in relational structures

In this paper we study alternative characterizations of dismantlability ...

Please sign up or login with your details

Forgot password? Click here to reset