no. 17 · Wednesday 18 November 2026
Bipartite Matchings, Matrix Permanents, and Zeon Power Series
Abstract
Perfect matchings of a bipartite graph are counted by the permanent of the graph's biadjacency matrix, and permanents of sequences of structured biadjacency matrices lead to integer sequences. We consider a number of such sequences and illustrate how zeon-algebraic representations of bipartite graphs lead to recursively defined zeon sequences. Then, using formal power series methods, we show that the ``$Ω$-exponentials'' of these zeon sequences reveal numbers of perfect matchings in the graphs.
- comments
- 24 pages, 7 figures
- fields
- Combinatorics, Rings and Algebras