k-loose elements and k-paving matroids

IF 1.3 3区 数学 Q3 MATHEMATICS, APPLIED
Jagdeep Singh
{"title":"k-loose elements and k-paving matroids","authors":"Jagdeep Singh","doi":"10.1016/j.aam.2025.102885","DOIUrl":null,"url":null,"abstract":"<div><div>For a matroid of rank <em>r</em> and a non-negative integer <em>k</em>, an element is called <em>k</em>-loose if every circuit containing it has size greater than <span><math><mi>r</mi><mo>−</mo><mi>k</mi></math></span>. Zaslavsky and the author characterized all binary matroids with a 1-loose element. In this paper, we establish a sharp linear bound on the size of a binary matroid, in terms of its rank, that contains a <em>k</em>-loose element. A matroid is called <em>k</em>-paving if all its elements are <em>k</em>-loose. Rajpal showed that for a prime power <em>q</em>, the rank of a <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>-matroid that is <em>k</em>-paving is bounded. We provide a bound on the rank of <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>-matroids that are cosimple and have two <em>k</em>-loose elements. Consequently, we strengthen the result of Rajpal by providing a bound on the rank of <span><math><mi>G</mi><mi>F</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span>-matroids that are <em>k</em>-paving. Additionally, we provide a bound on the size of binary matroids that are <em>k</em>-paving.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"167 ","pages":"Article 102885"},"PeriodicalIF":1.3000,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0196885825000478","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

For a matroid of rank r and a non-negative integer k, an element is called k-loose if every circuit containing it has size greater than rk. Zaslavsky and the author characterized all binary matroids with a 1-loose element. In this paper, we establish a sharp linear bound on the size of a binary matroid, in terms of its rank, that contains a k-loose element. A matroid is called k-paving if all its elements are k-loose. Rajpal showed that for a prime power q, the rank of a GF(q)-matroid that is k-paving is bounded. We provide a bound on the rank of GF(q)-matroids that are cosimple and have two k-loose elements. Consequently, we strengthen the result of Rajpal by providing a bound on the rank of GF(q)-matroids that are k-paving. Additionally, we provide a bound on the size of binary matroids that are k-paving.
k-松散单元和k-铺装拟阵
对于秩为r且非负整数k的矩阵,如果包含该元素的每个电路的大小大于r - k,则该元素称为k-loose。Zaslavsky和作者刻画了所有具有1-松散元的二元拟阵。在本文中,我们建立了一个二元矩阵的大小的尖锐线性界,根据它的秩,其中包含一个k-松散元素。如果一个矩阵的所有元素都是k-松散的,那么它就被称为k-铺路矩阵。Rajpal证明了对于素数幂q,铺k的GF(q)-矩阵的秩是有界的。我们给出了具有两个k-松散元素的复单GF(q)-拟阵的秩界。因此,我们通过提供k铺砌的GF(q)-拟阵的秩界来加强Rajpal的结果。此外,我们还提供了k-铺装的二元拟阵的大小的一个界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Advances in Applied Mathematics
Advances in Applied Mathematics 数学-应用数学
CiteScore
2.00
自引率
9.10%
发文量
88
审稿时长
85 days
期刊介绍: Interdisciplinary in its coverage, Advances in Applied Mathematics is dedicated to the publication of original and survey articles on rigorous methods and results in applied mathematics. The journal features articles on discrete mathematics, discrete probability theory, theoretical statistics, mathematical biology and bioinformatics, applied commutative algebra and algebraic geometry, convexity theory, experimental mathematics, theoretical computer science, and other areas. Emphasizing papers that represent a substantial mathematical advance in their field, the journal is an excellent source of current information for mathematicians, computer scientists, applied mathematicians, physicists, statisticians, and biologists. Over the past ten years, Advances in Applied Mathematics has published research papers written by many of the foremost mathematicians of our time.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信