Entropy and the clique polynomial
MetadataShow full item record
CitationMcMullen, C. T. 2014. “Entropy and the Clique Polynomial.” Journal of Topology 8 (1) (November 28): 184–212. doi:10.1112/jtopol/jtu022.
AbstractThis 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:24890382
- FAS Scholarly Articles