相关论文: M-matrices satisfy Newton's inequalities
The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton's method for general quintic polynomials to the case…
The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear…
This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…
Utilizing the notion of positive multilinear mappings, we give some matrix inequalities. In particular, Choi--Davis--Jensen and Kantorovich type inequalities including positive multilinear mappings are presented.
The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…
Some natural inequalities related to rearrangement in matrix products can also be regarded as extensions of classical inequalities for sequences or integrals. In particular, we show matrix versions of Chebyshev and Kantorovich type…
Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…
In this note, we show that for each minimal norm $N(\cdot)$ on the algebra $M_n$ of all $n \times n$ complex matrices, there exist norms $\|\cdot\|_1$ and $\|\cdot\|_2$ on ${\mathbb C}^n$ such that $$N(A)=\max\{\|Ax\|_2: \|x\|_1=1, x\in…
We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in…
We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.
Investigating the CKM matrix in different parametrization schemes, it is noticed that those schemes can be divided into a few groups where the sine values of the CP phase for each group are approximately equal. Using those relations,…
We give sufficient conditions of the nonnegative inverse eigenvalue problem (NIEP) for normal centrosymmetric matrices. These sufficient conditions are analogous to the sufficient conditions of the NIEP for normal matrices given by Xu [16]…
We explore a class of centrosymmetric matrices whose entries are polynomials in two variables, referred to as DNA matrices. Our motivation stems from an unexpected connection between these matrices and invariant polynomials under the action…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…