2 papers
math.GR2012
Orbit-equivalent infinite permutation groups
Debbie Lockett, Dugald Macpherson
Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection…
cs.CC2011
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets
Manuel Bodirsky, Dugald Macpherson, Johan Thapper
A famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved…