首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Layered circlepackings and the type problem
Authors:Ryan Siders
Institution:Department of Mathematics, Princeton University, Princeton, New Jersey 08544
Abstract:We study the geometric type of a surface packed with circles. For circles packed in concentric layers of uniform degree, the circlepacking is specified by this sequence of degrees. We write an infinite sum whose convergence discerns the geometric type: if $h_i$ layers of degree $6$ follow the $i$th layer of degree $7$, and the $i$th layer of degree $7$ has $c_i$ circles, then $\sum \log(h_i)/c_i$ converges/diverges as the circlepacking is hyperbolic/Euclidean. We illustrate a hyperbolic circlepacking with surprisingly few layers of degree $>6$.

Keywords:Circlepacking  electric network
点击此处可从《Proceedings of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Proceedings of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号