Kartal Nagy

activity

20222025

most citedIdentification of a monotone Boolean function with

k

"reasons" as a combinatorial search problem

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

A new intersection condition in extremal set theory

Kartal Nagy

We call a family $F$ $(3, 2, ℓ)$ -intersecting if $∣ A \cap B ∣ + ∣ B \cap C ∣ + ∣ C \cap A ∣ \geq ℓ$ for all $A$ , $B$ , $C \in F$ . We try to look for the maximum size…

math.CO2024★ 1 cited

Identification of a monotone Boolean function with $k$ "reasons" as a combinatorial search problem

Dániel Gerbner, András Imolay, Gyula O. H. Katona +5

We study the number of queries needed to identify a monotone Boolean function $f : {0, 1}^{n} \to {0, 1}$ . A query consists of a 0-1-sequence, and the answer is the value of…

math.CO2023

Query complexity of Boolean functions on the middle slice of the cube

Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy +4

We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to co…

math.CO2023

Cooperation in Combinatorial Search

Dániel Gerbner, Balázs Keszegh, Kartal Nagy +2

In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element $d$ of an $n$ -element pool $X$ , and the questioner needs to…

math.CO2022

Chain-dependent Conditions in Extremal Set Theory

Dániel T. Nagy, Kartal Nagy

In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$ -element set satisfying a condition. A condition is called chain-dependent, if it…