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

Computing the Tutte polynomial of Archimedean tilings

Opened Access Computing the Tutte polynomial of Archimedean tilings

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Garijo Royo, Delia
Gegúndez, M.E.
Márquez Pérez, Alberto
Revuelta Marchena, María Pastora
Sagols, F.
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2014
Publicado en: Applied Mathematics and Computation, 242, 842-855.
Tipo de documento: Artículo
Resumen: 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.
Tamaño: 427.2Kb
Formato: PDF

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

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

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones