English
Related papers

Related papers: Matrix evaluations of noncommutative rational func…

200 papers

One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…

Operator Algebras · Mathematics 2011-12-30 J. William Helton , Igor Klep , Scott McCullough

An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell,k} = 0$ for every $k\ne \ell$. Dietzfelbinger, Hromkovi{\v{c}}, and Schnitger (1996) showed that $n…

Combinatorics · Mathematics 2014-01-17 Mirjam Friesen , Aya Hamed , Troy Lee , Dirk Oliver Theis

We study non-linear surjective mappings on subsets of ${\cal M}_n(F)$, which preserve the zeros of some fixed polynomials in noncommuting variables. Keywords: Matrix algebra, Multilinear polynomials, Preservers.

Rings and Algebras · Mathematics 2010-03-12 A. Guterman , B. Kuzma

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…

Numerical Analysis · Mathematics 2022-09-05 Margherita Porcelli , Valeria Simoncini

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We prove that for all integers $k \geq 1$, there exists a constant $C_k$ depending only on $k$ such that for all $q > C_k$ and for all $n \geq 1$ every matrix in $M_n(\mathbb F_q)$ is a sum of two $k$th powers.

Group Theory · Mathematics 2023-05-08 Krishna Kishore , Anupam Singh

Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…

Numerical Analysis · Mathematics 2012-04-16 Vanni Noferini

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Combinatorics · Mathematics 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

In this paper we study Waring numbers $g_R(k)$ for $(R,\frak m)$ a finite commutative local ring with identity and $k \in \mathbb{N}$ with $(k,|R|)=1$. We first relate the Waring number $g_R(k)$ with the diameter of the Cayley graphs…

Commutative Algebra · Mathematics 2023-06-16 Ricardo A. Podestá , Denis E. Videla

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

Data Structures and Algorithms · Computer Science 2017-04-10 Zeyuan Allen-Zhu , Yuanzhi Li , Rafael Oliveira , Avi Wigderson

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

Combinatorics · Mathematics 2013-05-14 Mirjam Friesen , Dirk Oliver Theis

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

Combinatorics · Mathematics 2018-04-06 Yaroslav Shitov

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$ matrix $H$. A longstanding open…

Computational Complexity · Computer Science 2017-03-24 Dmitry Chistikov , Stefan Kiefer , Ines Marušić , Mahsa Shirmohammadi , James Worrell

Consider a linear programming problem with n primal and m dual variables paired with n dual and m primal slack variables respectively, and aggregately denote these variables and slack variables as a vector z of length 2(n+m). Unlike…

Optimization and Control · Mathematics 2026-05-20 Wei Jing-Yuan

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

Rings and Algebras · Mathematics 2007-05-23 A. P. Petravchuk , O. G. Iena

We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…

Logic in Computer Science · Computer Science 2023-04-20 Ruiwen Dong

Let $K$ be an algebraically closed field of characteristic $0$ and let $M_n(K)$, $n \ge 3$, be the matrix ring over $K$. We will show that the image of any multilinear polynomial in four variables evaluated on $M_n(K)$ contains all matrices…

Rings and Algebras · Mathematics 2015-11-20 David Buzinski , Robin Winstanley

$K$ is an algebraically closed field with characteristic $0$ and $f$ is a polynomial or a holomorphic function. We study all solutions of the equation $XA-AX=f(X)$, in the unknown $X\in M_n(K)$, when $A\in M_n(K)$ is diagonalizable.

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

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

Commutative Algebra · Mathematics 2019-02-12 Evgueni Doubtsov , Frank Kutzschebauch