The lattice and semigroup structure of multipermutations

DOI10.1142/S0218196722500096OpenAlexW3212628403MaRDI QIDQ5063206

No author found.

Publication date: 17 March 2022

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

Galois connectionbinary relationmodel-checking problem

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Structure theory of lattices (06B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Equational classes, universal algebra in model theory (03C05)

Uses Software

• GAP
• Semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
• The complexity of constraint satisfaction games and QCSP
• Representation of inverse semigroups by local automorphisms and multi- automorphisms of groups and rings
• Primes in the semigroup of Boolean matrices
• The semigroup of Hall relations
• Regular elements of the semigroup of all binary relations
• Inverses of Boolean matrices
• Galois theory for minors of finite functions
• Factor-powers of finite symmetric groups
• How can representation theories of inverse semigroups and lattices be united?
• Closed systems of functions and predicates
• Semigroups admitting relative inverses
• The Complexity of Positive First-Order Logic without Equality
• ON THE PARTITION MONOID AND SOME RELATED SEMIGROUPS
• On the Complexity of the Model Checking Problem
• The Complexity of Finite-Valued CSPs
• GREEN'S RELATIONS ON THE SEMIGROUP OF BINARY RELATIONS
• Log Space Recognition and Translation of Parenthesis Languages
• A Proof of the CSP Dichotomy Conjecture
• QCSP monsters and the demise of the chen conjecture
• Algebraic approach to promise constraint satisfaction
• The Complexity of General-Valued CSPs
• An Algebraic Theory of Complexity for Discrete Optimization
• Basics of Galois Connections
• Every semigroup is isomorphic to a transitive semigroup of binary relations
• Relations binaires, fermetures, correspondances de Galois
• Multigroups
• On the semigroup of binary relations

This page was built for publication: The lattice and semigroup structure of multipermutations