Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linear matroid products: a synthetic approach

Published 15 Sep 2026 in math.CO | (2609.16747v1)

Abstract: The recently established duality between tensor, symmetric and exterior products of uniform matroids on the one hand, and abstract (bi-)rigidity matroids on the other hand, connects theorems and open questions from both areas, previously thought unrelated. In particular, a 1981 question of Mason asks if any two uniform matroids admit a freest product. Via duality, its reformulation due to Cruickshank, Jackson, Jordán and Tanigawa asks if the generic birigidity matroid is the freest abstract birigidity matroid for its parameters. A related conjecture of Jackson and Tanigawa asks if the generic $2$-hyperconnectivity matroid is the freest K4,K3,3{K_4,K_{3,3}}-matroid. We show that these problems can be addressed effectively, and often solved completely for the class of linearly representable matroids. To this end, we introduce star-basis normal forms that allow to compare representations of abstract (bi-)rigidity matroids over the same field, resulting in a refinement of the weak order relation on the underlying matroids. Utilizing it, we prove that the generic birigidity matroid is the freest linearly representable abstract (a,b)(a,b)-birigidity matroid. This confirms Mason's conjecture for linear matroids. We prove that every representable abstract $2$-rigidity matroid admits a rigidity matrix representation. This is a strengthening of the maximality property of the generic $2$-rigidity matroid. We also prove that every representable abstract $2$-rigidity matroid in which every copy of K3,3K_{3,3} is a circuit admits a hyperconnectivity matrix representation. It follows that the generic rigidity and hyperconnectivity families R2\mathcal{R}_2 and H2\mathcal{H}_2 are the only linearly representable $2$-rigidity families.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.