Entropy and the clique polynomial

DSpace/Manakin Repository

Entropy and the clique polynomial

Citable link to this page


Title: Entropy and the clique polynomial
Author: McMullen, Curtis T.
Citation: McMullen, C. T. 2014. “Entropy and the Clique Polynomial.” Journal of Topology 8 (1) (November 28): 184–212. doi:10.1112/jtopol/jtu022.
Full Text & Related Files:
Abstract: This paper gives a sharp lower bound on the spectral radius ρ(A) of a reciprocal Perron–Frobenius matrix A ∈ M2g(Z), and shows in
particular that ρ(A) g ≥ (3 + √ 5)/2. This bound supports conjectures on the minimal entropy of pseudo-Anosov maps. The proof is based
on a study of the curve complex of a directed graph.
Published Version: 10.1112/jtopol/jtu022
Other Sources: http://www.math.harvard.edu/~ctm/papers/home/text/papers/perron/perron.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:24890382
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search