Related papers: Two-sided bounds for the logarithmic capacity of m…

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

We develop potential theory for $m$-subharmonic functions with respect to a Hermitian metric on a Hermitian manifold. First, we show that the complex Hessian operator is well-defined for bounded functions in this class. This allows to…

Potentials play an important role in solving boundary value problems for elliptic equations. In the middle of the last century, a potential theory was constructed for a two-dimensional elliptic equation with one singular coefficient. In the…

A formalism is presented that allows an asymptotically exact solution of non-relativistic and semi-relativistic two-body problems with infinitely rising confining potentials. We consider both linear and quadratic confinement. The additional…

We present a numerical method for computing the logarithmic capacity of compact subsets of $\mathbb{C}$, which are bounded by Jordan curves and have finitely connected complement. The subsets may have several components and need not have…

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

In this short note, we employ well-known results to improve the lower bound for the constant associated with the linear term in the asymptotic expansion of the minimal logarithmic energy on the sphere.

We establish lower semi-continuity and strict convexity of the energy functionals for a large class of vector equilibrium problems in logarithmic potential theory. This in particular implies the existence and uniqueness of a minimizer for…

This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known…

We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…

In the framework of Clifford analysis, a chain of harmonic and monogenic potentials in the upper half of (m+1)-dimensional Euclidean space was recently constructed, including a higher dimensional analogue of the logarithmic function in the…

We investigate the existence of a maximiser among open, bounded, convex sets in $\R^d,\,d\ge 3$ for the product of torsional rigidity and Newtonian capacity (or logarithmic capacity if $d=2$), with constraints involving Lebesgue measure or…

Machine-learned interatomic potentials (MLIPs) are increasingly used to replace computationally demanding electronic-structure calculations to model matter at the atomic scale. The most commonly used model architectures are constrained to…

We study the classical problem of characterizing the channel capacity and its achieving distribution in a generic fashion. We derive a simple relation between three parameters: the input-output function, the input cost function and the…

We consider binary dispatching problem originating from object oriented programming. We want to preprocess a hierarchy of classes and collection of methods so that given a function call in the run-time we are able to retrieve the most…

The purpose of this work is twofold. First, we aim to extend for $0<s<1$ the results of one of the authors about equilibrium measures in the real axis in external fields created by point-mass charges for the case of logarithmic potentials…

Capacities on a finite set are sets functions vanishing on the empty set and being monotonic w.r.t. inclusion. Since the set of capacities is an order polytope, the problem of randomly generating capacities amounts to generating all linear…