The lattice and semigroup structure of multipermutations

We study the algebraic properties of binary relations whose underlying digraph is smooth, that is, has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary relations that are defined everywhere and whose inverse is also defined everywhere. In the latter formulation, they have been called multipermutations. We study the lattice structure of sets (monoids) of multipermutations over an [Formula: see text]-element domain. Through a Galois connection, these monoids form the algebraic counterparts to sets of relations closed under definability in positive first-order logic without equality. We show one side of this Galois connection, and give a simple dichotomy theorem for the evaluation problem of positive first-order logic without equality on the class of structures whose preserving multipermutations form a monoid closed under inverse. These problems turn out either to be in [Formula: see text]or to be [Formula: see text]-complete. We go on to study the monoid of all multipermutations on an [Formula: see text]-element domain, under usual composition of relations. We characterize its Green relations, regular elements and show that it does not admit a generating set that is polynomial on [Formula: see text].

[1]  Nicholas Pippenger,et al.  Galois theory for minors of finite functions , 1998, Discret. Math..

[2]  Boris M. Schein.  Regular elements of the semigroup of all binary relations , 1976 .

[3]  R. McKenzie,et al.  Every semigroup is isomorphic to a transitive semigroup of binary relations , 1997 .

[4]  Nancy A. Lynch,et al.  Log Space Recognition and Translation of Parenthesis Languages , 1977, JACM.

[5]  Heribert Vollmer,et al.  Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar] , 2008, Complexity of Constraints.

[6]  D. G. FitzGerald,et al.  ON THE PARTITION MONOID AND SOME RELATED SEMIGROUPS , 2010, Bulletin of the Australian Mathematical Society.

[7]  Fred W. Roush,et al.  Inverses of Boolean matrices , 1978 .

[8]  Vladimir Kolmogorov,et al.  The Complexity of General-Valued CSPs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[9]  Stanislav Zivny,et al.  The complexity of finite-valued CSPs , 2013, STOC '13.

[10]  Barnaby Martin,et al.  The Complexity of Positive First-order Logic without Equality , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[11]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  R. Plemmons,et al.  On the semigroup of binary relations , 1970 .

[13]  Barnaby Martin,et al.  QCSP monsters and the demise of the chen conjecture , 2020, STOC.

[14]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  Peter Jeavons,et al.  The complexity of constraint satisfaction games and QCSP , 2009, Inf. Comput..

[16]  J. Riguet,et al.  Relations binaires, fermetures, correspondances de Galois , 1948 .

[17]  Jakub Bulín,et al.  Algebraic approach to promise constraint satisfaction , 2018, STOC.

[18]  Ferdinand Börner.  Basics of Galois Connections , 2008, Complexity of Constraints.

[19]  Martin C. Cooper,et al.  An Algebraic Theory of Complexity for Discrete Optimization , 2012, SIAM J. Comput..

[20]  Barnaby Martin,et al.  On the complexity of the model checking problem , 2012, SIAM J. Comput..

[22]  A. H. Clifford,et al.  Semigroups Admitting Relative Inverses , 1941 .

[23]  How can representation theories of inverse semigroups and lattices be united? , 1996 .

[25]  Barnaby Martin.  The Lattice Structure of Sets of Surjective Hyper-Operations , 2010, CP.

[26]  The semigroup of hall relations , 1974 .

[27]  Venkatesan Guruswami,et al.  Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.

[28]  David A. Gregory,et al.  Primes in the semigroup of Boolean matrices , 1981 .

[29]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .