Related papers: Computation of Analytic Capacity and applications …
This is a survey of the diversity of problems in additive number theory. Equity requires the consideration of less currently popular problems, and suggests their inclusion in the additive canon. Of particular interest are problems about the…
We study the quasiadditivity property (a version of superadditivity with a multiplicative constant) of variational capacity in metric spaces with respect to Whitney type covers. We characterize this property in terms of a Mazya type…
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…
Laplace problems on planar domains can be solved by means of least-squares expansions associated with polynomial or rational approximations. Here it is shown that, even in the context of an analytic domain with analytic boundary data, the…
We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present…
The accurate computation of the electrostatic capacity of three dimensional objects is a fascinating benchmark problem with a long and rich history. In particular, the capacity of the unit cube has widely been studied, and recent advances…
Organising the relevant literature and by letting statistical convergence play the main role in the theory of compactness, a variant of compactness called statistical compactness has been achieved. As in case of sequential compactness, one…
Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition…
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum $\alpha$ such that there exists a feasible unsplittable routing of the demands after multiplying each…
An approximate analytical expression for "capacitance" of MWPC configurations circulates in the literature since decades and is copied over and over again. In this paper we will try to show that this formula corresponds to a physical…
In this article, which is dedicated to my friend and colleague Boris Zilber on the occasion of his 75th birthday, I put forward a strategy for proving his quasiminimality conjecture for the complex exponential field. That is, for showing…
Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate generating functions. We study information-theoretic questions…
We obtain cubature formulas of volume potentials over bounded domains combining the basis functions introduced in the theory of approximate approximations with their integration over the tangential-halfspace. Then the computation is reduced…
We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric spaces. We use this to show that effective local compactness…
This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields (CUP) for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis…
We present some results concerning the Saito module and the torsion submodule of an analytic plane curve, and we provide a method for computing them. Using this algorithm, we compute analytic invariants for plane curves with multiplicity…
In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth and the the other constraints are represented by a simple…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
In networks, there are often more than one source of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity and…