60 citations · 247 across the 23 of their papers we have counts for
26 papers
The paired construction for Boolean functions on the slice
Michael Kiermaier, Jonathan Mannaert, Alfred Wassermann
Let be a finite set of size . We consider real functions on the "slice" , which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq…
Steiner 3-designs as extensions
Michael Kiermaier, Vedran Krčadinac, Alfred Wassermann
In this article, we construct a Steiner system with the parameters , settling one of the smallest open parameter sets of Steiner -designs. Furthermore, we establish t…
Some new Steiner designs
Michael Kiermaier, Vedran Krčadinac, Vladimir D. Tonchev +2
The Kramer-Mesner method for constructing designs with a prescribed automorphism group has proven effective many times. In the special case of Steiner designs, the task reduces…
The degree of functions in the Johnson and q-Johnson schemes
Michael Kiermaier, Jonathan Mannaert, Alfred Wassermann
In 1982, Cameron and Liebler investigated certain "special sets of lines" in PG(3,q), and gave several equivalent characterizations. Due to their interesting geometric and algebrai…
Designs in finite classical polar spaces
Michael Kiermaier, Kai-Uwe Schmidt, Alfred Wassermann
Combinatorial designs have been studied for nearly 200 years. Fifty years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their q-analogs, also known as subspace de…
Higher incidence matrices and tactical decomposition matrices
Michael Kiermaier, Alfred Wassermann
In 1985, Janko and Tran Van Trung published an algorithm for constructing symmetric designs with prescribed automorphisms. This algorithm is based on the equations by Dembowski (19…