相关论文: Structure-preserving Schur methods for computing s…

In \cite{DvZa3}, we started the investigation of pseudo MV-algebras with square roots. In the present paper, we continue to study the structure of pseudo MV-algebras with square roots focusing on their new characterizations. The paper is…

We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings. The pseudo-random projection is described by a matrix, where not all entries are…

Some eigenvalue matrix models possess an interesting property: one can manifestly define the basis where all averages can be explicitly calculated. For example, in the Gaussian Hermitian and rectangular complex models, averages of the Schur…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

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…

This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…

We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…

In this work we consider a class of delay eigenvalue problems that admit a spectrum similar to that of a Hamiltonian matrix, in the sense that the spectrum is symmetric with respect to both the real and imaginary axis. More precisely, we…

In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…

A new, recursive method of calculating matrix elements of polynomial hamiltonians is proposed. It is particularly suitable for the recent algebraic studies of the supersymmetric Yang-Mills quantum mechanics in any dimensions. For the D=2…

We introduce new times in the monodromy preserving equations. While the usual times related to the moduli of complex structures of Riemann curves such as coordinates of marked points, we consider the moduli of generalized complex structures…

Real index pairings of projections and unitaries on a separable Hilbert space with a real structure are defined when the projections and unitaries fulfill symmetry relations invoking the real structure, namely projections can be real,…

We consider the set $\mathcal M_n\left(\mathbb Z; H\right)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain and asymptotic formula on the number of matrices from $\mathcal M_n\left(\mathbb Z; H\right)$ with…

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

We propose a method for solving Karush-Kuhn-Tucker (KKT) systems that exploits block triangular submatrices by first using a Schur complement decomposition to isolate the block triangular submatrices then performing a block backsolve where…

A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). Littlewood's algorithm for reducing a complex matrix to a canonical form under…

We present reduction and reconstruction procedures for the solutions of symmetric stochastic differential equations, similar to those available for ordinary differential equations. Additionally, we use the local tangent-normal…

The standard way to compute the structure constants of semi-simple Lie algebras involves the additive structure of the roots. In earlier work, I described how ideas of Jacques Tits could be applied to do this by using the structure of the…

Plane partitions have been widely studied in Mathematics since MacMahon. See, for example, the works by Andrews, Macdonald, Stanley, Sagan and Krattenthaler. The Schur process approach, introduced by Okounkov and Reshetikhin, and further…

Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current…