Two matroids $M$ and $N$ are said to be concordant if there is a strong map from $N$ to $M$. This also can be stated by saying that each circuit of $N$ is a union of circuits of $M$. In this paper, we consider a class of matroids called positroids, introduced by Postnikov, and utilize their combinatorics to determine concordance among some of them. More precisely, given a uniform positroid, we give a purely combinatorial characterization of a family of positroids that is concordant with it. We do this by means of their associated decorated permutations. As a byproduct of our work, we describe completely the collection of circuits of this particular subset of positroids.
@article{10_37236_10056,
author = {Carolina Benedetti and Anastasia Chavez and Daniel Tamayo Jim\'enez},
title = {Quotients of uniform positroids},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {1},
doi = {10.37236/10056},
zbl = {1481.05022},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10056/}
}
TY - JOUR
AU - Carolina Benedetti
AU - Anastasia Chavez
AU - Daniel Tamayo Jiménez
TI - Quotients of uniform positroids
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/10056/
DO - 10.37236/10056
ID - 10_37236_10056
ER -
%0 Journal Article
%A Carolina Benedetti
%A Anastasia Chavez
%A Daniel Tamayo Jiménez
%T Quotients of uniform positroids
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/10056/
%R 10.37236/10056
%F 10_37236_10056
Carolina Benedetti; Anastasia Chavez; Daniel Tamayo Jiménez. Quotients of uniform positroids. The electronic journal of combinatorics, Tome 29 (2022) no. 1. doi: 10.37236/10056
