Related papers: Computation of Analytic Capacity and applications …
We consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the…
This paper presents some ideas to reduce the computational cost of evidence-based robust design optimization. Evidence Theory crystallizes both the aleatory and epistemic uncertainties in the design parameters, providing two quantitative…
Idempotent analogues of convexity are introduced. It is proved that the category of algebras for the capacity monad in the category of compacta is isomorphic to the category of $(\max,\min)$-idempotent biconvex compacta and their biaffine…
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity",…
The inverse potential problem consists in determining the density of the volume potential from measurements outside the sources. Its ill-posedness is due both to the non-uniqueness of the solution and to the instability of the solution with…
In these proceedings, we discuss the recent approach of Ref. [1] for the construction of compact Ans\"atze for scattering amplitudes. The method builds powerful constraints on the analytic structure of the rational functions in amplitudes…
A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…
Conformally symplectic systems include mechanical systems with a friction proportional to the velocity. Geometrically, these systems transform a symplectic form into a multiple of itself making the systems dissipative or expanding. In the…
It is well known that high energy data alone do not discriminate between asymptotic $\ln s$ and $\ln^2s$ behavior of $pp$ and $\bar pp$ cross sections. By exploiting high quality low energy data, analyticity resolves this ambiguity in favor…
In this note, we show that the half-plane capacity of a subset of the upper half-plane is comparable to a simple geometric quantity, namely the euclidean area of the hyperbolic neighborhood of radius one of this set. This is achieved by…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
We derive an analytical calculation formula for the channel capacity of a classical channel without any iteration while its existing algorithms require iterations and the number of iteration depends on the required precision level. Hence,…
We study the conformal capacity by using novel computational algorithms based on implementations of the fast multipole method, and analytic techniques. Especially, we apply domain functionals to study the capacities of condensers $(G,E)$…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
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…
We give new sufficient conditions for a compact set $E \subseteq \mathbb{C}$ to satisfy $\gamma(E)=\gamma_c(E)$, where $\gamma$ is the analytic capacity and $\gamma_c$ is the Cauchy capacity. As a consequence, we provide examples of compact…
Employing a limiting case of a conjecture for constructing piecewise separable-variables functions, the elements of the Pseudoanalytic Function Theory are used for numerically approaching solutions of the forward Dirichlet boundary value…
This paper studies adaptive least-squares finite element methods for convection-dominated diffusion-reaction problems. The least-squares methods are based on the first-order system of the primal and dual variables with various ways of…
Clustering is one of the most fundamental tools in data science and machine learning, and k-means clustering is one of the most common such methods. There is a variety of approximate algorithms for the k-means problem, but computing the…
The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.