Inspired by the notion of $r$-removed $P$-orderings introduced in the setting of Dedekind domains by Bhargava, we generalize it to the framework of arbitrary ultrametric spaces. We show that sets of maximal "$r$-removed perimeter" can be constructed by a greedy algorithm and form a strong greedoid. This gives a simplified proof of several theorems previously obtained by Bhargava, as well as generalises some results of Grinberg and Petrov who considered the case $r=0$ corresponding, in turn, to simple $P$-orderings.
@article{10_37236_12403,
author = {Dmitrii Krachun and Rozalina Mirgalimova},
title = {Strong greedoid structure of \(r\)-removed {\(P\)-orderings}},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {4},
doi = {10.37236/12403},
zbl = {1568.13031},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12403/}
}
TY - JOUR
AU - Dmitrii Krachun
AU - Rozalina Mirgalimova
TI - Strong greedoid structure of \(r\)-removed \(P\)-orderings
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/12403/
DO - 10.37236/12403
ID - 10_37236_12403
ER -