arXiv subjects
Publications and source records attributed to I. Binder.
For the site percolation model on the triangular lattice and certain generalizations for which Cardy's Formula has been established we acquire a power law estimate for the \emph{rate} of convergence of the crossing probabilities to Cardy's Formula.
Following the approach outlined in [18], convergence to SLE6 of the Exploration Processes for the correlated bond-triangular type models studied in [7] is established. This puts the said models in the same universality class as the standard site percolation model on the triangular lattice [19]. The result is proven for all domains with boundary (upper) Minkowski dimension less than two. Moreover, the proof of convergence applies in the general context of critical 2D percolation models, under the stipulation that Cardy's Formula can be established.
Following the approach outlined in [26], convergence to SLE$_6$ of the Exploration Processes for the correlated bond-triangular type models studied in [11] is established. This puts the said models in the same universality class as the standard site percolation model on the triangular lattice [27]. In the context of these models, the result is proven for all domains with boundary Minkowski dimension less than two. Moreover, the proof of convergence applies in the context of general critical 2D percolation models and for general domains, under the stipulation that Cardy's Formula can be established for domains in this generality.
Following the approach outlined in [17], convergence to SLE$_6$ of the Exploration Processes for the correlated bond-triangular type models studied in [6] is established in [3] and the present work. In this second part, we focus on establishing Cardy's Formula for general domains.
We show that if a polynomial filled Julia set has empty interior, then it is computable.
It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.
Let $F$ be a polynomial endomorphism of $\C^n$ which extends holomorphically to $¶^n$. We prove that the dimension of $μ_F$, the pluriharmonic measure on the boundary of the filled Julia set of $F$, is bounded above by $2n-1$.