Voir la notice de l'article provenant de la source Numdam
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator, uniquely defined up to conjugacy. The main result of this article is the fact that this operator behaves in a controlled way under graph covering maps. When such an operator can be used to enumerate objects, or compute a partition function, this has concrete implications on the corresponding enumeration problem, or statistical mechanics model. For example, we show that if is a finite covering graph of a connected graph endowed with edge-weights , then the spanning tree partition function of divides the one of in the ring . Several other consequences are obtained, some known, others new.
Cimasoni, David 1 ; Kassel, Adrien 2
@article{ALCO_2023__6_1_75_0, author = {Cimasoni, David and Kassel, Adrien}, title = {Graph coverings and twisted operators}, journal = {Algebraic Combinatorics}, pages = {75--94}, publisher = {The Combinatorics Consortium}, volume = {6}, number = {1}, year = {2023}, doi = {10.5802/alco.258}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.5802/alco.258/} }
TY - JOUR AU - Cimasoni, David AU - Kassel, Adrien TI - Graph coverings and twisted operators JO - Algebraic Combinatorics PY - 2023 SP - 75 EP - 94 VL - 6 IS - 1 PB - The Combinatorics Consortium UR - http://geodesic.mathdoc.fr/articles/10.5802/alco.258/ DO - 10.5802/alco.258 LA - en ID - ALCO_2023__6_1_75_0 ER -
Cimasoni, David; Kassel, Adrien. Graph coverings and twisted operators. Algebraic Combinatorics, Tome 6 (2023) no. 1, pp. 75-94. doi: 10.5802/alco.258
Cité par Sources :