English
Related papers

Related papers: Solutions of the matrix equation $p(X)=A$, with po…

200 papers

We analyze the perturbation series for noncommutative eigenvalue problem $AX=X\lambda$ where $\lambda$ is an element of a noncommutative ring, $ A$ is a matrix and $X$ is a column vector with entries from this ring. As a corollary we obtain…

High Energy Physics - Theory · Physics 2007-05-23 Albert Schwarz

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

Commutative Algebra · Mathematics 2021-09-14 Amir Jafari , Amin Najafi Amin

A Lyapunov matrix equation can be converted, by using the Jordan decomposition theorem for matrices, into an equivalent Lyapunov matrix equation where the matrix is a Jordan matrix. The Lyapunov matrix equation with Jordan matrix can be…

Rings and Algebras · Mathematics 2019-05-10 Dan Comănescu

We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatizable unless P = NP. Indeed, we show it is…

Computational Complexity · Computer Science 2019-09-10 Albert Atserias , Moritz Müller

We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…

Representation Theory · Mathematics 2021-01-28 Maxim Gurevich

In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…

Computational Complexity · Computer Science 2023-02-20 Malay Dutta , Anjana K. Mahanta

We find all polynomials solutions $P_n(x)$ of the abstract "hypergeometric" equation $L P_n(x) = \lambda_n P_n(x)$, where $L$ is a linear operator sending any polynomial of degree $n$ to a polynomial of the same degree with the property…

Classical Analysis and ODEs · Mathematics 2014-01-28 Alexei Zhedanov

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

Computational Complexity · Computer Science 2018-08-27 Anatoly Panyukov

In this paper, we are concerned with the following equation involving higher-order fractional Lapalacian \begin{equation*} \left\{\begin{aligned} &(-\Delta)^{p+{\frac{\alpha}{2}}}u(x)=u_+^\gamma~~ \mbox{ in }\mathbb{R}^n,\\…

Analysis of PDEs · Mathematics 2022-02-04 Zhuoran Du , Zhenping Feng , Jiaqi Hu , Yuan Li

We consider solutions of Lagrangian variational problems with linear constraints on the derivative. These solutions are given by curves $\gamma$ in a differentiable manifold $M$ that are everywhere tangent to a smooth distribution $\mathcal…

Optimization and Control · Mathematics 2007-05-23 Paolo Piccione , Daniel V. Tausk

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

Complex Variables · Mathematics 2008-06-16 Elin Götmark

Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…

Rings and Algebras · Mathematics 2025-07-10 Vitalij A. Chatyrko , Alexandre Karassev

In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…

Rings and Algebras · Mathematics 2026-01-27 Somphong Jitman , Wannarut Rungrottheera

This paper is concerned with the positive definite solutions to the matrix equation $X+A^{\mathrm{H}}\bar{X}^{-1}A=I$ where $X$ is the unknown and $A$ is a given complex matrix. By introducing and studying a matrix operator on complex…

Numerical Analysis · Mathematics 2016-07-11 Bin Zhou , Guang-Bin Cai , James Lam

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…

Geometric Topology · Mathematics 2021-10-07 Leonard R. Rubin , Vera Tonić

Using a variational technique we guarantee the existence of a solution to the \emph{resonant Lane-Emden} problem $-\Delta_p u=\lambda |u|^{q-2}u$, $u|_{\partial\Omega}=0$ if and only if a solution to $-\Delta_p u=\lambda |u|^{q-2}u+f$,…

Analysis of PDEs · Mathematics 2016-02-01 Ratan K. Giri , D. Choudhuri

In this paper we study the {\it bilinear assignment problem} (BAP) with size parameters $m$ and $n$, $m\leq n$. BAP is a generalization of the well known quadratic assignment problem and the three dimensional assignment problem and hence…

Optimization and Control · Mathematics 2016-05-25 Ante Ćustić , Vladyslav Sokol , Abraham P. Punnen , Binay Bhattacharya

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

Polynomial $n\times n$ matrices $A(\lambda)$ and $B(\lambda)$ over a field $\mathbb F $ are called semi-scalar equivalent if there exist a nonsingular $n\times n$ matrix $P$ over the field $\mathbb F $ and an invertible $n\times n$ matrix…

Commutative Algebra · Mathematics 2020-03-12 V. M. Prokip
‹ Prev 1 4 5 6 7 8 10 Next ›