星图与完全图上算术结构的临界群
Critical groups of arithmetical structures on star graphs and complete graphs
AI总结:
本文研究星图与完全图上的算术结构临界群,给出依据结构项确定临界群的方法,并探究了可作为这类图算术结构临界群的有限阿贝尔群类型。
摘要:
无环有限连通图上的算术结构是指满足特定条件的顶点正整数赋值。每个算术结构都对应一个有限阿贝尔群,称为其临界群。本文展示了如何依据算术结构的各项,确定星图或完全图上算术结构的临界群。我们以此为基础,探究了哪些有限阿贝尔群可作为这些图上算术结构的临界群。
英文摘要:
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group. We show how to determine the critical group of an arithmetical structure on a star graph or complete graph in terms of the entries of the arithmetical structure. We use this to investigate which finite abelian groups can occur as critical groups of arithmetical structures on these graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。