Related papers: Fast and accurate computation of the logarithmic c…
We present a boundary integral method for numerical computation of the capacity of generalized condensers. The presented method applies to a wide variety of generalized condenser geometry including the cases when the plates of the…
A boundary integral equation method is presented for fast computation of the analytic capacities of compact sets in the complex plane. The method is based on using the Kerzman--Stein integral equation to compute the Szeg\"o kernel and then…
We present a numerical method for the computation of the conformal map from unbounded multiply-connected domains onto lemniscatic domains. For $\ell$-times connected domains the method requires solving $\ell$ boundary integral equations…
We give a survey of computation of the conformal capacity of planar condensers, generalized capacity, and logarithmic capacity with emphasis on our recent work 2020-2025. We also discuss some applications of our method based on the boundary…
Let $K\subset\mathbb{C}$ be a compact set in the plane whose logarithmic capacity $c(K)$ is strictly positive. Let $\mathscr{P}_n(K)$ be the space of monic polynomials of degree $n,$ \emph{all} of whose zeros lie in $K.$ For $p\in…
Using the logarithmic capacity, we give quantitative estimates of the Green function, as well as lower bounds of the Bergman kernel for bounded pseudoconvex domains in $\mathbb C^n$ and the Bergman distance for bounded planar domains. In…
We develop a least-squares method for computing the analytic capacity of compact plane sets with piecewise-analytic boundary. The method furnishes rigorous upper and lower bounds which converge to the true value of the capacity. Several…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
Making use of two different analytical-numerical methods for capacity computation, we obtain matching to a very high precision numerical values for capacities of a wide family of planar condensers. These two methods are based respectively…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
In this paper, we propose a new randomized method for numerical integration on a compact complex manifold with respect to a continuous volume form. Taking for quadrature nodes a suitable determinantal point process, we build an unbiased…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
A general discussion of the conformal Ward identities is presented in the context of logarithmic conformal field theory with conformal Jordan cells of rank two. The logarithmic fields are taken to be quasi-primary. No simplifying…
We consider families of polynomial lemniscates in the complex plane and determine if they bound a Jordan domain. This allows us to find examples of regions for which we can calculate the projection of $\bar{z}$ to the Bergman space of the…
It was recently suggested -- based on general self-consistency arguments as well as results from the bootstrap (arXiv:2005.07708, arXiv:2007.11539, arXiv:2007.04190) -- that the CFT describing the $Q$-state Potts model is logarithmic for…
We study numerical conformal mappings of planar Jordan domains with boundaries consisting of finitely many circular arcs and compute the moduli of quadrilaterals for these domains. Experimental error estimates are provided and, when…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…
We study numerical conformal mapping of multiply connected planar domains with boundaries consisting of unions of finitely many circular arcs, so called polycircular domains. We compute the conformal capacities of condensers defined by…
The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…