Related papers: Improved Cauchy radius for scalar and matrix polyn…
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is…
This article introduces several new upper bounds for the $q$-numerical radius of bounded linear operators on complex Hilbert spaces. Our results refine some of the existing upper bounds in this field. The $q$-numerical radius inequalities…
We prove a family of improved multipolar Poincar\'e-Hardy inequalities on Cartan-Hadamard manifolds. For suitable configurations of poles, these inequalities yield an improved multipolar Hardy inequality and an improved multipolar…
This study presents new upper bounds for the numerical radii of operator matrices, with a focus on $n \times n$ and $2 \times 2$ block matrices acting on Hilbert space direct sums. By employing techniques such as the H\"older-McCarthy…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
In this paper we obtain explicit lower bounds for the radius of convergence of the Painlev\'e expansions of the Korteweg-de-Vries equation around a movable singularity manifold ${\Cal S}$ in terms of the sup norms of the arbitrary functions…
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…
We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
Let $A$ be a positive operator on a complex Hilbert space $\mathcal{H}.$ We present inequalities concerning upper and lower bounds for $A$-numerical radius of operators, which improve on and generalize the existing ones, studied recently in…
Given matrices $A$ and $B$ such that $B=f(A)$, where $f(z)$ is a holomorphic function, we analyze the relation between the singular values of the off-diagonal submatrices of $A$ and $B$. We provide family of bounds which depend on the…
An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
We present combinatorial upper bounds on dimensions of certain imaginary root spaces for symmetric Kac-Moody algebras. These come from the realization of the corresponding infinity-crystal using quiver varieties. The framework is general,…
In this paper, we shall give a new upper diameter estimate for complete Riemannian manifolds in the case that the Bakry-\'Emery Ricci curvature has a positive lower bound and the norm of the potential function has an upper bound. Our…
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$)…
Let $p(z)=z^n+a_{n-1}z^{n-1}+a_{n-2}z^{n-2}+\ldots+a_1z+a_0$ be a complex polynomial with $a_0\neq 0$ and $n\geq 3$. Several new upper bounds for the moduli of the zeros of $p$ are developed. In particular, if…
This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…
In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…