Related papers: Maximum of the resolvent over matrices with given …
The quantum statistics mechanism is very powerful for investigating the equilibrium states and the phase transitions in complex spin disorder systems. The spin disorder systems act as an interdisciplinary platform for solving the optimum…
In quasi-exactly solvable problems partial analytic solution (energy spectrum and associated wavefunctions) are obtained if some potential parameters are assigned specific values. We introduce a new class in which exact solutions are…
We obtain various upper bounds for the numerical radius $w(T)$ of a bounded linear operator $T$ defined on a complex Hilbert space $\mathcal{H}$, by developing the upper bounds for the $\alpha$-norm of $T$, which is defined as…
We study the spectrum of the product of two Toeplitz operators. Assume that the symbols of these operators are continuous and real-valued and that one of them is non-negative. We prove that the spectrum of the product of finite section…
We study the growth of the resolvent of a Toeplitz operator $T_b$, defined on the Hardy space, in terms of the distance to its spectrum $\sigma(T_b)$. We are primarily interested in the case when the symbol $b$ is a Laurent polynomial…
This paper is devoted to condition numbers of the multidimensional total least squares problem with linear equality constraint (TLSE). Based on the perturbation theory of invariant subspace, the TLSE problem is proved to be equivalent to a…
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…
We introduce and investigate a class of complex semi-infinite banded Toeplitz matrices satisfying the condition that the spectra of their principal submatrices accumulate onto a real interval when the size of the submatrix grows to…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…
We consider $n\times n$ real symmetric and Hermitian Wigner random matrices $n^{-1/2}W$ with independent (modulo symmetry condition) entries and the (null) sample covariance matrices $n^{-1}X^*X$ with independent entries of $m\times n$…
The Moser-Trudinger embedding has been generalized in [Adimurthi A.; Sandeep K., A singular Moser-Trudinger embedding and its applications, \textit{NoDEA Nonlinear Differential Equations Appl.}, 13 (2007), no. 5-6, 585--603] to the…
We observe a sample of $n$ independent $p$-dimensional Gaussian vectors with Toeplitz covariance matrix $ \Sigma = [\sigma_{|i-j|}]_{1 \leq i,j \leq p}$ and $\sigma_0=1$. We consider the problem of testing the hypothesis that $\Sigma$ is…
We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
Two results concerning the number of threshold functions $P(2, n)$ and the probability ${\mathbb P}_n$ that a random $n\times n$ Bernoulli matrix is singular are established. We introduce a supermodular function $\eta^{\bigstar}_n : 2^{{\bf…
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented.…