二元矩阵的电路分解

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-04-01 DOI:10.1137/23m1587439

Bryce Frederickson, Lukas Michel

{"title":"二元矩阵的电路分解","authors":"Bryce Frederickson, Lukas Michel","doi":"10.1137/23m1587439","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1193-1201, June 2024. <br/> Abstract. Given a simple Eulerian binary matroid [math], what is the minimum number of disjoint circuits necessary to decompose [math]? We prove that [math] many circuits suffice if [math] is the complete binary matroid, for certain values of [math], and that [math] many circuits suffice for general [math]. We also determine the asymptotic behavior of the minimum number of circuits in an odd-cover of [math].","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"109 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Circuit Decompositions of Binary Matroids\",\"authors\":\"Bryce Frederickson, Lukas Michel\",\"doi\":\"10.1137/23m1587439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1193-1201, June 2024. <br/> Abstract. Given a simple Eulerian binary matroid [math], what is the minimum number of disjoint circuits necessary to decompose [math]? We prove that [math] many circuits suffice if [math] is the complete binary matroid, for certain values of [math], and that [math] many circuits suffice for general [math]. We also determine the asymptotic behavior of the minimum number of circuits in an odd-cover of [math].\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"109 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1587439\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1587439","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

SIAM 离散数学杂志》第 38 卷第 2 期第 1193-1201 页，2024 年 6 月。摘要。给定一个简单的欧拉二元矩阵[math]，分解[math]所需的互不相交的电路的最小数目是多少？我们证明，如果[math]是完整的二元矩阵，在[math]的特定值下，[math]许多电路就足够了，而对于一般的[math]，[math]许多电路就足够了。我们还确定了[math]奇数覆盖中最小电路数的渐近行为。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Circuit Decompositions of Binary Matroids

SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1193-1201, June 2024.
Abstract. Given a simple Eulerian binary matroid [math], what is the minimum number of disjoint circuits necessary to decompose [math]? We prove that [math] many circuits suffice if [math] is the complete binary matroid, for certain values of [math], and that [math] many circuits suffice for general [math]. We also determine the asymptotic behavior of the minimum number of circuits in an odd-cover of [math].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.