F. Ihringer

activity

20132026

most citedAffine vector space partitions

6 citations · 31 across the 45 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018

New and Updated Semidefinite Programming Bounds for Subspace Codes

Daniel Heinlein, Ferdinand Ihringer

We show that $A_{2} (7, 4) \leq 388$ and, more generally, $A_{q} (7, 4) \leq (q^{2} - q + 1) [7]_{q} + q^{4} - 2 q^{3} + 3 q^{2} - 4 q + 4$ by semidefinite programming for $q \leq 101$ . Furthermore, we exte…

math.CO2018

The Chromatic Number of the $q$ -Kneser Graph for $q \geq 5$

Ferdinand Ihringer

We obtain a new weak Hilton-Milner type result for intersecting families of $k$ -spaces in $F_{q}^{2 k}$ , which improves several known results. In particular the chromatic num…

math.CO2018

Boolean constant degree functions on the slice are juntas

Yuval Filmus, Ferdinand Ihringer

We show that a Boolean degree $d$ function on the slice $(k [ n ]) = {(x_{1}, \dots, x_{n}) \in {0, 1} : \sum_{i = 1}^{n} x_{i} = k}$ is a junta, assuming that $k, n - k$ are large eno…

math.CO2018

Boolean degree 1 functions on some classical association schemes

Yuval Filmus, Ferdinand Ihringer

We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs…

New and Updated Semidefinite Programming Bounds for Subspace Codes

The Chromatic Number of the q-Kneser Graph for q≥5

Boolean constant degree functions on the slice are juntas

Boolean degree 1 functions on some classical association schemes

The Chromatic Number of the $q$ -Kneser Graph for $q \geq 5$