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

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…

We give a new method for calculation of complex and biHermitian structures on low dimensional real Lie algebras. In this method, using non-coordinate basis, we first transform the Nijenhuis tensor field and biHermitian structure relations…

We study some properties of quadratic forms with values in a field whose underlying vector spaces are endowed with the structure of right vector spaces over a division ring extension of that field. Some generalized notions of isotropy,…

Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…

This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber…

Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…

By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…

We prove a formula for the image of a skew Schur polynomial $s_{\lambda/\mu}\left( x_{1}, x_{2}, \ldots, x_{N}\right) $ under the differential operator $\nabla:= \dfrac{\partial}{\partial x_{1}} +\dfrac{\partial}{\partial…

Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…

The paper provides a study of pseudo MV-algebras with square roots. We introduce different notions of a square root on a pseudo MV-algebra, and present their main properties. We show that the class of pseudo-MV-algebras with square roots is…

A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…

Pseudo $H$-type Lie algebras are a special class of 2-step nilpotent metric Lie algebras, intimately related to Clifford algebras $\Cl_{r,s}$. In this work we propose the classification method for integral orthonormal structures of pseudo…

In this work, we are presenting an efficient way to compute the geometric mean of two positive definite matrices times a vector. For this purpose, we are inspecting the application of methods based on Krylov spaces to compute the square…

We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…

We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…

Employing the random matrix formulation of Chern-Simons theory on Seifert manifolds, we show how the Stieltjes-Wigert orthogonal polynomials are useful in exact computations in Chern-Simons matrix models. We construct a biorthogonal…

Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…

We present a single operation for constructing skew diagrams whose corresponding skew Schur functions are equal. This combinatorial operation naturally generalises and unifies all results of this type to date. Moreover, our operation…

A description of the real, complete modules over the Clifford algebra of a Hilbert space, with the elements of the latter acting by skew-symmetric operators.

Reiner, Shaw and van Willigenburg showed that if two skew Schur functions s_A and s_B are equal, then the skew shapes A and B must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a…