6 citations · 10 across the 4 of their papers we have counts for
4 papers
On induced subgraphs of with maximum degree
Aaron Potechin, Hing Yin Tsang
In this paper, we consider induced subgraphs of the Hamming graph . We show that if and induces a subgraph of with maximum degree…
A Conjecture on Induced Subgraphs of Cayley Graphs
Aaron Potechin, Hing Yin Tsang
In this paper, we propose the following conjecture which generalizes a theorem proved by Huang [Hua19] in his recent breakthrough proof of the sensitivity conjecture. We conjecture…
Fourier Sparsity of GF(2) Polynomials
Hing Yin Tsang, Ning Xie, Shengyu Zhang
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of…
Fourier sparsity, spectral norm, and the Log-rank conjecture
Hing Yin Tsang, Chung Hoi Wong, Ning Xie +1
We study Boolean functions with sparse Fourier coefficients or small spectral norm, and show their applications to the Log-rank Conjecture for XOR functions f(x\oplus y) --- a fair…