arXiv:2611.14802v1 Announce Type: new 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 ``$\Omega$-exponentials'' of these zeon sequences reveal numbers of perfect matchings in the graphs.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page