New answers tagged

1 vote

Problems and algorithms requiring non-bipartite matching

Let $G$ be a graph and let $\partial : \mathbb F_2^{E(G)} \to \mathbb F_2^{V(G)}$ be the boundary map on edges, extended $\mathbb F_2$-linearly. Then $\ker \partial \leq \mathbb F_2^{E(G)}$ is an ...
user avatar
  • 4,479
3 votes
Accepted

Cartesian monoidal star-autonomous categories

[I'm going to assume $S' \cong S$, which holds in every symmetric monoidal $*$-autonomous category. (See e.g. Lemma 5.6 of this paper.) This applies here since cartesianness implies symmetry. Part of ...
user avatar
  • 4,184

Top 50 recent answers are included