English
Related papers

Related papers: On Nonnegative Integer Matrices and Short Killing …

200 papers

The class of row monomial matrices (one unit and rest zeros in every row) with some non-standard operations of summation and usual multiplication is our main object. These matrices generate a space with respect to the mentioned operations.…

Formal Languages and Automata Theory · Computer Science 2022-11-21 A. N. Trahtman

Recently Blondel, Nesterov and Protasov proved that the finiteness conjecture holds for the generalized and the lower spectral radii of the sets of non-negative matrices with independent row/column uncertainty. We show that this result can…

Rings and Algebras · Mathematics 2015-11-18 Victor Kozyakin

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Combinatorics · Mathematics 2009-06-12 E. Rodney Canfield , Brendan D. McKay

Let $\Sigma_d^{++}$ be the set of positive definite matrices with determinant 1 in dimension $d\ge 2$. Identifying any two $SL_d(\mathbb{Z})$-congruent elements in $\Sigma_d^{++}$ gives rise to the space of reduced quadratic forms of…

Number Theory · Mathematics 2016-07-18 Faustin Adiceam , Evgeniy Zorin

In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…

Logic · Mathematics 2025-03-31 Igor Klep , Marcus Tressl

The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively…

Number Theory · Mathematics 2016-11-03 Yann Bugeaud , Jan-Hendrik Evertse

A ring is called a commutator ring if every element is a sum of additive commutators. In this paper we give examples of such rings. In particular, we show that given any ring R, a right R-module N, and a set X, End_R(\bigoplus_X N) and…

Rings and Algebras · Mathematics 2012-06-11 Zachary Mesyan

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

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…

Computational Complexity · Computer Science 2014-04-11 Moritz Hardt , Raghu Meka , Prasad Raghavendra , Benjamin Weitz

Let I be a finitely supported complete m-primary ideal of a regular local ring (R, m). A theorem of Lipman implies that I has a unique factorization as a *-product of special *-simple complete ideals with possibly negative exponents for…

Commutative Algebra · Mathematics 2014-01-15 William Heinzer , Mee-Kyoung Kim , Matthew Toeniskoetter

Given a positive random variable $X$, $X\ge0$ a.s., a null hypothesis $H_0:E(X)\le\mu$ and a random sample of infinite size of $X$, we construct test supermartingales for $H_0$, i.e. positive processes that are supermartingale if the null…

Methodology · Statistics 2021-09-21 Harrie Hendriks

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…

Rings and Algebras · Mathematics 2023-08-01 Peter V. Danchev , Truong Huu Dung , Tran Nam Son

We study which matrices are sums of idempotents over a field of non-zero characteristic; in particular, we prove that any such matrix, provided it is large enough, is actually a sum of five idempotents, and even of four when the field is a…

Rings and Algebras · Mathematics 2010-05-26 Clément de Seguins Pazzis

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

Group Theory · Mathematics 2014-02-26 Christopher J. Hillar , Lionel Levine , Darren Rhea

A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A…

Rings and Algebras · Mathematics 2018-08-17 Travis Baumbaugh , Felice Manganiello

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

Combinatorics · Mathematics 2020-02-07 Joyentanuj Das , Sachindranath Jayaraman , Sumit Mohanty

Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…

Group Theory · Mathematics 2015-03-23 Robert M. Guralnick , Pham Huu Tiep

We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC '81) it was shown that to compute a product of dense $U…

Data Structures and Algorithms · Computer Science 2014-03-17 Rasmus Pagh , Morten Stöckel
‹ Prev 1 8 9 10 Next ›