arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.1648math.DS
收藏

所有秩曲面群极小表示的体积熵

Volume entropy for minimal presentations of surface groups in all ranks

Lluís Alsedà, David Juher, Jérôme Los, Francesc Mañosas

摘要:

我们研究的体积熵的一类介绍(包括经典的)的所有表面群,称为\emph{minimal geometric presentations}。我们重新发现了一个公式,首先得到的大炮和Wagreich的计算在一个未发表的手稿大炮。结果令人惊讶:一个显式多项式的次数$n$,该集团的秩,编码的体积熵的所有经典的表面集团的介绍。我们使用的方法完全不同。它是基于一个动力系统建设以下的想法,由于鲍文和系列,并扩展到所有的几何介绍。其结果是一个明确的公式的体积熵最小介绍所有的表面组,示出了一个多项式依赖的秩$n>2$。我们证明了对于秩为$n$的具有经典表示$P_n$的表面群$G_n$,体积熵是$\log(λ_n)$,其中$λ_n$是大于多项式\[ x^{n} - 2(n - 1) \sum_{j=1}^{n-1} x^{j} + 1. \]之一的唯一实根

英文摘要:

We study the volume entropy of a class of presentations (including the classical ones) for all surface groups, called \emph{minimal geometric presentations}. We rediscover a formula first obtained by Cannon and Wagreich with the computation in a non published manuscript by Cannon. The result is surprising: an explicit polynomial of degree $n$, the rank of the group, encodes the volume entropy of all classical presentations of surface groups. The approach we use is completely different. It is based on a dynamical system construction following an idea due to Bowen and Series and extended to all geometric presentations in. The result is an explicit formula for the volume entropy of minimal presentations for all surface groups, showing a polynomial dependence in the rank $n>2$. We prove that for a surface group $G_n$ of rank $n$ with a classical presentation $P_n$ the volume entropy is $\log(λ_n)$, where $λ_n$ is the unique real root larger than one of the polynomial \[ x^{n} - 2(n - 1) \sum_{j=1}^{n-1} x^{j} + 1. \]

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑