Related papers: Efficient Method for Computing Lower Bounds on the…
We show $L^p$ estimates for square roots of second order complex elliptic systems $L$ in divergence form on open sets in $\mathbb{R}^d$ subject to mixed boundary conditions. The underlying set is supposed to be locally uniform near the…
Theoreticians have studied distributed algorithms in the radio network model for close to three decades. A significant fraction of this work focuses on lower bounds for basic communication problems such as wake-up (symmetry breaking among…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…
Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
In this paper we study on smooth bounded domains the global regularity (up to the boundary) for weak solutions to systems having $p$-structure depending only on the symmetric part of the gradient.
We consider the communication complexity of some fundamental convex optimization problems in the point-to-point (coordinator) and blackboard communication models. We strengthen known bounds for approximately solving linear regression,…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
We establish the global gradient bounds for weak solutions to the elliptic variational inequality with two-sided obstructions, associated with a $p(x)$-Laplacian type operator involving degenerate or singular matrix weights. Under the…
We revisit the problem of computing submatrices of the Cram\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\vth$. We explore iterative methods that avoid direct inversion of the Fisher…
This paper is devoted to the study of $L_p$ Lyapunov-type inequalities for linear systems of equations with Neumann boundary conditions and for any constant $p \geq 1$. We consider ordinary and elliptic problems. The results obtained in the…
We show that for every positive p, the L_p-norm of linear combinations (with scalar or vector coefficients) of products of i.i.d. random variables, whose moduli have a nondegenerate distribution with the p-norm one, is comparable to the…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…
In this paper, we propose a $p$-norm rule, which is a generalization of the steepest-edge rule, as a pivoting rule for the simplex method. For a nondegenerate linear programming problem, we show upper bounds for the number of iterations of…
If A_1,...,A_N are real square matrices then the p-radius, generalised Lyapunov exponent or matrix pressure is defined to be the asymptotic exponential growth rate of the sum $\sum_{i_1,\ldots,i_n=1}^N \|A_{i_n}\cdots A_{i_1}\|^p$, where p…
In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have…
We prove an estimate on the modulus of continuity at a boundary point of a cylindrical domain for local weak solutions to singular parabolic equations of $p$-laplacian type, with $p$ in the sub-critical range $(1,\frac{2N}{N+1}]$. The…