Related papers: Characterization of half-radial matrices
We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We develope new lower bounds for the $A$-numerical radius of semi-Hilbertian space operators, and applying these bounds we obtain upper bounds for the $A$-numerical radius of the commutators of operators. The bounds obtained here improve on…
Let $X$ be a compact metric space, let $A$ be a unital AH algebra with large matrix sizes, and let $B$ be a stably finite unital C*-algebra. Then we give a lower bound for the radius of comparison of $C(X) \otimes B$ and prove that the…
To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…
Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…
A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…
Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…
We will consider close-to-convexity of the metric balls defined by the quasihyperbolic metric and the $j$-metric. We will show that the $j$-metric balls with small radii are close-to-convex in general subdomains of $\Rn$ and the…
In this paper we consider nodal radial solutions of the problem $$ \begin{cases} -\Delta u=|u|^{2^*-2}u+\lambda u&\text{ in }B,\\ u=0&\text{ on }\partial B \end{cases} $$ where $2^*=\frac{2N}{N-2}$ with $3\le N\le6$ and $B$ is the unit ball…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…
For $a\in R$, let $P_a$ denote the intersection of all minimal prime ideals of $R$ containing $a$. An ideal $I$ of a ring $R$ is called a $z^{\circ}$-ideal if $P_a\subseteq I$ for all $a\in I$. In this paper, we first investigate the class…
In [{\em The Numerical Range is a $(1 + \sqrt{2})$-Spectral Set}, SIAM J. Matrix Anal. Appl. 38 (2017), pp.~649-655], Crouzeix and Palencia show that the numerical range of a square matrix or linear operator $A$ is a $(1 +…
Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ with many more rows…
The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is…
We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…
In this paper, we aim to introduce and characterize the concept of numerical radius orthogonality of operators on a complex Hilbert space $\mathcal{H}$ which are bounded with respect to the semi-norm induced by a positive operator $A$ on…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…