2k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR75 papers
- University of MünsterDE37 papers
- Los Alamos National LaboratoryUS33 papers
- Max Planck Institute for Dynamics and Self-OrganizationDE26 papers
- Observatoire de la Côte d’AzurFR26 papers
- University of StuttgartDE25 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE23 papers
- Heinrich Heine University DüsseldorfDE23 papers
- Northwestern UniversityUS23 papers
- Deutsches Elektronen-Synchrotron DESYDE22 papers
- Bogolyubov Institute for Theoretical PhysicsUA21 papers
- ETH ZurichCH21 papers
9 papers · 2 filters
Large sets of subspace designs
Michael Braun, Michael Kiermaier, Axel Kohnert +1
In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Graßmannian into joins are discussed. This framework admits a generaliza…
Intersection numbers for subspace designs
Michael Kiermaier, Mario Osvin Pavčević
Intersection numbers for subspace designs are introduced and -analogs of the Mendelsohn and Köhler equations are given. As an application, we are able to determine the intersect…
Derived and Residual Subspace Designs
Michael Kiermaier, Reinhard Laue
A generalization of forming derived and residual designs from -designs to subspace designs is proposed. A -analog of a theorem by Van Trung, van Leijenhorst and Driessen is p…
The golden number and Fibonacci sequences in the design of voting structures
Josep Freixas, Sascha Kurz
Some distinguished types of voters, as vetoers, passers or nulls, as well as some others, play a significant role in voting systems because they are either the most powerful or the…
Fast regocnition of planar non unit distance graphs
Sascha Kurz
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
3-regular matchstick graphs with given girth
Sascha Kurz, Giuseppe Mazzuoccolo
We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such…
Integral point sets in higher dimensional affine spaces over finite fields
Sascha Kurz, Harald Meyer
We consider point sets in the -dimensional affine space where each squared Euclidean distance of two points is a square in . It turns out that the…
Maximal integral point sets in affine planes over finite fields
Michael Kiermaier, Sascha Kurz
Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine…
No finite -regular matchstick graph exists
Sascha Kurz
A graph is called a unit-distance graph in the plane if there is an injective embedding of in the plane such that every pair of adjacent vertices are at unit distance…