2 citations · 2 across the 4 of their papers we have counts for
5 papers
Counting Specific Classes of Relations Regarding Fixed Points and Reflexive Points
Rudolf Berghammer, Jules Desharnais, Michael Winter
Given a finite and non-empty set and randomly selected specific functions and relations on , we investigate the existence and non-existence of fixed points and reflexive poi…
Algorithmic Counting of Zero-Dimensional Finite Topological Spaces With Respect to the Covering Dimension
Rudolf Berghammer, Steffen Börm, Michael Winter
Taking the covering dimension dim as notion for the dimension of a topological space, we first specify thenumber zdim_{T_0}(n) of zero-dimensional T_0-spaces on {1,...,n}$ and the…
Relational Characterisations of Paths
Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann +1
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of b…
Solving Hard Control Problems in Voting Systems via Integer Programming
Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear progra…
Relation-algebraic and Tool-supported Control of Condorcet Voting
Rudolf Berghammer, Henning Schnoor
We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters. We consider…