English

Polymatroids are to finite groups as matroids are to finite fields

Combinatorics 2024-02-28 v1 Group Theory

Abstract

Given a subgroup H\mathcal{H} of a product of finite groups G=i=1nΓi\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i and b>1,b>1, we define a polymatroid P(H,b).P(\mathcal{H},b). If all of the Γi\Gamma_i are isomorphic to Z/pZ,\mathbb{Z}/p\mathbb{Z}, pp a prime, and b=p,b=p, then P(H,b)P(\mathcal{H},b) is the usual matroid associated to any Z/pZ\mathbb{Z}/p\mathbb{Z}-matrix whose row space equals H.\mathcal{H}. In general, there are many ways in which the relationship between P(H,b)P(\mathcal{H},b) and H\mathcal{H} mirrors that of the relationship between a matroid and a subspace of a finite vector space. These include representability by excluded minors, the Crapo-Rota critical theorem, the existence of a concrete algebraic object representing the polymatroid dual of P(H,b),P(\mathcal{H},b), analogs of Greene's theorem and the MacWilliams identities when H\mathcal{H} is a group code over a nonabelian group, and a connection to the combinatorial Laplacian of a quotient space determined by G\mathcal{G} and H.\mathcal{H}. We use the group Crapo-Rota critical theorem to demonstrate an extension to hypergraphs of the classical duality between proper colorings and nowhere-zero flows on graphs.

Keywords

Cite

@article{arxiv.2402.17582,
  title  = {Polymatroids are to finite groups as matroids are to finite fields},
  author = {Ed Swartz and Prairie Wentworth-Nice and Alexander Xue},
  journal= {arXiv preprint arXiv:2402.17582},
  year   = {2024}
}

Comments

39 pages, 3 figures