License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.40
URN: urn:nbn:de:0030-drops-188653
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18865/
Go to the corresponding LIPIcs Volume Portal

Abdolazimi, Dorna ; Lindberg, Kasper ; Gharan, Shayan Oveis

On Optimization and Counting of Non-Broken Bases of Matroids

pdf-format:
LIPIcs-APPROX40.pdf (0.7 MB)

Abstract

Given a matroid M = (E,I), and a total ordering over the elements E, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in I with no broken circuit. The set of NBC independent sets of any matroid M define a simplicial complex called the broken circuit complex which has been the subject of intense study in combinatorics. Recently, Adiprasito, Huh and Katz showed that the face of numbers of any broken circuit complex form a log-concave sequence, proving a long-standing conjecture of Rota.
We study counting and optimization problems on NBC bases of a generic matroid. We find several fundamental differences with the independent set complex: for example, we show that it is NP-hard to find the max-weight NBC base of a matroid or that the convex hull of NBC bases of a matroid has edges of arbitrary large length. We also give evidence that the natural down-up walk on the space of NBC bases of a matroid may not mix rapidly by showing that for some family of matroids it is NP-hard to count the number of NBC bases after certain conditionings.

BibTeX - Entry

@InProceedings{abdolazimi_et_al:LIPIcs.APPROX/RANDOM.2023.40,
  author =	{Abdolazimi, Dorna and Lindberg, Kasper and Gharan, Shayan Oveis},
  title =	{{On Optimization and Counting of Non-Broken Bases of Matroids}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
  pages =	{40:1--40:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-296-9},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{275},
  editor =	{Megow, Nicole and Smith, Adam},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18865},
  URN =		{urn:nbn:de:0030-drops-188653},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2023.40},
  annote =	{Keywords: Complexity, Hardness, Optimization, Counting, Random walk, Local to Global, Matroids}
}

Keywords: Complexity, Hardness, Optimization, Counting, Random walk, Local to Global, Matroids
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Issue Date: 2023
Date of publication: 04.09.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI