Related papers: On the Right Eigenvalues of the Quaternionic Matri…
We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…
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.
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
Dual quaternions can represent rigid body motion in 3D spaces, and have found wide applications in robotics, 3D motion modelling and control, and computer graphics. In this paper, we introduce three different right linear independency for a…
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…
It is shown that monic orthogonal polynomials on the unit circle are the characteristic polynomials of certain five-diagonal matrices depending on the Schur parameters. This result is achieved through the study of orthogonal Laurent…
Dual quaternion/complex matrices have important applications in brain science and multi-agent formation control. In this paper, we first study some basic properties of determinants of dual complex matrices, including Sturm theorem and…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…
Starting with a quaternion difference equation with boundary conditions, a parameterized sequence which is complete in finite dimensional quaternion Hilbert space is derived. By employing the parameterized sequence as the kernel of discrete…
We obtain a complete characterization of the $2\times 2$ symplectic matrices having an infinite number of left eigenvalues. Previously, we give a new proof of a result from Huang and So about the number of eigenvalues of a quaternionic…
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…
The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
We derive bounds on the eigenvalues of saddle-point matrices with singular leading blocks. The technique of proof is based on augmentation. Our bounds depend on the principal angles between the ranges or kernels of the matrix blocks.…