Rigidity of infinite disk patterns (Q1284562): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2129652096 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/9901148 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:59, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rigidity of infinite disk patterns |
scientific article |
Statements
Rigidity of infinite disk patterns (English)
0 references
14 October 1999
0 references
Let \(P\) be a locally finite disk pattern on the complex plane \(\mathbb{C}\) whose combinatorics are described by the one-skelton \(G\) of a triangulation of the open topological disk and whose dihedral angles are equal to a function \(\theta:E\to[0,\pi/2]\) on the set of edges. The author shows that \(P\) is determined up to a euclidean similarity. If \(\theta=0\) this was proved earlier by Rodin and Sullivan and generalized by O. Schramm. Their methods do not work here. The author uses new clever ideas including discrete potential theory, probabilistic methods first developed by K. Stephenson, etc. as well as other important tools.
0 references
packing of the plane
0 references
discrete potential theory
0 references
maximum principle
0 references
extremal length
0 references