Abstract
We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group \((G,+)\) is a bijection \(f:A\rightarrow B\) between two finite subsets A, B of G satisfying \(a+f(a)\notin A\) for all \(a\in A\). A group G has the matching property if for every two finite subsets \(A,B \subset G\) of the same size with \(0 \notin B\), there exists a matching from A to B. In Losonczy (Adv Appl Math 20(3):385–391, 1998) it was proved that an abelian group has the matching property if and only if it is torsion-free or cyclic of prime order. Here we consider a similar question in a matroid setting. We introduce an analogous notion of matching between matroids whose ground sets are subsets of an abelian group G, and we obtain criteria for the existence of such matchings. Our tools are classical theorems in matroid theory, group theory and additive number theory.
Similar content being viewed by others
Data availability
Data sharing is not applicable to this article as no datasets were generated or analysed.
References
Aharoni, R., Haxell, P.: Hall’s theorem for hypergraphs. J. Graph Theory 35(2), 83–88 (2000)
Aharoni, R., Kessler, O.: On a possible extension of Hall’s theorem to bipartite hypergraphs. Discrete Math. 84(3), 309–313 (1990)
Aliabadi, M., Filom, K.: Results and questions on matchings in abelian groups and vector subspaces of fields. J. Algebra 598, 85–104 (2022)
Aliabadi, M., Hadian, M., Jafari, A.: On matching property for groups and field extensions. J. Algebra Appl. 15(1), 1650011 (2016)
Aliabadi, M., Janardhanan, M.: On matchable subsets in abelian groups and their linear analogues. Linear Algebra Appl. 582, 138–155 (2019)
Aliabadi, M., Kinseth, J., Kunz, C., Serdarevic, H., Willis, C.: Conditions for matchability in groups and field extensions. Linear Multilinear A 71(7), 1182–1197 (2023)
Ardila-Mantilla, F. The geometry of geometries: matroid theory, old and new. ICM–International Congress of Mathematicians. Vol. VI, Sections 12–14, 4510–4541, EMS Press, Berlin, (2023)
Alon, N., Fan, C.K., Kleitman, D., Losonczy, J.: Acyclic matchings. Adv. Math. 122(2), 234–236 (1996)
Bonin, J.E.: Basis-exchange properties of sparse paving matroids. Adv. in Appl. Math. 50, 6–15 (2013)
Crapo, H.H., Rota, G.C.: On the Foundations of Combinatorial Theory: Combinatorial Geometries. The M.I.T. Press, Cambridge (1970)
DeVos, M., Goddyn, L., Mohar, B.: A generalization of Kneser’s addition theorem. Adv. Math. 220(5), 1531–1548 (2009)
Eliahou, S., Lecouvey, C.: Matchings in arbitrary groups. Adv. in Appl. Math. 40, 219–224 (2008)
Eliahou, S., Lecouvey, C.: Matching subspaces in a field extension. J. Algebra 324, 3420–3430 (2010)
Fan, C.K., Losonczy, J.: Matchings and canonical forms for symmetric tensors. Adv. Math. 117(2), 228–238 (1996)
Ferroni, L., Nasr, G., Vecchi, L.: Stressed Hyperplanes and Kazhdan–Lusztig Gamma-positivity for matroids. Int. Math. Res. Not. rnac270 (2022)
Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)
Hamidoune, Y.O.: Counting certain pairings in arbitrary groups. Combin. Probab. Comput. 20(6), 855–865 (2011)
Kemperman, J.H.B.: On complexes in a semigroup. Indag. Math. 18, 247–254 (1956)
Kemperman, J.H.B.: On small sumsets in an abelian group. Acta Math. 103, 63–88 (1960)
Lev, V.F.: The rectifiability threshold in abelian groups. Combinatorica 28(4), 491–497 (2008)
Levi, F.W.: Ordered groups. Proc. Indian Acad. Sci. 16, 256–263 (1942)
Losonczy, J.: On matchings in groups. Adv. in Appl. Math. 20(3), 385–391 (1998)
Mayhew, D., Newman, M., Welsh, D., Whittle, G.: On the asymptotic proportion of connected matroids. Eur. J. Combin. 32(6), 882–890 (2011)
Meshulam, R.: The clique complex and hypergraph matching. Combinatorica 21, 89–94 (2001)
Nakasawa, T.: Zur axiomatik der linearen abhängigkeit. I. Sci. Rep. Tokyo Bunrika Daigaku Sect. A 2(43), 235–255 (1935)
Nathanson, M.B.: Additive Number Theory: Inverse Problems and the Geometry of Sumsets. Springer-Verlag, New York (1996)
Oxley, J.: Matroid Theory, Oxford Graduate Texts in Mathematics, vol. 21, 2nd edn. Oxford University Press, Oxford (2011)
Pendavingh, R., van der Pol, J.: On the number of matroids compared to the number of sparse paving matroids. Electron. J. Combin. 22(2) (2015)
Rado, R.: A theorem on independence relations. Quart. J. Math. Oxford Ser. 13, 83–89 (1942)
Schrijver, A., Seymour, P.D.: Spanning trees of different weights. DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 1, 281–288 (1990)
Wakeford, E.K.: On Canonical Forms. Proc. Lond. Math. Soc. (2) 18, 403–410 (1920)
Whitney, H.: On the abstract properties of linear dependence. Amer. J. Math. 57(3), 509–533 (1935)
Acknowledgements
We are grateful to Shmuel Friedland for reading a preliminary version of this paper and for his useful suggestions. We also thank Richard Brualdi for drawing our attention to the various variants of the Hall’s marriage theorem. Finally, we are thankful to Steven J. Miller and David J Grynkiewicz for useful discussions on Kneser’s additive theorem.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Dedicated to Professor Shmuel Friedland on his 80th birthday.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Shira Zerbib was supported by NSF Grant DMS-1953929
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Aliabadi, M., Zerbib, S. Matchings in matroids over abelian groups. J Algebr Comb (2024). https://doi.org/10.1007/s10801-024-01308-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10801-024-01308-z