A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
On some relationships between snake graphs and Brauer configuration algebras
2022
Algebra and discrete mathematics
Preserved Fulltext
In this paper, suitable Brauer configuration algebras are used to give an explicit formula for the number of perfect matchings of a snake graph. Some relationships between Brauer configuration algebras with path problems as the Lindstr\"om problem are described as well.
doi:10.12958/adm1663
fatcat:qckmo3cwknbdnkxxnxgnvcpj3u