English
Related papers

Related papers: On Nonnegative Integer Matrices and Short Killing …

200 papers

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$. Restricted NMF requires in…

Formal Languages and Automata Theory · Computer Science 2016-05-24 Dmitry Chistikov , Stefan Kiefer , Ines Marušić , Mahsa Shirmohammadi , James Worrell

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

Quantum Algebra · Mathematics 2014-10-20 Simon Lentner , Daniel Nett

Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative.…

Combinatorics · Mathematics 2019-06-06 David Galvin , Adrian Pacurar

It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Gupta , Ashok Kumar Mittal

We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet $\Sigma$ of cardinality $\sigma$. We show that the set $\text{MAW}(T)$ of minimal absent words of a rooted (resp.…

Data Structures and Algorithms · Computer Science 2019-10-31 Gabriele Fici , Paweł Gawrychowski

The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…

Combinatorics · Mathematics 2013-05-07 J. A. Dias da Silva , Pedro J. Freitas

For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…

Rings and Algebras · Mathematics 2024-03-26 Peter Danchev , Esther García , Miguel Gómez Lozano

The matrix semigroup membership problem asks, given square matrices $M,M_1,\ldots,M_k$ of the same dimension, whether $M$ lies in the semigroup generated by $M_1,\ldots,M_k$. It is classical that this problem is undecidable in general but…

Logic in Computer Science · Computer Science 2023-11-13 Julian D'Costa , Joel Ouaknine , James Worrell

In the setting of real square matrices, it is known that, if $A$ is a singular irreducible $M$-matrix, then the only nonnegative vector that belongs to the range space of $A$ is the zero vector. In this paper, we prove an analogue of this…

Functional Analysis · Mathematics 2023-05-10 A. M. Encinas , Samir Mondal , K. C. Sivakumar

Recently we considered a class of random matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges…

Probability · Mathematics 2020-03-10 Chin Hei Chan , Maosheng Xiong

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

Matrix grammars are one of the first approaches ever proposed in regulated rewriting, prescribing that rules have to be applied in a certain order. Originally, they have been introduced by \'Abrah\'am on linguistic grounds. In traditional…

Formal Languages and Automata Theory · Computer Science 2024-11-26 Henning Fernau , Lakshmanan Kuppusamy , Indhumathi Raman

For a real matrix $M$, we denote by $sp(M)$ the spectrum of $M$ and by $\left \vert M\right \vert $ its absolute value, that is the matrix obtained from $M$ by replacing each entry of $M$ by its absolute value. Let $A$ be a nonnegative real…

Combinatorics · Mathematics 2015-07-29 Kawtar Attas , Abderrahim Boussaïri , Mohamed Zaidi

We answer the question if the continuous product of square matrices $M(t)$ over $t\in [0,1]$ can be correctly defined. The case where all $M(t)$ are taken from a finite set $\Sigma$ is studied. We find necessary and sufficient conditions on…

Dynamical Systems · Mathematics 2016-03-03 A. Vladimirov

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Combinatorics · Mathematics 2011-03-18 Hoi H. Nguyen

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…

Combinatorics · Mathematics 2010-04-06 Alexander Barvinok , J. A. Hartigan

We study the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$ on $m$-tuples of $n \times n$ matrices with entries in an infinite field $K$. We show that invariants of degree $n^2- n$ define the null cone. Consequently,…

Representation Theory · Mathematics 2015-12-11 Harm Derksen , Visu Makam

We study the lower tail behavior of the least singular value of an $n\times n$ random matrix $M_n := M+N_n$, where $M$ is a fixed complex matrix with operator norm at most $\exp(n^{c})$ and $N_n$ is a random matrix, each of whose entries is…

Probability · Mathematics 2021-09-06 Vishesh Jain

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

A string $w$ is called a minimal absent word (MAW) for a string $S$ if $w$ does not occur as a substring in $S$ and all proper substrings of $w$ occur in $S$. MAWs are well-studied combinatorial string objects that have potential…

Data Structures and Algorithms · Computer Science 2023-08-01 Kouta Okabe , Takuya Mieno , Yuto Nakashima , Shunsuke Inenaga , Hideo Bannai