You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
The Bhargava Greedoid as a Gaussian Elimination Greedoid
Contributor:
Grinberg, Darij
Published:
The Electronic Journal of Combinatorics, 2024
Published in:
The Electronic Journal of Combinatorics, 31 (2024) 2
Language:
Not determined
DOI:
10.37236/11222
ISSN:
1077-8926
Origination:
Footnote:
Description:
Inspired by Manjul Bhargava's theory of generalized factorials, Grinberg and Petrov have defined the Bhargava greedoid - a greedoid (a matroid-like set system on a finite set) assigned to any "ultra triple" (a somewhat extended variant of a finite ultrametric space). Here we show that the Bhargava greedoid of a finite ultra triple is always a Gaussian elimination greedoid over any sufficiently large (e.g., infinite) field; this is a greedoid analogue of a representable matroid. We find necessary and sufficient conditions on the size of the field to ensure this.