On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
From MaRDI portal
Publication:5009328
DOI10.1137/20M1338642OpenAlexW3186814475MaRDI QIDQ5009328
Nisheeth K. Vishnoi, Rohit Gurjar
Publication date: 20 August 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1338642
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial codes (94B25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial bound on the number of light cycles in an undirected graph
- Nonlinear discrete optimization. An algorithmic theory
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- Decomposition of regular matroids
- Packings with large minimum kissing numbers
- Cycle cover ratio of regular matroids
- Re-visiting the echo state property
- Unavoidable parallel minors of regular matroids
- The highly connected matroids in minor-closed classes
- Lattices with exponentially large kissing numbers
- Deciding First Order Properties of Matroids
- A Decomposition Theory for Binary Linear Codes
- The number of shortest cycles and the chromatic uniqueness of a graph
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Spanning Circuits in Regular Matroids
- On the distance distribution of codes
- On the weight distribution of random binary linear codes
- Matroid Secretary for Regular and Decomposable Matroids
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
- A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
- Linear codes with exponentially many light vectors