Corpus ID: 35696077

Applied Mathematics and Computation Computing the Tutte polynomial of Archimedean tilings

@inproceedings{Gegndez2014AppliedMA,
  title={Applied Mathematics and Computation Computing the Tutte polynomial of Archimedean tilings},
  author={M. E. Geg{\'u}ndez and D. Garijo and A. M{\'a}rquez and M. P. Revuelta and F. Sagols},
  year={2014}
}
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… Expand
25 Citations

Figures and Tables from this paper

Kissing Numbers and Transference Theorems from Generalized Tail Bounds
  • 1
  • PDF
All solutions of the n = 5 Lane-Emden equation
  • 17
  • PDF
Solutions of the Harmonic Oscillator Equation in a B-polynomial basis
  • PDF
Analytical solution of system of differential equations by variational iteration method
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 30 REFERENCES
Computing the Tutte Polynomial of a Graph of Moderate Size
  • 65
Computing Tutte Polynomials
  • 41
  • PDF
Edge-Selection Heuristics for Computing Tutte Polynomials
  • 5
  • PDF
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice
  • 25
  • Highly Influential
  • PDF
The Potts model and the Tutte polynomial
  • D. J. A. Welsha, C. Merinob
  • 2000
  • 48
  • PDF
On the computational complexity of the Jones and Tutte polynomials
  • 438
The Computational Complexity of Tutte Invariants for Planar Graphs
  • D. Vertigan
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 2005
  • 61
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
  • A. Sokal
  • Mathematics, Physics
  • Surveys in Combinatorics
  • 2005
  • 304
  • PDF
Matrix multiplication via arithmetic progressions
  • 1,666
...
1
2
3
...