4 citations · 4 across the 10 of their papers we have counts for
10 papers
Randomised algebraic constructions for the no--in-line problem
Benedek Kovács, Zoltán Lóránt Nagy, Dávid R. Szabó
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an square lattice such that no of them are collinear. The problem was f…
Code-based -avoiders in finite affine spaces
Benedek Kovács
The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an -element set $S\subseteq \mathbb{F}_2^…
The generalized trifference problem
Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4
We study the problem of finding the largest number of ternary vectors of length such that for any three distinct vectors there are at least coordinates where they…
Cardinalities of the total number of independent sets
Benedek Kovács, Zoltán Lóránt Nagy
We study the set of numbers the total number of independent sets can admit in -vertex graphs. In this paper, we prove that the cardinality of this set is very…
Settling the no--in-line problem when is not small
Benedek Kovács, Zoltán Lóránt Nagy, Dávid R. Szabó
What is the maximum number of points that can be selected from an square lattice such that no of them are in a line? This has been asked more than years ag…
Telecom AI Native Systems in the Age of Generative AI -- An Engineering Perspective
Ricardo Britto, Timothy Murphy, Massimo Iovene +3
The rapid advancements in Artificial Intelligence (AI), particularly in generative AI and foundational models (FMs), have ushered in transformative changes across various industrie…
Finding a perfect matching of with prescribed differences
Benedek Kovács
We consider the following question by Balister, Győri and Schelp: given nonzero vectors in with zero sum, is it always possible to partition the elements…
Avoiding intersections of given size in finite affine spaces AG(n,2)
Benedek Kovács, Zoltán Lóránt Nagy
We study the set of intersection sizes of a k-dimensional affine subspace and a point set of size m \in [0, 2^n] of the n-dimensional binary affine space AG(n,2). Following the the…
Towards characterizing the 2-Ramsey equations of the form
Zsolt Baja, Dániel Dobák, Benedek Kovács +2
In this paper, we study a Ramsey-type problem for equations of the form . We show that if certain technical assumptions hold, then any 2-colouring of the positive integ…
Multicolor Turán numbers II -- a generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles
Benedek Kovács, Zoltán Lóránt Nagy
In this paper we continue the study of a natural generalization of Turán's forbidden subgraph problem and the Ruzsa-Szemerédi problem. Let denote the maximum number of…