Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR26-056 | 12th April 2026 21:17

A $\mathbb{Z}_2$–Topological Framework for Sign-rank Lower Bounds

RSS-Feed




Revision #1
Authors: Florian Frick, Kaave Hosseini, Aliaksei Vasileuski
Accepted on: 12th April 2026 21:17
Downloads: 37
Keywords: 


Abstract:

We develop a topological framework for proving lower bounds on sign-rank via $\mathbb{Z}_2$–equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance problem up to lower-order terms.

For every (partial) sign matrix $A$, we associate a free $\mathbb{Z}_2$–simplicial complex $S(A)$ and show that sign-rank of $A$ is characterized by the linear analog of $\mathbb{Z}_2$-index of $S(A)$. As a consequence, the classical $\mathbb{Z}_2$–index of $S(A)$ lower bounds the sign-rank of $A$, which reduces sign-rank lower bounds to topological obstructions.
This reduction allows us to use various tools from $\mathbb{Z}_2$–equivariant topology, particularly in regimes where classical lower-bound techniques break down.

As the main application, we consider the Gap Hamming Distance function
$\mathrm{GHD}_k^n$ (defined for $k < n/2$), which distinguishes pairs of strings in $\{0,1\}^n$
with Hamming distance at most $k$ from pairs with distance at least $n-k$.
We prove an essentially tight lower bound and show that for any $k$,
\[
\text{sign-rank}(\mathrm{GHD}_k^n) = (1-o_k(1))\,2k.
\]
where the $o_k(1)$ term is $O\left(\sqrt{\frac{\log k}{k}}\right)$.
This improves on the previous lower bound of
Hatami, Hosseini, and Meng (STOC 2023) who proved that sign-rank of
$\mathrm{GHD}_k^n$ is at least $\Omega(k/\log(n/k))$.

A key technical ingredient is a new analysis of the $\mathbb{Z}_2$-coindex (which lower bounds $\mathbb{Z}_2$-index) of the Vietoris--Rips complex of the hypercube in the sparse regime which yields an essentially tight lower bound. Previously, no results were known in the sparse regime.



Changes to previous version:

fixed typos.


Paper:

TR26-056 | 2nd April 2026 02:26

A $\mathbb{Z}_2$–Topological Framework for Sign-rank Lower Bounds





TR26-056
Authors: Florian Frick, Kaave Hosseini, Aliaksei Vasileuski
Publication: 12th April 2026 16:54
Downloads: 44
Keywords: 


Abstract:

We develop a topological framework for proving lower bounds on sign-rank via $\mathbb{Z}_2$–equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance problem up to lower-order terms.

For every (partial) sign matrix $A$, we associate a free $\mathbb{Z}_2$–simplicial complex $S(A)$ and show that sign-rank of $A$ is characterized by the linear analog of $\mathbb{Z}_2$-index of $S(A)$. As a consequence, the classical $\mathbb{Z}_2$–index of $S(A)$ lower bounds the sign-rank of $A$, which reduces sign-rank lower bounds to topological obstructions.
This reduction allows us to use various tools from $\mathbb{Z}_2$–equivariant topology, particularly in regimes where classical lower-bound techniques break down.

As the main application, we consider the Gap Hamming Distance function
$\mathrm{GHD}_k^n$ (defined for $k < n/2$), which distinguishes pairs of strings in $\{0,1\}^n$
with Hamming distance at most $k$ from pairs with distance at least $n-k$.
We prove an essentially tight lower bound and show that for any $k$,
\[
\text{sign-rank}(\mathrm{GHD}_k^n) = (1-o_k(1))\,2k.
\]
where the $o_k(1)$ term is $O\left(\sqrt{\frac{\log k}{k}}\right)$.
This improves on the previous lower bound of
Hatami, Hosseini, and Meng (STOC 2023) who proved that sign-rank of
$\mathrm{GHD}_k^n$ is at least $\Omega(k/\log(n/k))$.

A key technical ingredient is a new analysis of the $\mathbb{Z}_2$-coindex (which lower bounds $\mathbb{Z}_2$-index) of the Vietoris--Rips complex of the hypercube in the sparse regime which yields an essentially tight lower bound. Previously, no results were known in the sparse regime.



ISSN 1433-8092 | Imprint