Related papers: On capacity computation for symmetric polygonal co…
We study the condenser capacity $\mathrm{cap}_p(E,\Omega)$ on \emph{unbounded} open sets $\Omega$ in a proper connected metric space $X$ equipped with a locally doubling measure supporting a local $p$-Poincar\'e inequality, where…
We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…
The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…
Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardware by an order of magnitude relative to the state of the art…
We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…
Using a suitable Laguerre basis set that ensures a tridiagonal matrix representation of the reference Hamiltonian, we were able to evaluate in closed form the matrix elements of the generalized Yukawa potential with complex screening…
Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse…
We present an efficient implementation of interior point methods for a family of nonsymmetric cones, including generalized power cones, power mean cones and relative entropy cones, by exploiting underlying low-rank and sparse properties of…
This article provides convergence analysis of online stochastic gradient descent algorithms for functional linear models. Adopting the characterizations of the slope function regularity, the kernel space capacity, and the capacity of the…
We extend a classical approximation result of harmonic functions in planar domains due to Bernstein and Walsch to the setting of harmonic functions in Riemann surfaces. This result gives an exact characterization of the rate at which a…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
We establish sharp $L^p$ integral mean estimates for $(\alpha,\beta)$-harmonic functions on the unit disk. Explicit bounds for the functions and their partial derivatives are obtained in terms of boundary data, by means of the associated…
We calculate the 1-loop effective potential in a supersymmetric model in 5D with $S^1/(Z_2\times Z_2)$ orbifold compactification. The procedure of calculation consists of evaluating first the integrals over four-momenta using the…
We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…
A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
The logarithmic number system (LNS) is arguably not broadly used due to exponential circuit overheads for summation tables relative to arithmetic precision. Methods to reduce this overhead have been proposed, yet still yield designs with…
This article presents a high-order accurate numerical method for the evaluation of singular volume integral operators, with attention focused on operators associated with the Poisson and Helmholtz equations in two dimensions. Following the…