Document Open Access Logo

Towards the Proximity Conjecture on Group-Labeled Matroids

Authors Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki , Tamás Schwarcz , Yutaro Yamaguchi

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.85.pdf
  • Filesize: 0.82 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Matroids and greedoids
Keywords
  • sparse paving matroid
  • subsequence-interchangeable base orderability
  • congruency constraint
  • multiple labelings

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Consider a matroid M whose ground set is equipped with a labeling to an abelian group. A basis of M is called F-avoiding if the sum of the labels of its elements is not in a forbidden label set F. Hörsch, Imolay, Mizutani, Oki, and Schwarcz (2024) conjectured that if an F-avoiding basis exists, then any basis can be transformed into an F-avoiding basis by exchanging at most |F| elements. This proximity conjecture is known to hold for certain specific groups; in the case where |F| ≤ 2; or when the matroid is subsequence-interchangeably base orderable (SIBO), which is a weakening of the so-called strongly base orderable (SBO) property.
In this paper, we settle the proximity conjecture for sparse paving matroids or in the case where |F| ≤ 4. Related to the latter result, we present the first known example of a non-SIBO matroid. We further address the setting of multiple group-label constraints, showing proximity results for the cases of two labelings, SIBO matroids, matroids representable over a fixed, finite field, and sparse paving matroids.

Cite As Get BibTex

Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, and Yutaro Yamaguchi. Towards the Proximity Conjecture on Group-Labeled Matroids. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 85:1-85:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.85

Author Details

Dániel Garamvölgyi
  • MTA-ELTE Matroid Optimization Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, Hungary
  • HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
Ryuhei Mizutani
  • Faculty of Science and Technology, Keio University, Yokohama, Japan
Taihei Oki
  • Institute for Chemical Reaction Design and Discovery (ICReDD), Hokkaido University, Sapporo, Japan
  • Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan
Tamás Schwarcz
  • Department of Mathematics, London School of Economics and Political Science, UK
Yutaro Yamaguchi
  • Department of Information and Physical Sciences, Graduate School of Information Science and Technology, Osaka University, Japan

Funding

This research has been implemented with the support provided by the Lendület Programme of the Hungarian Academy of Sciences - grant number LP2021-1/2021.
  • Mizutani, Ryuhei: Supported by JSPS KAKENHI Grant Number JP23KJ0379 and JST SPRING Grant Number JPMJSP2108.
  • Oki, Taihei: Supported by JST ERATO Grant Number JPMJER1903, JST CREST Grant Number JPMJCR24Q2, JST FOREST Grant Number JPMJFR232L, JSPS KAKENHI Grant Numbers JP22K17853 and 24K21315, and Start-up Research Funds in ICReDD, Hokkaido University.
  • Schwarcz, Tamás: Supported by EPSRC grant EP/X030989/1. Most of this work was done while this author was affiliated to the HUN-REN–ELTE Egerváry Research Group.
  • Yamaguchi, Yutaro: Supported by JSPS KAKENHI Grant Numbers 20K19743, 20H00605, and 25H01114, by JST CRONOS Japan Grant Number JPMJCS24K2, and by Start-up Program in Graduate School of Information Science and Technology, Osaka University.

Acknowledgements

The authors thank anonymous referees for careful reading. The authors are grateful to the organizers of the 16th Emléktábla Workshop, where the collaboration of the authors started. The authors thank Kristóf Bérczi, Siyue Liu, and Chao Xu for several helpful discussions.

Supplementary Materials

References

  1. Stephan Artmann, Robert Weismantel, and Rico Zenklusen. A strongly polynomial algorithm for bimodular integer linear programming. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC '17), pages 1206-1219, 2017. URL: https://doi.org/10.1145/3055399.3055473.
  2. Francisco Barahona and William R. Pulleyblank. Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 16(2):91-99, 1987. URL: https://doi.org/10.1016/0166-218x(87)90067-9.
  3. Matthias Baumgart. Ranking and ordering problems of spanning trees. PhD thesis, Technische Universität München, Munich, 2009. Google Scholar
  4. Kristóf Bérczi, Bence Mátravölgyi, and Tamás Schwarcz. Reconfiguration of basis pairs in regular matroids. arXiv preprint, 2023. URL: https://doi.org/10.48550/arXiv.2311.07130.
  5. Joseph E. Bonin. Basis-exchange properties of sparse paving matroids. Advances in Applied Mathematics, 50(1):6-15, 2013. URL: https://doi.org/10.1016/j.aam.2011.05.006.
  6. Paolo M. Camerini, Giulia Galbiati, and Francesco Maffioli. Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms, 13(2):258-273, 1992. URL: https://doi.org/10.1016/0196-6774(92)90018-8.
  7. Vera Chekan, Colin Geniet, Meike Hatzel, Michał Pilipczuk, Marek Sokołowski, Michał T. Seweryn, and Marcin Witkowski. Half-integral Erdős-Pósa property for non-null S-T paths. arXiv preprint, 2024. URL: https://arxiv.org/abs/2408.16344.
  8. Maria Chudnovsky, William H. Cunningham, and Jim Geelen. An algorithm for packing non-zero A-paths in group-labelled graphs. Combinatorica, 28:145-161, 2008. URL: https://doi.org/10.1007/s00493-008-2157-8.
  9. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis Goddyn, Michael Lohman, and Paul Seymour. Packing non-zero A-paths in group-labelled graphs. Combinatorica, 26(5):521-532, 2006. URL: https://doi.org/10.1007/s00493-006-0030-1.
  10. Raul Cordovil and M. Leonor Moreira. Bases-cobases graphs and polytopes of matroids. Combinatorica, 13(2):157-165, 1993. URL: https://doi.org/10.1007/bf01303201.
  11. Matt DeVos, Luis Goddyn, and Bojan Mohar. A generalization of Kneser’s Addition Theorem. Advances in Mathematics, 220(5):1531-1548, 2009. URL: https://doi.org/10.1016/j.aim.2008.11.003.
  12. Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai. Lower bounds for matroid optimization problems with a linear constraint. In Proceedings of the 51th International Colloquium on Automata, Languages, and Programming (ICALP '24), pages 56:1-56:20, 2024. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.56.
  13. Friedrich Eisenbrand, Lars Rohwedder, and Karol Węgrzycki. Sensitivity, proximity and FPT algorithms for exact matroid problems. In Proceedings of the 65th Annual Symposium on Foundations of Computer Science (FOCS '24), pages 1610-1620, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00100.
  14. Nicolas El Maalouly, Raphael Steiner, and Lasse Wulf. Exact matching: Correct parity and FPT parameterized by independence number. In 34th International Symposium on Algorithms and Computation (ISAAC 2023), pages 28:1-28:18, 2023. URL: https://doi.org/10.4230/LIPICS.ISAAC.2023.28.
  15. Harold Gabow. Decomposing symmetric exchanges in matroid bases. Mathematical Programming, 10(1):271-276, 1976. URL: https://doi.org/10.1007/bf01580672.
  16. Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, and Yutaro Yamaguchi. Code for finding a non-SIBO matroid. Software, (visited on 2025-06-13). URL: https://github.com/taiheioki/sibo
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.23553
  17. Michel X. Goemans and V.S. Ramakrishnan. Minimizing submodular functions over families of sets. Combinatorica, 15(4):499-513, 1995. URL: https://doi.org/10.1007/BF01192523.
  18. J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum. A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. Journal of the London Mathematical Society, 109(1):e12858, 2024. URL: https://doi.org/10.1112/jlms.12858.
  19. J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum, and Youngho Yoo. A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. arXiv preprint, 2022. URL: https://arxiv.org/abs/2209.09488.
  20. Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz. Problems on group-labeled matroid bases. In Proceedings of the 51st International Colloquium on Automata, Languages, and Programming (ICALP '24), pages 86:1-86:20, 2024. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.86.
  21. Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz. Problems on group-labeled matroid bases. arXiv preprint, 2024. URL: https://doi.org/10.48550/arXiv.2402.16259.
  22. Tony Huynh, Felix Joos, and Paul Wollan. A unified Erdős-Pósa theorem for constrained cycles. Combinatorica, 39(1):91-133, 2019. URL: https://doi.org/10.1007/s00493-017-3683-z.
  23. Yoichi Iwata and Yutaro Yamaguchi. Finding a shortest non-zero path in group-labeled graphs. Combinatorica, 42(S2):1253-1282, 2022. URL: https://doi.org/10.1007/s00493-021-4736-x.
  24. Per M. Jensen and Bernhard Korte. Complexity of matroid property algorithms. SIAM Journal on Computing, 11(1):184-190, 1982. URL: https://doi.org/10.1137/0211014.
  25. Xinrui Jia, Ola Svensson, and Weiqiang Yuan. The exact bipartite matching polytope has exponential extension complexity. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), pages 1635-1654. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch61.
  26. Yoji Kajitani, Shuichi Ueno, and Hiroshi Miyano. Ordering of the elements of a matroid such that its consecutive w elements are independent. Discrete Mathematics, 72(1-3):187-194, 1988. URL: https://doi.org/10.1016/0012-365x(88)90209-9.
  27. Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi. Finding a path with two labels forbidden in group-labeled graphs. Journal of Combinatorial Theory, Series B, 143:65-122, 2020. URL: https://doi.org/10.1016/j.jctb.2019.12.001.
  28. Markus Kirchweger, Manfred Scheucher, and Stefan Szeider. A SAT attack on Rota’s Basis Conjecture. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), pages 4:1-4:18, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPICS.SAT.2022.4.
  29. Yusuke Kobayashi and Sho Toyooka. Finding a shortest non-zero path in group-labeled graphs via permanent computation. Algorithmica, 77(4):1128-1142, 2017. URL: https://doi.org/10.1007/s00453-016-0142-y.
  30. Daniel Kotlar and Ran Ziv. On serial symmetric exchanges of matroid bases. Journal of Graph Theory, 73(3):296-304, 2013. URL: https://doi.org/10.1002/jgt.21675.
  31. Siyue Liu and Chao Xu. On the congruency-constrained matroid base. arXiv preprint, 2023. URL: https://arxiv.org/abs/2311.11737v1.
  32. Siyue Liu and Chao Xu. On the congruency-constrained matroid base. In Proceedings of the 25th Integer Programming and Combinatorial Optimization (IPCO '24), pages 280-293, 2024. URL: https://doi.org/10.1007/978-3-031-59835-7_21.
  33. László Lovász. The matroid matching problem. In László Lovász and Vera T. Sós, editors, Algebraic methods in graph theory, volume 25 of Colloquia Mathematica Societatis János Bolyai, pages 495-517. North-Holland, Amsterdam, 1981. Google Scholar
  34. Dillon Mayhew, Mike Newman, Dominic Welsh, and Geoff Whittle. On the asymptotic proportion of connected matroids. European Journal of Combinatorics, 32:882-890, 2011. URL: https://doi.org/10.1016/j.ejc.2011.01.016.
  35. Dillon Mayhew and Gordon F. Royle. Matroids with nine elements. Journal of Combinatorial Theory, Series B, 98:415-431, 2008. URL: https://doi.org/10.1016/j.jctb.2007.07.005.
  36. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-113, 1987. URL: https://doi.org/10.1007/bf02579206.
  37. Martin Nägele, Benny Sudakov, and Rico Zenklusen. Submodular minimization under congruency constraints. Combinatorica, 39(6):1351-1386, 2019. URL: https://doi.org/10.1007/s00493-019-3900-1.
  38. Martin Nägele and Rico Zenklusen. A new contraction technique with applications to congruency-constrained cuts. Mathematical Programming, 183(1):455-481, 2020. URL: https://doi.org/10.1007/s10107-020-01498-x.
  39. James Oxley. Matroid Theory. Oxford University Press, Oxford, second edition, 2011. URL: https://doi.org/10.1093/acprof:oso/9780198566946.001.0001.
  40. Christos H. Papadimitriou and Mihalis Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982. URL: https://doi.org/10.1145/322307.322309.
  41. Rudi Pendavingh and Jorn van der Pol. On the number of bases of almost all matroids. Combinatorica, 38(4):955-985, 2018. URL: https://doi.org/10.1007/s00493-016-3594-4.
  42. Bruce Reed. Mangoes and blueberries. Combinatorica, 2(19):267-296, 1999. URL: https://doi.org/10.1007/s004930050056.
  43. Jörg Rieder. The lattices of matroid bases and exact matroid bases. Archiv der Mathematik, 56:616-623, 1991. URL: https://doi.org/10.1007/bf01246778.
  44. Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin, 2003. Google Scholar
  45. Alexander Schrijver and Paul D. Seymour. Spanning trees of different weights. In William J. Cook and Paul D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 281-288. DIMACS/AMS, 1990. URL: https://doi.org/10.1090/DIMACS/001/21.
  46. Paul D. Seymour. Decomposition of regular matroids. Journal of Combinatorial Theory, Series B, 28(3):305-359, 1980. URL: https://doi.org/10.1016/0095-8956(80)90075-1.
  47. Robin Thomas and Youngho Yoo. Packing cycles in undirected group-labelled graphs. Journal of Combinatorial Theory, Series B, 161:228-267, 2023. URL: https://doi.org/10.1016/j.jctb.2023.02.011.
  48. Doug Wiedemann. Cyclic base orders of matroids. Manuscript, 1984. Google Scholar
  49. Paul Wollan. Packing non-zero A-paths in an undirected model of group labeled graphs. Journal of Combinatorial Theory, Series B, 100(2):141-150, 2010. URL: https://doi.org/10.1016/j.jctb.2009.05.003.
  50. Paul Wollan. Packing cycles with modularity constraints. Combinatorica, 31(1):95-126, 2011. URL: https://doi.org/10.1007/s00493-011-2551-5.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact