26 citations · 61 across the 12 of their papers we have counts for
12 papers
Representing partition lattices through FCA
Mike Behrisch, Alain Chavarri Villarello, Edith Vargas-García
We investigate the standard context, denoted by , of the lattice of partitions of a positive integer under the dominan…
A note on the Burris-Willard conjecture
Mike Behrisch
Based on results by Daniľčenko, in 1987 Burris and Willard have conjectured that on any -element domain where it is possible to bicentrically generate every centralise…
All centralising monoids with majority witnesses on a four-element set
Mike Behrisch
We study unary parts of centraliser clones on the set , so-called centralising monoids. We describe and count all centralising monoids on the set having…
On a stronger reconstruction notion for monoids and clones
Mike Behrisch, Edith Vargas-García
Motivated by reconstruction results by Rubin, we introduce a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibil…
The number of clones determined by disjunctions of unary relations
Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set . We…
Reconstructing the topology on monoids and polymorphism clones of the rationals
Mike Behrisch, John K Truss, Edith Vargas-García
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the ratio…
Galois theory for semiclones
Mike Behrisch
We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characte…
Minimal Distance of Propositional Models
Mike Behrisch, Miki Hermann, Stefan Mengel +1
We investigate the complexity of three optimization problems in Boolean propositional logic related to information theory: Given a conjunctive formula over a set of relations, find…
Unique inclusions of maximal C-clones in maximal clones
Mike Behrisch, Edith Vargas-García
-clones are polymorphism sets of so-called clausal relations, a special type of relations on a finite domain, which first appeared in connection with constraint satisfa…
Minimal clones with many majority operations
Mike Behrisch, Tamás Waldhauser
We present two minimal clones containing 26 and 78 majority operations respectively, more than any other previously known example.
The Order of the Giant Component of Random Hypergraphs
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
We establish central and local limit theorems for the number of vertices in the largest component of a random -uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, wher…
Local Limit Theorems and Number of Connected Hypergraphs
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Let signify a random -uniform hypergraph with vertices in which each of the possible edges is present with probability independently, and…