Publication:
Entropy and the clique polynomial

Thumbnail Image

Date

2014

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

Oxford University Press (OUP)
The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

McMullen, C. T. 2014. “Entropy and the Clique Polynomial.” Journal of Topology 8 (1) (November 28): 184–212. doi:10.1112/jtopol/jtu022.

Research Data

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.

Description

Keywords

Terms of Use

This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Referenced By

Related Stories