相关论文: On the matrix equation XA-AX=X^p

This present paper provides the absolutely necessary corrections to the previous work entitled {\it A polynomial Time Algorithm to Solve The Max-atom Problem} (arXiv:2106.08854v1). The max-atom-problem (MAP) deals with system of scalar…

The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive…

We consider the Verhulst logistic equation and a couple of forms of the corresponding logistic maps. For the case of the logistic equation we show that using the general Riccati solution only changes the initial conditions of the equation.…

We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…

Let G(A) be an AF-algebra given by periodic Bratteli diagram with the incidence matrix A in GL(n, Z). For a given polynomial p(x) in Z[x] we assign to G(A) a finite abelian group Z^n/p(A) Z^n. It is shown that if p(0)=1 or p(0)=-1 and…

It is well-known that the finite-gap solutions of the KdV equation can be generated by its recursion operator.We generalize the result to a special form of Lax pair, from which a method to constrain the integrable system to a…

An ordinary differential equation is said to have a superposition formula if its general solution can be expressed as a function of a finite number of particular solution. Nonlinear ODE's with superposition formulas include matrix Riccati…

This paper deals with the partial solution of the energy-eigenvalue problem for one-dimensional Schr\"odinger operators of the form $H_N=X_0^2+V_N$, where $V_N=X_N^2+\alpha X_{N-1}$ is a polynomial potential of degree $(2N-2)$ and $X_i$ are…

Let $M_n$ denote the algebra of $n \times n$ complex matrices and let $\mathcal{A}\subseteq M_n$ be an arbitrary structural matrix algebra, i.e. a subalgebra of $M_n$ that contains all diagonal matrices. We consider injective maps $\phi :…

Problem 10 of the Landelijke Interuniversitaire Mathematische Olympiade 2010 asks for a proof that all matrices in a certain family are nilpotent. Both model solutions prove this using the Cayley-Hamilton theorem. I give a purely…

Consider the matrix power function X^p defined over the cone of positive definite matrices S^{n}_{++}. It is known that X^p is convex over S^{n}_{++} if p is in [-1,0] or [1,2] and X^p is concave over S^{n}_{++} if p is in [0,1]. We show…

Considering random matrix $X \in \mathcal M_{p,n}$ with independent columns satisfying the convex concentration properties issued from a famous theorem of Talagrand, we express the linear concentration of the resolvent $Q = (I_p -…

We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple block structure. For the special case where the second underlying matrix is a monotone anti-Monge matrix, we…

This paper deals with a complete invariant $R_X$ for cyclic quotient surface singularities. This invariant appears in the Riemann Roch and Numerical Adjunction Formulas for normal surface singularities. Our goal is to give an explicit…

We consider the unital associative algebra $\mathcal{A}$ with two generators $\mathcal{X}$, $\mathcal{Z}$ obeying the defining relation $[\mathcal{Z},\mathcal{X}]=\mathcal{Z}^2+\Delta$. We construct irreducible tridiagonal representations…

We study permutation type solutions to n-simplex equations, that is, solutions whose R matrix can be written as a product of delta- functions depending linearly on the indices. With this ansatz the D^{n(n+1)} equations of the n-simplex…

We consider the $\top$-Stein equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. In the first part of this paper, we analyze necessary and sufficient conditions for the existence and…

An orthonormal basis matrix $X$ of a subspace ${\cal X}$ is known not to be unique, unless there are some kinds of normalization requirements. One of them is to require that $X^{\rm T}D$ is positive semi-definite, where $D$ is a constant…

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b…

Let $K$ be a proper cone in $\IR^n$, let $A$ be an $n\times n$ real matrix that satisfies $AK\subseteq K$, let $b$ be a given vector of $K$, and let $\lambda$ be a given positive real number. The following two linear equations are…