English

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

Combinatorics 2026-04-14 v2

Abstract

We develop a topological framework for proving lower bounds on sign-rank via Z2\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 AA, we associate a free Z2\mathbb{Z}_2-simplicial complex S(A)S(A) and show that sign-rank of AA is characterized by the linear analog of Z2\mathbb{Z}_2-index of S(A)S(A). As a consequence, the classical Z2\mathbb{Z}_2-index of S(A)S(A) lower bounds the sign-rank of AA, which reduces sign-rank lower bounds to topological obstructions. This reduction allows us to use various tools from Z2\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 GHDkn\mathrm{GHD}_k^n (defined for k<n/2k < n/2), which distinguishes pairs of strings in {0,1}n\{0,1\}^n with Hamming distance at most kk from pairs with distance at least nkn-k. We prove an essentially tight lower bound and show that for any kk, sign-rank(GHDkn)=(1ok(1))2k. \text{sign-rank}(\mathrm{GHD}_k^n) = (1-o_k(1)) 2k. where the ok(1)o_k(1) term is O(logkk)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 GHDkn\mathrm{GHD}_k^n is at least Ω(k/log(n/k))\Omega(k/\log(n/k)). A key technical ingredient is a new analysis of the Z2\mathbb{Z}_2-coindex (which lower bounds Z2\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.

Keywords

Cite

@article{arxiv.2604.01510,
  title  = {A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds},
  author = {Florian Frick and Kaave Hosseini and Aliaksei Vasileuski},
  journal= {arXiv preprint arXiv:2604.01510},
  year   = {2026}
}

Comments

38 pages

R2 v1 2026-07-01T11:50:06.522Z