English
Related papers

Related papers: Nonnegativity Problems for Matrix Semigroups

200 papers

We study the seeded domino problem, the recurring domino problem and the $k$-SAT problem on finitely generated groups. These problems are generalization of their original versions on $\mathbb{Z}^2$ that were shown to be undecidable using…

Combinatorics · Mathematics 2023-12-15 Nicolás Bitar

We study Helson matrices (also known as multiplicative Hankel matrices), i.e. infinite matrices of the form $M(\alpha) = \{\alpha(nm)\}_{n,m=1}^\infty$, where $\alpha$ is a sequence of complex numbers. Helson matrices are considered as…

Functional Analysis · Mathematics 2017-08-31 Karl-Mikael Perfekt , Alexander Pushnitski

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…

Numerical Analysis · Mathematics 2013-11-21 F. Tudisco , V. Cardinali , C. Di Fiore

An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…

Optimization and Control · Mathematics 2008-04-29 Jiawang Nie , Bernd Sturmfels

A problem by Feichtinger, Heil, and Larson asks whether every infinite matrix $A$ with $\sum_{k,l}|A_{kl}| < \infty$ (an equivalent substitute for the Feichtinger algebra) that is positive-semidefinite admits a symmetric rank-one…

Functional Analysis · Mathematics 2026-05-11 Radu Balan , Fushuai Jiang

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

Combinatorics · Mathematics 2012-10-29 Hein van der Holst

Let $n\geq2$ be a natural number. Let $M_n(\mathbb{K})$ be the ring of all $n \times n$ matrices over a field $\mathbb{K}$. Fix natural number $k$ satisfying $1<k\leq n$. Under a mild technical assumption over $\mathbb{K}$ we will show that…

Rings and Algebras · Mathematics 2012-12-05 Willian Versolati Franca

This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear…

Information Theory · Computer Science 2015-10-28 Meng Wang , Weiyu Xu , Ao Tang

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Functional Analysis · Mathematics 2022-02-03 Radu Balan , Kasso A. Okoudjou , Michael Rawson , Yang Wang , Rui Zhang

A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…

Formal Languages and Automata Theory · Computer Science 2025-05-19 Lorenzo Clemente

In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…

Commutative Algebra · Mathematics 2010-06-18 V. Blanco , J. C. Rosales

We prove that over a commutative semiring every symmetric strongly invertible matrix with nonnegative numerical range has a Cholesky decomposition.

Rings and Algebras · Mathematics 2018-10-31 David Dolžan , Polona Oblak

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

Rings and Algebras · Mathematics 2026-02-10 Jun Jiao , Miaomiao Ren

Given k similarity classes of invertible matrices, the Deligne-Simpson problem asks to determine whether or not one can find matrices in these classes whose product is the identity and with no common invariant subspace. The first author…

Rings and Algebras · Mathematics 2026-04-16 William Crawley-Boevey , Andrew Hubery

In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where…

Group Theory · Mathematics 2021-01-19 Francisco Araújo , Michael Kinyon

In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz…

Optimization and Control · Mathematics 2007-05-23 Been-Der Chen , Sanjay Lall

We determine those k-tuples of conjugacy classes of matrices, from which it is possible to choose matrices which have no common invariant subspace and have sum zero. This is an additive version of the Deligne-Simpson problem. We deduce the…

Rings and Algebras · Mathematics 2007-05-23 William Crawley-Boevey

Denote by $M_n(K)$ the algebra of $n$ by $n$ matrices with entries in the field $K$. A theorem of Albert and Muckenhoupt states that every trace zero matrix of $M_n(K)$ can be expressed as $AB-BA$ for some pair $(A,B)$ of matrices of…

Rings and Algebras · Mathematics 2014-07-16 Clément de Seguins Pazzis

Let $S_{1}=\left\{F_t\right\}_{t\geq 0}$ and $S_{2}=\left\{G_t\right\}_{t\geq 0}$ be two continuous semigroups of holomorphic self-mappings of the unit disk $\Delta=\{z:|z|<1\}$ generated by $f$ and $g$, respectively. We present conditions…

Complex Variables · Mathematics 2007-05-23 Mark Elin , Marina Levenshtein , Simeon Reich , David Shoikhet

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…

Group Theory · Mathematics 2010-12-06 Paul C. Bell , Igor Potapov