Related papers: Two-sided bounds for the logarithmic capacity of m…
The logarithmic capacity (also called Chebyshev constant or transfinite diameter) of two real intervals $[-1,\alpha]\cup[\beta,1]$ has been given explicitly with the help of Jacobi's elliptic and theta functions already by Achieser in 1930.…
In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…
We provide an introduction to logarithmic potential theory in the complex plane that particularly emphasizes its usefulness in the theory of polynomial and rational approximation. The reader is invited to explore the notions of Fekete…
A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf…
In this paper we review our previous isoperimetric results for the logarithmic potential and Newton potential operators. The main reason why the results are useful, beyond the intrinsic interest of geometric extremum problems, is that they…
In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…
The problem of separation of variables in some coordinate systems obtained with the use of $L$-transformations is studied. Potentials are shown that allow separation of regular variables in a perturbed two-body problem. The potential…
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic curves. Coppersmith's method uses lattice basis reduction to…
We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the…
We continue the study in \cite{As18, AAZ18} by giving a multitude of applications of projective logarithmic potentials. First we introduce the notions of projective logarithmic energy and capacity associated to projective kernel that was…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
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…
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…
We consider the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure. In this NP-hard problem, a single production plant sends the produced items to replenish warehouses from where they are dispatched…
In this note, we establish a compact law of the iterated logarithm under the upper capacity for independent and identically distributed random variables in a sub-linear expectation space. For showing the result, a self-normalized law of the…
In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…
The work is devoted to the construction of a new interval arithmetic which would combine algorithmic efficiency and high quality estimation of the ranges of expressions.
We study the logarithmic capacity of $G_\delta$ subsets of the interval $[0,1].$ Let $S$ be of the form \begin{align*} S=\bigcap_m \bigcup_{k\ge m} I_k, \end{align*} where each $I_k$ is an interval in $[0,1]$ with length $l_k$ that decrease…
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…
This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…