On the Chow-rank of the permanent
Computational Complexity
2025-03-26 v3
Abstract
We derive Glynn's formula from Ryser's formula for the permanent. We further establish via an orbital argument that Glynn's formula yields an optimal row-homogeneous Chow-decomposition of the permanent. We introduce a method for upper-bounding the Chow-rank of polynomials. Our method is based upon the Fundamental Theorem of Symmetric Polynomials. Finally we derive a parametric description of rank revealing row-homogeneous Chow-decompositions of the permanent. Our result provides an alternative approach to the parametrization first obtained by Glynn.
Cite
@article{arxiv.2311.05890,
title = {On the Chow-rank of the permanent},
author = {Rongyu Xu and Edinah Gnang},
journal= {arXiv preprint arXiv:2311.05890},
year = {2025}
}
Comments
Incorrect statement Thm 4.2