The Bhargava greedoid as a Gaussian elimination greedoid

DOI10.37236/11222zbMATH Open1543.05017MaRDI QIDQ6574367FDOQ6574367

Darij Grinberg

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmBhargava greedoid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Non-Archimedean valued fields (12J25)

Cites Work

• P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
• Title not available (Why is that?)
• Advanced determinant calculus
• Introduction to Greedoids
• Matroid matching and some applications
• The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\)
• Greedoids
• On the Gomory-Hu inequality
• Optimizing phylogenetic diversity under constraints
• Gaussian, strong and transversal greedoids
• The Bhargava greedoid
• A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
• On the rank of Hankel matrices over finite fields
• A double Sylvester determinant

This page was built for publication: The Bhargava greedoid as a Gaussian elimination greedoid

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