蛇形图与Brauer组态代数的若干关系

IF 0.3 Q4 MATHEMATICS, APPLIED Algebra & Discrete Mathematics Pub Date : 2022-01-01 DOI:10.12958/adm1663

Pedro Fernando Fernández Espinosa, Javier Fernando González, Juan Pablo Herrán, A. M. Cañadas, J. L. Ramírez

{"title":"蛇形图与Brauer组态代数的若干关系","authors":"Pedro Fernando Fernández Espinosa, Javier Fernando González, Juan Pablo Herrán, A. M. Cañadas, J. L. Ramírez","doi":"10.12958/adm1663","DOIUrl":null,"url":null,"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.","PeriodicalId":44176,"journal":{"name":"Algebra & Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On some relationships between snake graphs and Brauer configuration algebras\",\"authors\":\"Pedro Fernando Fernández Espinosa, Javier Fernando González, Juan Pablo Herrán, A. M. Cañadas, J. L. Ramírez\",\"doi\":\"10.12958/adm1663\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":44176,\"journal\":{\"name\":\"Algebra & Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra & Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12958/adm1663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra & Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12958/adm1663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

本文利用合适的Brauer组态代数给出了蛇形图完美匹配个数的显式公式。本文还描述了具有路径问题(如Lindstr问题)的Brauer组态代数之间的关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊