无边群矩阵中的匹配

IF 0.6 3区 数学 Q3 MATHEMATICS
Mohsen Aliabadi, Shira Zerbib
{"title":"无边群矩阵中的匹配","authors":"Mohsen Aliabadi, Shira Zerbib","doi":"10.1007/s10801-024-01308-z","DOIUrl":null,"url":null,"abstract":"<p>We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group <span>\\((G,+)\\)</span> is a bijection <span>\\(f:A\\rightarrow B\\)</span> between two finite subsets <i>A</i>, <i>B</i> of <i>G</i> satisfying <span>\\(a+f(a)\\notin A\\)</span> for all <span>\\(a\\in A\\)</span>. A group <i>G</i> has the matching property if for every two finite subsets <span>\\(A,B \\subset G\\)</span> of the same size with <span>\\(0 \\notin B\\)</span>, there exists a matching from <i>A</i> to <i>B</i>. 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 <i>G</i>, and we obtain criteria for the existence of such matchings. Our tools are classical theorems in matroid theory, group theory and additive number theory.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Matchings in matroids over abelian groups\",\"authors\":\"Mohsen Aliabadi, Shira Zerbib\",\"doi\":\"10.1007/s10801-024-01308-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group <span>\\\\((G,+)\\\\)</span> is a bijection <span>\\\\(f:A\\\\rightarrow B\\\\)</span> between two finite subsets <i>A</i>, <i>B</i> of <i>G</i> satisfying <span>\\\\(a+f(a)\\\\notin A\\\\)</span> for all <span>\\\\(a\\\\in A\\\\)</span>. A group <i>G</i> has the matching property if for every two finite subsets <span>\\\\(A,B \\\\subset G\\\\)</span> of the same size with <span>\\\\(0 \\\\notin B\\\\)</span>, there exists a matching from <i>A</i> to <i>B</i>. 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 <i>G</i>, and we obtain criteria for the existence of such matchings. Our tools are classical theorems in matroid theory, group theory and additive number theory.</p>\",\"PeriodicalId\":14926,\"journal\":{\"name\":\"Journal of Algebraic Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10801-024-01308-z\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01308-z","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们提出并证明了有关群中匹配结果的类比矩阵。一个无阶梯群((G,+))中的匹配是 G 的两个有限子集 A、B 之间的双投影(f:A/rightarrow B\) 满足所有 (a/in A\)的 (a+f(a)\notin A\ )。Losonczy (Adv Appl Math 20(3):385-391, 1998)证明,如果且只有当无孪生群是无扭的或素阶循环群时,无孪生群才具有匹配属性。在此,我们考虑在矩阵环境中的类似问题。我们引入了一个类似的矩阵之间匹配的概念,这些矩阵的基集是一个无边群 G 的子集,我们还得到了这种匹配存在的标准。我们的工具是矩阵理论、群论和加数理论中的经典定理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Matchings in matroids over abelian groups

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 AB 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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.50
自引率
12.50%
发文量
94
审稿时长
6-12 weeks
期刊介绍: The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics. The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信