Search arXivSearch

arXiv · 2605.30401

A counterexample to a basis conjecture of Brualdi, Friedland, and Pothen

Abstract

Brualdi, Friedland, and Pothen studied sparse bases of row spaces and proposed a rank-intersection criterion for elementary row-space vectors of sparse generic matrices. We give a \(4\times 8\) sparse generic counterexample. The example has four elementary vectors in its row space whose zero sets satisfy all the proposed rank-intersection inequalities, but the four vectors satisfy a nontrivial linear relation and hence do not form a basis. The construction also explains the obstruction: the proposed inequalities see only ranks of column sets indexed by intersections of zero sets, while linear independence of the corresponding elementary vectors is governed by the relative position of the hyperplanes annihilated by their coefficient vectors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohsen Aliabadi. 2026-06-18. A counterexample to a basis conjecture of Brualdi, Friedland, and Pothen. https://arxiv.org/abs/2605.30401

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO