Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal Lower Bound for Itemset Frequency Indicator Sketches   Given a database, a common problem is to find the pairs or $k$-tuples of
items that frequently co-occur. One specific problem is to create a small space
"sketch" of the data that records which $k$-tuples appear in more than an
$\epsilon$ fraction of rows of the database.
  We improve the lower bound of Liberty, Mitzenmacher, and Thaler [LMT14],
showing that $\Omega(\frac{1}{\epsilon}d \log (\epsilon d))$ bits are necessary
even in the case of $k=2$. This matches the sampling upper bound for all
$\epsilon \geq 1/d^{.99}$, and (in the case of $k=2$) another trivial upper
bound for $\epsilon = 1/d$.

33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat