Quasi-Toeplitz row-equivalence conjecture
A quasi-Toeplitz matrix is a matrix obtained from a Toeplitz matrix by replacing some of its rows by zero rows. Two matrices are row equivalent when one can be obtained from the other by elementary row operations.
Quasi-Toeplitz row-equivalence conjecture. Every matrix is row equivalent to a quasi-Toeplitz matrix.
If true, this would provide a systematic reduction of arbitrary matrices to a class that the paper identifies as particularly amenable to decomposition into Toeplitz factors. The paper does not provide a proof or a counterexample.
References
Primary source
Ignacio García-Marco, Irene Márquez-Corbella and Daniel Seco, “On the minimum number of Toeplitz factors of a matrix”, arXiv:2506.16432 (2025).
Progress summary
A reader claims the conjecture is false in sufficiently large dimensions, but the proposed counterexample has not been independently checked.
The conjecture says every square matrix can be reduced by row operations to a matrix formed from a Toeplitz matrix by zeroing some rows. The original paper presents it as an open problem and gives neither a proof nor a counterexample.
Community submission (unverified)
A submitted argument claims that whenever , a Zariski-open dense family of rank- complex matrices is not row equivalent to any quasi-Toeplitz matrix. It bounds the attainable rank- row spaces by a finite union of images of dimension at most , below ; if valid, this gives counterexamples in every such dimension.
Current status (as of August 2026): The retrieved literature still gives no proof or counterexample, while an unverified community submission claims generic counterexamples whenever .
Sources
Solutions 1
CounterexampleThis solution needs a summarySee full solution
A dimension obstruction in every sufficiently large dimension
The conjecture is false. More precisely, whenever
a Zariski-open dense family of rank- complex matrices is not row equivalent to any quasi-Toeplitz matrix.
Index rows and columns by . A Toeplitz matrix has the form
Its diagonal parameters determine a point
because simultaneous multiplication of all parameters by a nonzero scalar does not change any row space.
Fix an -element subset . On the open set where the rows indexed by are linearly independent, there is a rational map
Therefore its image closure satisfies
Suppose a rank- quasi-Toeplitz matrix is obtained from by replacing some rows with zero rows. Even if more than nonzero rows remain, one can choose linearly independent retained rows. Their index set satisfies
Thus all row spaces attainable by rank- quasi-Toeplitz matrices belong to
The Grassmannian is irreducible and has dimension
When , every set in the finite union defining is a proper closed subset. Hence
Choose any -plane outside this union and form an matrix whose first rows are a basis for that plane and whose remaining rows vanish. Row equivalence preserves and is characterized by the row space, so this matrix cannot be row equivalent to any quasi-Toeplitz matrix.
In particular,
The obstruction occurs in every dimension : taking gives
Since the construction is defined over and rational points are Zariski dense in the standard affine Grassmannian chart, rational, and hence integer, counterexamples also exist in every such dimension.
An explicit binary counterexample of order eight
In fact, the following matrix already has entries only in :
Its rank is four. Write
A vector belongs to precisely when
Consequently, for a four-element row-index set , the selected rows of a Toeplitz matrix belong to precisely when its diagonal parameters satisfy
Let denote this integer coefficient matrix. Its equations involve exactly
diagonal parameters. Direct row reduction modulo gives the following complete census of the index sets:
For the first index sets, full column rank modulo implies full column rank over . Therefore their only possible diagonal parameters are zero, and the selected Toeplitz rows cannot span .
The remaining two index sets are
In the diagonal order , their complex kernels are respectively spanned by
and
Indeed, each displayed integer vector solves the corresponding equations, while the modular rank proves that the complex kernel has dimension exactly one. For , the rows indexed by vanish, and the only nonzero selected row is
For , the rows indexed by vanish, and the only nonzero selected row is
In both exceptional cases, the selected rows have rank one instead of four. Therefore no four independent rows of any Toeplitz matrix lie in , and the binary matrix is not row equivalent to any quasi-Toeplitz matrix.
The statement disproved here is Conjecture 5.2 of Ignacio García-Marco, Irene Márquez-Corbella, and Daniel Seco, On the minimum number of Toeplitz factors of a matrix, https://arxiv.org/abs/2506.16432. The distinct factorization conjectures in that paper are not asserted here.