On some relationships between snake graphs and Brauer configuration algebras
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.
Saved in:
| Date: | 2022 |
|---|---|
| Main Authors: | , , , , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2022
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1663 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |