Repositorio de producción científica de la Universidad de Sevilla

Computing the Tutte polynomial of Archimedean tilings

 

Advanced Search
 
Opened Access Computing the Tutte polynomial of Archimedean tilings
Cites

Show item statistics
Icon
Export to
Author: Garijo Royo, Delia
Gegúndez, M.E.
Márquez Pérez, Alberto
Revuelta Marchena, María Pastora
Sagols, F.
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2014
Published in: Applied Mathematics and Computation, 242, 842-855.
Document type: Article
Abstract: We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte polynomial of square lattices. We also address the problem of obtaining Tutte polynomial evaluations from the symbolic expressions generated by our algorithm, improving the best known lower bound for the asymptotics of the number of spanning forests, and the lower and upper bounds for the asymptotics of the number of acyclic orientations of the square lattice.
Size: 427.2Kb
Format: PDF

URI: http://hdl.handle.net/11441/38839

DOI: http://dx.doi.org/10.1016/j.amc.2014.06.067

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)