Editing Open Problems:95
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 3: | Line 3: | ||
|who=Oliver Gebhard | |who=Oliver Gebhard | ||
}} | }} | ||
| β | In (non-adaptive) quantitative group testing, one has a population of $n$ individuals, among which $k=n^c$ (for some constant $c\in(0,1)$) are sick. The goal is to | + | In (non-adaptive) quantitative group testing, one has a population of $n$ individuals, among which $k=n^c$ (for some constant $c\in(0,1)$) are sick. The goal is to identity the $k$ sick individuals by performing $m$ non-adaptive tests. In each test, one specifies a subset $S\subseteq [n]$ and learns whether $S$ contains one or more sick individuals. |
By a counting argument, one gets a lower bound of $m = \Omega\bigl( \frac{k}{\log k}\log \frac{n}{k} \bigr)$ tests; however, the best known upper bound is $m = O( k\log \frac{n}{k} )$. | By a counting argument, one gets a lower bound of $m = \Omega\bigl( \frac{k}{\log k}\log \frac{n}{k} \bigr)$ tests; however, the best known upper bound is $m = O( k\log \frac{n}{k} )$. | ||
'''Question:''' Can one get rid of the $\log k$ factor in the lower bound; or, conversely, improve the upper bound to match it? | '''Question:''' Can one get rid of the $\log k$ factor in the lower bound; or, conversely, improve the upper bound to match it? | ||
