Excluding a Line from Complex-Representable Matroids
For each positive integer <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="t"> <mml:semantics> <mml:mi>t</mml:mi> <mml:annotation encoding="application/x-tex">t</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and each sufficiently large integer <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="r"> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding="application/x-tex">r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, we show that the maximum number of elements of a simple, rank-<inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="r"> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding="application/x-tex">r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper C"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">C</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb C</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-representable matroid with no <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper U Subscript 2 comma t plus 3"> <mml:semantics> <mml:msub> <mml:mi>U</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mi>t</mml:mi> <mml:mo>+</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">U_{2,t+3}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-minor is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="t StartBinomialOrMatrix r Choose 2 EndBinomialOrMatrix plus r"> <mml:semantics> <mml:mrow> <mml:mi>t</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-OPEN"> <mml:mo maxsize="1.2em" minsize="1.2em">(</mml:mo> </mml:mrow> </mml:mstyle> <mml:mfrac linethickness="0"> <mml:mi>r</mml:mi> <mml:mn>2</mml:mn> </mml:mfrac> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-CLOSE"> <mml:mo maxsize="1.2em" minsize="1.2em">)</mml:mo> </mml:mrow> </mml:mstyle> </mml:mrow> </mml:mrow> <mml:mo>+</mml:mo> <mml:mi>r</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">t{r\choose 2}+r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We derive this as a consequence of a much more general result concerning matroids on group-labeled graphs.
Authors
- Zach Walsh (ORCID: https://orcid.org/0000-0001-7973-547X)
- Jim Geelen (ORCID: https://orcid.org/0000-0003-0411-7903)
- Peter S. Nelson (ORCID: https://orcid.org/0000-0002-5451-5726)
Publication Details
- Journal
- Memoirs of the American Mathematical Society
- Published
- 2024-11-19
- DOI
- https://doi.org/10.1090/memo/1523
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00