arXiv · 2611.14802
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Muhammad Waqar Ul Hassan, G. Stacey Staples. 2026-11-17. Bipartite Matchings, Matrix Permanents, and Zeon Power Series. https://searcharxiv.com/abs/2611.14802
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.