{"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 . 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 -matroid that is k-paving is bounded. We provide a bound on the rank of -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 -matroids that are k-paving. Additionally, we provide a bound on the size of binary matroids that are k-paving.
期刊介绍:
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.