An efficient computation of the rank function of a positroid

DOI10.1007/978-3-031-43587-4_11MaRDI QIDQ6546590

Lamar Chidiac, Santiago Guzmán-Pro, Winfried. Hochstättler, Anthony Youssef

Publication date: 29 May 2024

zbMATH Keywords

algorithmpositroiddecorated permutationLe diagrams

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The rank function of a positroid and non-crossing partitions
• Positroids and non-crossing partitions
• AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE

This page was built for publication: An efficient computation of the rank function of a positroid

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