Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor
Let k denote a k-element chain, k3. Let M denote the clone generated by all unary isotone operations on k and let Pol denote the clone of all isotone operations on k. We investigate the interval of clones [MPol]. Among other results, we describe completely those clones which contain only join (or meet) homomorphisms, and describe the interval completely for k4.
Krokhin, A., & Larose, B. (2002). A monoidal interval of isotone clones on a finite chain. Acta scientiarum mathematicarum, 68(1-2), 37-62
Journal Article Type | Article |
---|---|
Publication Date | Jan 1, 2002 |
Deposit Date | Mar 29, 2010 |
Publicly Available Date | Jun 14, 2010 |
Journal | Acta scientiarum mathematicarum |
Print ISSN | 0001-6969 |
Electronic ISSN | 2064-8316 |
Publisher | Bolyai Institute, University of Szeged |
Peer Reviewed | Peer Reviewed |
Volume | 68 |
Issue | 1-2 |
Pages | 37-62 |
Public URL | https://durham-repository.worktribe.com/output/1589172 |
Publisher URL | http://www.acta.hu/ |
Accepted Journal Article
(296 Kb)
PDF
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Towards a characterization of constant-factor approximable Finite-Valued CSPs
(2018)
Journal Article
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search