Hing Yin Tsang

activity

20132024

most citedFourier sparsity, spectral norm, and the Log-rank conjecture

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

On induced subgraphs of $H (n, 3)$ with maximum degree $1$

Aaron Potechin, Hing Yin Tsang

In this paper, we consider induced subgraphs of the Hamming graph $H (n, 3)$ . We show that if $U \subseteq Z_{3}^{n}$ and $U$ induces a subgraph of $H (n, 3)$ with maximum degree…

math.CO2020

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…

On induced subgraphs of H(n,3) with maximum degree 1

A Conjecture on Induced Subgraphs of Cayley Graphs

On induced subgraphs of $H (n, 3)$ with maximum degree $1$