Halfway to Rota’s Basis Conjecture

Author:

Bucić Matija1,Kwan Matthew2,Pokrovskiy Alexey3,Sudakov Benny1

Affiliation:

1. Department of Mathematics, ETH Zürich, 8092 Zurich, Switzerland

2. Department of Mathematics, Stanford University, Stanford, CA 94305, USA

3. Department of Economics, Mathematics and Statistics, Birkbeck University of London, Bloomsbury, London WC1E 7HX, UK

Abstract

Abstract In 1989, Rota made the following conjecture. Given $n$ bases $B_{1},\dots ,B_{n}$ in an $n$-dimensional vector space $V$, one can always find $n$ disjoint bases of $V$, each containing exactly one element from each $B_{i}$ (we call such bases transversal bases). Rota’s basis conjecture remains wide open despite its apparent simplicity and the efforts of many researchers (e.g., the conjecture was recently the subject of the collaborative “Polymath” project). In this paper we prove that one can always find $\left (1/2-o\left (1\right )\right )n$ disjoint transversal bases, improving on the previous best bound of $\Omega \left (n/\log n\right )$. Our results also apply to the more general setting of matroids.

Funder

SNSF

Publisher

Oxford University Press (OUP)

Subject

General Mathematics

Reference30 articles.

1. The intersection of a matroid and a simplicial complex;Aharoni;Trans. Amer. Math. Soc.,2006

2. Colorings and orientations of graphs;Alon;Combinatorica,1992

3. Rainbow spanning trees in properly coloured complete graphs;Balogh;Discrete Appl. Math.,2018

4. An online version of Rota’s basis conjecture;Bollen;J. Algebraic Combin.,2015

5. Comments on bases in dependence structures;Brualdi;Bull. Austral. Math. Soc.,1969

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Rota's basis conjecture for matroids with density close to one;Advances in Applied Mathematics;2024-01

2. Rota’s basis conjecture holds for random bases of vector spaces;European Journal of Combinatorics;2023-10

3. Special Case of Rota's Basis Conjecture on Graphic Matroids;The Electronic Journal of Combinatorics;2022-09-23

4. Choice Functions;Order;2022-07-14

5. A method to construct all the paving matroids over a finite set;Boletín de la Sociedad Matemática Mexicana;2022-06-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3