English
Related papers

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

200 papers

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

Number Theory · Mathematics 2023-07-13 G. J. Groenewald , G. Goosen , D. B. Janse van Rensburg , A. C. M. Ran , M. van Straaten

We study the matrix equation $XA-AX=X^p$ in $M_n(K)$ for $1< p <n$. It is shown that every matrix solution $X$ is nilpotent and that the generalized eigenspaces of $A$ are $X$-invariant. For $A$ being a full Jordan block we describe how to…

Rings and Algebras · Mathematics 2007-05-23 Dietrich Burde

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

Optimization and Control · Mathematics 2021-10-05 Alexander Barvinok , Mark Rudelson

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…

Number Theory · Mathematics 2020-04-03 Iskander Aliev

In this paper the nonlinear matrix equation X-A^{*}X^{-p}A=Q with p>0 is investigated. We consider two cases of this equation: the case p>1 and the case 0<p<1. In the case p>1, a new sufficient condition for the existence of a unique…

Numerical Analysis · Mathematics 2012-09-13 Jing Li

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

Computational Complexity · Computer Science 2011-11-10 Deepak Chermakani

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

Computational Complexity · Computer Science 2025-04-21 Arno Fehm , Manuel Bodirsky

An $n \times n$ matrix $H$ is Butson-Hadamard if its entries are $k^{\text{th}}$ roots of unity and it satisfies $HH^* = nI_n$. Write $BH(n, k)$ for the set of such matrices. Suppose that $k = p^{\alpha}q^{\beta}$ where $p$ and $q$ are…

Combinatorics · Mathematics 2019-08-19 Padraig O Cathain , Eric Swartz

In this article we present several necessary and sufficient conditions for the existence of Hermitian positive definite solutions of nonlinear matrix equations of the form $X^s + A^*X^{-t}A + B^*X^{-p}B = Q$, where $ s, t, p \geq 1$, $ A,…

Functional Analysis · Mathematics 2019-07-22 Samik Pakhira , Snehasish Bose , Sk Monowar Hossein

Let $n,\alpha\geq 2$. Let $K$ be an algebraically closed field with characteristic $0$ or greater than $n$. We show that the dimension of the variety of pairs $(A,B)\in {M_n(K)}^2$, with $B$ nilpotent, that satisfy $AB-BA=A^{\alpha}$ or…

Rings and Algebras · Mathematics 2014-08-01 Gerald Bourgeois

The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…

Symbolic Computation · Computer Science 2026-04-30 Raphaël Pagès

We study polynomials p(x) satisfying a differential equation of the form p"(x)-h'(x)p'(x)+H(x)p(x)=0, where h(x)=x^3/3+ax. We prove a conjecture of A. Eremenko and A. Gabrielov.

Quantum Algebra · Mathematics 2012-01-18 E. Mukhin , V. Tarasov

We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…

Number Theory · Mathematics 2021-12-28 Stephan Baier , Swarup Kumar Das , Saayan Mukherjee

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…

Computational Complexity · Computer Science 2007-11-09 Alfredo von Reckow

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…

Algebraic Geometry · Mathematics 2026-05-29 Abhishek Deshpande , Stefan Müller

Let $p,q$ be functions on $\mathbb{R}^{N}$ satisfying $1\ll q\ll p\ll N$, we consider $p(x)$-Laplacian problems of the form \[ \left\{ \begin{array} [c]{l}% -\Delta_{p(x)}u+V(x)\vert u\vert ^{p(x)-2}u=\lambda\vert u\vert…

Analysis of PDEs · Mathematics 2024-09-25 Shibo Liu , Chunshan Zhao

We prove regularity results for solutions of the equation \[div(< AXu,X u>^{(p-2)/2} AX u) = 0,\] $1<p<\infty$, where $X=(X_1,...,X_m)$ is a family of vector fields satisfying H\"ormander's ellipticity condition, $A$ is an $m\times m$…

Analysis of PDEs · Mathematics 2012-12-12 David Cruz-Uribe , Kabe Moen , Virginia Naibo

Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…

Numerical Analysis · Mathematics 2012-07-27 Dario A. Bini , V. Noferini

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

Classical Analysis and ODEs · Mathematics 2022-03-04 Askold Khovanskii , Sushil Singla , Aaron Tronsgard

In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…

Classical Analysis and ODEs · Mathematics 2021-11-16 Victor G. Zakharov
‹ Prev 1 2 3 10 Next ›