The Bhargava greedoid as a Gaussian elimination greedoid

DOI10.37236/11222MaRDI QIDQ6574367zbMATHFDO

Authors 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)

Recommendations

• The Bhargava greedoid
• A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
• Gaussian, strong and transversal greedoids
• Introduction to Greedoids
• scientific article; zbMATH DE number 4019084

Cites work

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

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)