Halfway to Rota’s Basis Conjecture

DOI10.1093/IMRN/RNAA004MaRDI QIDQ5853702zbMATH OpenOpenAlexWikidataFDO

Authors Matija Bucić, Matthew Kwan, Alexey Pokrovskiy, Benny Sudakov

Publication date 11 March 2021

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.07462

zbMATH Keywords

Alon-Tarsi conjectureLatin squaressupersymmetric bracket algebratransversal bases

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Vector spaces, linear dependence, rank, lineability (15A03)

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 (for example, the conjecture was recently the subject of the collaborative "Polymath" project). In this paper we prove that one can always find $left(1/2-oleft(1ight)ight)n$ disjoint transversal bases, improving on the previous best bound of $Omegaleft(n/lognight)$. Our results also apply to the more general setting of matroids.

Recommendations

• On Rota's Basis Conjecture
• Improved bounds for Rota's basis conjecture
• The odd case of Rota's bases conjecture
• A weak version of Rota's bases conjecture for odd dimensions
• Girth conditions and Rota's basis conjecture
• Reduction of Rota's Basis Conjecture to a Problem on Three Bases
• Rota’s Basis Conjecture for Paving Matroids
• An online version of Rota's basis conjecture
• Integer invariants of an incidence matrix related to Rota's basis conjecture
• scientific article; zbMATH DE number 733925

Cited in

(15)

• Wide partitions, Latin tableaux, and Rota's basis conjecture
• Complexity of packing common bases in matroids
• Special case of Rota's basis conjecture on graphic matroids
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• A method to construct all the paving matroids over a finite set
• Decompositions into isomorphic rainbow spanning trees
• An online version of Rota's basis conjecture
• On Rota's Basis Conjecture
• A weak version of Rota's bases conjecture for odd dimensions
• Girth conditions and Rota's basis conjecture
• Rota's basis conjecture for matroids with density close to one
• Choice functions
• Rota's basis conjecture holds for random bases of vector spaces
• Rota's basis conjecture holds asymptotically
• Combinatorics. Abstracts from the workshop held January 4--9, 2026

This page was built for publication: Halfway to Rota’s Basis Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853702)