A Z2-equivariant topological reduction shows sign-rank(GHD_k^n) equals (1-o_k(1))2k with o_k(1) = O(sqrt(log k / k)), improving prior Omega(k/log(n/k)) bounds.
The complexity of computing the minimum rank of a sign pattern matrix.arXiv preprint arXiv:1503.04486
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds
A Z2-equivariant topological reduction shows sign-rank(GHD_k^n) equals (1-o_k(1))2k with o_k(1) = O(sqrt(log k / k)), improving prior Omega(k/log(n/k)) bounds.