Work

Arithmetic Circuits and Neural Networks for Regular Matroids

Year: 2025

Type: preprint

Abstract: We prove that there exist uniform $(+,\times,/)$-circuits of size $O(n^3)$ to compute the basis generating polynomial of regular matroids on $n$ elements. By tropicalization, this implies that there exist uniform $(\max,+,-)$-circuits and ReLU neural networks of the same size for weighted basis maximization of regular matroids. As a consequence in linear programming theory, we obtain a first example where taking the difference of two extended formulations can be more efficient than the best known individual extended formulation of size $O(n^6)$ by Aprile and Fiorini. Such differences have recently been introduced as virtual extended formulations. The proof of our main result relies on a fine-tuned version of Seymour's decomposition of regular matroids which allows us to identify and maintain graphic substructures to which we can apply a local version of the star-mesh transformation.

Source: University of Twente Research Information

DOI: 10.48550/arxiv.2511.02406

Authors: Hertrich, Christoph, Kober, Stefan, Loho, Georg

Institutions: University of Technology Nuremberg, Université Libre de Bruxelles, University of Twente, Freie Universität Berlin

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7104042754

Cites:

Cited by:

Related to: