English
Related papers

Related papers: On Nonnegative Integer Matrices and Short Killing …

200 papers

Let $N_n$ be an $n\times n$ complex random matrix, each of whose entries is an independent copy of a centered complex random variable $z$ with finite non-zero variance $\sigma^{2}$. The strong circular law, proved by Tao and Vu, states that…

Probability · Mathematics 2020-06-02 Vishesh Jain

A real square matrix $A$ of order $n \times n~ (n \geq 3)$ is called an $F_0$-matrix, if it is a $Z$-matrix (off-diagonal entries nonpositive), all of whose principal submatrices of orders at most $n-2$ are $M$-matrices while there is at…

Rings and Algebras · Mathematics 2023-05-10 Samir Mondal , K. C. Sivakumar

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Combinatorics · Mathematics 2018-05-11 Erik Thörnblad , Jakob Zimmermann

An MDS matrix is a matrix whose minors all have full rank. A question arising in coding theory is what zero patterns can MDS matrices have. There is a natural combinatorial characterization (called the MDS condition) which is necessary over…

Discrete Mathematics · Computer Science 2018-03-22 Shachar Lovett

A nonnegative matrix $A$ is said to be {\it primitive} if for some positive integer $m$, entries in $A^m$ are positive, notationally represented as $A^m>0.$ The smallest such $m$ is called the {\it exponent} of $A$, denoted $exp(A).$ For…

Combinatorics · Mathematics 2019-03-26 Monimala Nej , A. Satyanarayana Reddy

For any prime number $p$, positive integers $m, k, n$ satisfying ${\rm gcd}(p,n)=1$ and $\lambda_0\in \mathbb{F}_{p^m}^\times$, we prove that any $\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\mathbb{F}_{p^m}$…

Information Theory · Computer Science 2017-08-30 Yuan Cao , Yonglin Cao , Fang-Wei Fu

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

Rings and Algebras · Mathematics 2021-12-15 Rod Gow

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

Symbolic Computation · Computer Science 2014-12-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

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

We construct a new class of exact string solutions with a four dimensional target space metric of signature ($-,+,+,+$) by gauging the independent left and right nilpotent subgroups with `null' generators of WZNW models for rank 2…

High Energy Physics - Theory · Physics 2009-09-17 C. Klimcik , A. A. Tseytlin

We say that a list $\Lambda =\{ \lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers is realizable, if it is the spectrum of a nonnegative matrix $A$ (the realizing matrix). We say that $\Lambda $ is universally realizable if it is…

Spectral Theory · Mathematics 2020-03-20 Ana I. Julio , Ricardo L. Soto

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…

Representation Theory · Mathematics 2024-06-12 Hao Liang

Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Manfred Droste , Werner Kuich

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

Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…

Rings and Algebras · Mathematics 2007-05-23 G. Corach , D. Stojanoff

Let $A$ be the algebra of all $n \times n$ matrices with entries from $\RR[x_1,\ldots,x_d]$ and let $G_1,\ldots,G_m,F \in A$. We will show that $F(a)v=0$ for every $a \in \RR^d$ and $v \in \RR^n$ such that $G_i(a)v=0$ for all $i$ if and…

Algebraic Geometry · Mathematics 2018-04-24 Jaka Cimpric

An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with norm…

Symbolic Computation · Computer Science 2010-10-12 Jingwei Chen , Yong Feng , Xiaolin Qin , Jingzhong Zhang

It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…

Rings and Algebras · Mathematics 2024-05-29 Vítězslav Kala , Tomáš Kepka , Miroslav Korbelář

We show that if a list of nonzero complex numbers $\sigma=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is the nonzero spectrum of a diagonalizable nonnegative matrix, then $\sigma$ is the nonzero spectrum of a diagonalizable nonnegative matrix…

Spectral Theory · Mathematics 2018-05-18 Thomas J. Laffey , Helena Šmigoc

An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their…

Data Structures and Algorithms · Computer Science 2014-07-01 Carl Barton , Alice Heliou , Laurent Mouchard , Solon P. Pissis