The Bhargava greedoid as a Gaussian elimination greedoid
The electronic journal of combinatorics, Tome 31 (2024) no. 2
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl DOI arXiv
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.
DOI :
10.37236/11222
Classification :
05B35, 12J25, 52B40
Mots-clés : greedy algorithm, Bhargava greedoid
Mots-clés : greedy algorithm, Bhargava greedoid
Affiliations des auteurs :
Darij Grinberg  1
Darij Grinberg. The Bhargava greedoid as a Gaussian elimination greedoid. The electronic journal of combinatorics, Tome 31 (2024) no. 2. doi: 10.37236/11222
@article{10_37236_11222,
author = {Darij Grinberg},
title = {The {Bhargava} greedoid as a {Gaussian} elimination greedoid},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {2},
doi = {10.37236/11222},
zbl = {1543.05017},
url = {http://geodesic.mathdoc.fr/articles/10.37236/11222/}
}
Cité par Sources :