Ferdinand Ihringer
Ghent University
67 Papers
121 Citations
Ferdinand Ihringer is an academic researcher from Ghent University. The author has contributed to research in topics: Polar space & Strongly regular graph. The author has an hindex of 8, co-authored 58 publications. Previous affiliations of Ferdinand Ihringer include Hebrew University of Jerusalem & University of Giessen.
Chat about Author
Papers
Boolean degree 1 functions on some classical association schemes
Yuval Filmus,Ferdinand Ihringer +1 more
TL;DR: In this paper, the authors investigated Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices.
41
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
TL;DR: The smallest eigenvalue and the second largest eigen value in absolute value of the graphs of the relations of classical $P$- and $Q$-polynomial association schemes are studied.
Boolean constant degree functions on the slice are juntas
TL;DR: It is shown that a Boolean degree $d$ function on the slice $\binom{[n]}{k} = (x_1,\ldots,x_n) : 0,1$ is a junta, assuming that $k,n-k$ are large enough.
11
A switching for all strongly regular collinearity graphs from polar spaces
TL;DR: In this paper, a general construction of strongly regular graphs from the collinearity graph of a finite classical polar space of rank at least 3 over a finite field of order q is presented.
11
Regular intersecting families
TL;DR: In this article, a family of sets intersecting is defined, where any two sets in the family intersecting, and it is shown that every element of the family lies in the same (or approximately the same) number of members of the set.
11