“…This recipe says that any matching can thus give rise to a morphism, but it is possible to rewrite such a diagram as a linear combination of diagrams associated to matchings satisfying the pattern avoidance condition [BERT21b, Theorem 5.35].7 Actually, the bijection used for type C webs, which is carefully explained in[BERT21a], is a slight variation of Sundaram's original bijection.…”