Related papers: Two-sided bounds for the logarithmic capacity of m…
We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…
The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched…
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…
We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and convexity when the finite field is…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
This paper is devoted to logarithmic Hardy-Littlewood-Sobolev inequalities in the two-dimensional Euclidean space, in presence of an external potential with logarithmic growth. The coupling with the potential introduces a new parameter,…
The work is devoted to the construction of a new type of intervals -- functional intervals. These intervals are built on the idea of expanding boundaries from numbers to functions. Functional intervals have shown themselves to be promising…
The Universal Approximation Theorem posits that neural networks can theoretically possess unlimited approximation capacity with a suitable activation function and a freely chosen or trained set of parameters. However, a more practical…
Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density $f \in L^1(\mathbb{R}^m)$ onto another one $g \in L^1(\mathbb{R}^n)$ so as…
The real and imaginari parts of the Cauchy kernel in the plane are scalar Riesz kernels of homogeneity -1. One can associate with each of them a natural notion of capacity related to bounded potentials. The main result of the paper asserts…
In this paper, we address a question of Donaldson's on the best estimate that can be achieved for the transversality of an asymptotically holomorphic sequence of sections of increasing powers of a line bundle over an integral symplectic…
This paper proves the first super-logarithmic lower bounds on the cell probe complexity of dynamic boolean (a.k.a. decision) data structure problems, a long-standing milestone in data structure lower bounds. We introduce a new method for…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
Submodular setfunctions play an important role in potential theory, and a perhaps even more important role in combinatorial optimization. The analytic line of research goes back to the work of Choquet; the combinatorial, to the work of Rado…
In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…
The so$(2,1)$ Lie algebra is applied to three classes of two- and three-dimensional Smorodinsky-Winternitz super-integrable potentials for which the path integral discussion has been recently presented in the literature. We have constructed…
We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…