1 citations · 1 across the 4 of their papers we have counts for
4 papers
Equality in the linear algebra bound
Gábor Hegedüs, Lajos Rónyai
We study some examples when there is actually an equality in the linear algebra bound. When the vectors considered span in fact the entire space. We would like to point out that in…
New upper bounds for the size of set systems with restricted intersections modulo prime powers
Gábor Hegedüs
Let be a fixed prime power, be an integer. We give a new upper bound for the size of -wise -modular -avoiding -intersecting set systems, where is…
A new upper bound for codes with a single Hamming distance
Gábor Hegedüs
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
A new upper bound for the size of a sunflower-free family
Gábor Hegedüs
We combine here Tao's slice-rank bounding method and Gröbner basis techniques and apply here to the Erdős-Rado Sunflower Conjecture. Let be integers. We…