Related papers: Computation of Analytic Capacity and applications …
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…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
We present an approach to minimization under constraint. We explore the connections of this technique with the general method of Compactness by Concentration of P.L. Lions and present applications to some constrained semi-linear and…
We prove a compactness theorem for metrics with Bounded Integral Curvature on a fixed closed surface $\Sigma$. As a corollary, we obtain a compactification of the space of Riemannian metrics with conical singularities, where an accumulation…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
We prove a reduction theorem for capacity of positive maps of finite dimensional C*-algebras, thus reducing the computation of capacity to the case when the image of a nonscalar projection is never a projection.
For a parameterized hyperbolic system $u_{i+1} = f(u_i,s)$, the derivative of an ergodic average $\ < J\ > = \underset{n\rightarrow\infty}{\lim} \frac1n \sum_1^n J(u_i,s)$ to the parameter $s$ can be computed via the least squares…
The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…
For an interval $E=[a,b]$ on the real line, let $\mu$ be either the equilibrium measure, or the normalized Lebesgue measure of $E$, and let $V^{\mu}$ denote the associated logarithmic potential. In the present paper, we construct a function…
We study natural examples of binary channels with synchronization errors. These include the duplication channel, which independently outputs a given bit once or twice, and geometric channels that repeat a given bit according to a geometric…
In the presence of a positive, compactly supported measure on an affine algebraic curve, we relate the density of polynomials in Lebesgue $L^2$-space to the existence of analytic bounded point evaluations. Analogues to the complex plane…
We prove a version of the doubling Bernstein inequalities for the trace of an analytic function of two variables on an analytic subset of $\mathbb{C}^2$. The estimate applies to the whole analytic set in question including its singular…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance.…
A number theoretic algorithm is given for writing gauge theory amplitudes in a compact manner. It is possible to write down all details of the complete $L$ loop amplitude with two integers, or a complex integer. However, a more symmetric…
The theoretic capacity of a communication system constituted of several transmitting/receiving elements is determined by the singular values of its transfer matrix. Results based on an independent identically distributed channel model,…
In this paper we introduce a combinatorial formula for the Ekeland-Hofer-Zehnder capacity of a convex polytope in $\mathbb{R}^{2n}$. One application of this formula is a certain subadditivity property of this capacity.