Skip to main content

All Questions

Filter by
Sorted by
Tagged with
10 votes
0 answers
175 views

A combinatorial proof of the Harrow--Kolla--Schulman theorem

Let $Q^n := \{0,1\}^n$ be the Hamming cube with the Hamming metric. (Recall that the Hamming is defined by the distance $d(x,y) := \# \{ i : x_i \neq y_i \}$. For integers $0 \leq k \leq n$, define a ...
K Hughes's user avatar
  • 679
3 votes
1 answer
120 views

Combinatorial problem about binary arrays with certain mutual distinctions

If there are m binary arrays (with 0 and 1) of length n, and between any two of these m arrays, there are k and only k same numbers (with the same site index in two different arrays). For example, if ...
Unstandard Candle's user avatar
2 votes
1 answer
137 views

Optimal number of half-spaces in the $H$-representation of the convex hull of $n$ points in $\mathbb R^d$

Let $P$ be the polytope obtained as the convex hull of $n$ points in $\mathbb R^d$. This is the $V$-representation of $P$. Note that $P$ can also be represented as an intersection of closed half-...
dohmatob's user avatar
  • 6,853
2 votes
0 answers
49 views

Bounding the number of identical rows in a Boolean matrix using summary statistics

I am currently stuck on the following problem: given a $n \times d$ Boolean matrix $X = [x_1,\ldots,x_d]$ where each $x_j =[x_{1,j},\ldots,x_{n,j}]^\top \in \{0,1\}^n$, I want to bound the number of ...
Berk U.'s user avatar
  • 379