go-v.orgdoi

On some relationships between snake graphs and Brauer configuration algebras

Universidad Nacional de Colombia, Pedro Fernando Fernández Espinosa, Javier Fernando González, Universidad Nacional de Colombia, Juan Pablo Herrán, Universidad Nacional de Colombia, Agustín Moreno Cañadas, Universidad Nacional de Colombia, Jósé L. Ramírez, Universidad Nacional de Colombia · Algebra and Discrete Mathematics · 2022

  • DOI 10.12958/adm1663
  • Publisher University of Luhansk
  • Type article
  • Issued 2022

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Algebra and Discrete Mathematics · University of Luhansk · article · 2022

Abstract

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.

Open the resolved locator · 10.12958/adm1663

Metadata licence: OpenAlex metadata (CC0)