English
Related papers

Related papers: On the class of matrices with rows that weakly dec…

200 papers

Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…

Spectral Theory · Mathematics 2018-04-17 Ana I. Julio , Ricardo L. Soto

Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an absolute value equation. It is equivalent to the general linear complementarity problem, and thus NP hard…

Numerical Analysis · Mathematics 2021-03-04 Lutz Lehmann , Manuel Radons , Siegfried M. Rump , Christian Strohm

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

Combinatorics · Mathematics 2007-05-23 Miodrag Živković

We show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is…

Combinatorics · Mathematics 2007-05-23 Ercan Altinisik , Bruce E. Sagan , Naim Tuglu

Reciprocal matrices are tridiagonal matrices $(a_{ij})_{i,j=1}^n$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For these matrices, criteria are established under which their Kippenhahn curves…

Functional Analysis · Mathematics 2024-07-02 Muyan Jiang , Ilya M. Spitkovsky

Let $\chi(A)$ denote the characteristic polynomial of a matrix $A$ over a field; a standard result of linear algebra states that $\chi(A^{-1})$ is the reciprocal polynomial of $\chi(A)$. More formally, the condition $\chi^n(X)…

Combinatorics · Mathematics 2015-10-09 Yaroslav Shitov

In this document the author proves that several problems in data-driven numerical approximation of dynamical systems in $\mathbb{C}^n$, can be reduced to the computation of a family of constrained matrix representations of elements of the…

Operator Algebras · Mathematics 2019-06-13 Fredy Vides

A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…

Combinatorics · Mathematics 2025-09-16 Artem Malko , Igor Spiridonov

Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let ${\cal A}(R,S)$ be the class of all $(0,1)$-matrices having row sum $R$ and column sum $S$. For a positive integer $t$, the…

Combinatorics · Mathematics 2019-04-26 Rosário Fernandes , Henrique F. da Cruz , Susana Palheira

We prove that the range of a symmetric matrix over F_2 contains the vector of its diagonal elements. We apply the theorem to a generalization of the "Lights Out" problem on graphs.

Rings and Algebras · Mathematics 2012-06-15 Igor Minevich

Let $A=(a_{j,k})_{j,k \ge 1}$ be a non-negative matrix. In this paper, we characterize those $A$ for which $\|A\|_{\ell_p,\ell_q}$ are determined by their actions on non-negative decreasing sequences, where one of $p$ and $q$ is 1 or…

Functional Analysis · Mathematics 2007-10-02 Chang-Pao Chen , Chun-Yen Shen , Kuo-Zhong Wang

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…

Machine Learning · Computer Science 2012-07-03 Franz Kiraly , Ryota Tomioka

We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…

Combinatorics · Mathematics 2026-03-04 Joshua Brakensiek , Manik Dhar , Jiyang Gao , Sivakanth Gopi , Matt Larson

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…

Optimization and Control · Mathematics 2024-03-08 Marcel Celaya , Stefan Kuhlmann , Robert Weismantel

Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…

Combinatorics · Mathematics 2011-12-06 Joseph P. S. Kung

We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

We investigate self-adjoint matrices $A\in\mathbb{R}^{n,n}$ with respect to their equivariance properties. We show in particular that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group…

Dynamical Systems · Mathematics 2019-09-24 Michael Dellnitz , Bennet Gebken , Raphael Gerlach , Stefan Klus

In this document we study the uniform local path connectivity of sets of $m$-tuples of pairwise commuting normal matrices with some additional constraints. More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in…

Numerical Analysis · Mathematics 2019-12-19 Fredy Vides

We prove the exactness of the reduction map from \'etale $(\phi,\Gamma)$-modules over completed localized group rings of compact open subgroups of unipotent $p$-adic algebraic groups to usual \'etale $(\phi,\Gamma)$-modules over Fontaine's…

Representation Theory · Mathematics 2011-02-22 Gergely Zábrádi

In this paper it is shown that a generalized circulant matrix underlies every weakly Coupled Map Lattice (CML), independently of the form of the coupling term. Therefore, this matrix will appear always perturbative methods are used to get…

Pattern Formation and Solitons · Physics 2009-03-25 M. Dolores Sotelo Herrera Jesus San Martin
‹ Prev 1 3 4 5 6 7 10 Next ›