Related papers: On rank range of interval matrices
The interval numbers is the set of compact intervals of $\mathbb{R}$ with addition and multiplication operation, which are very useful for solving calculations where there are intervals of error or uncertainty, however, it lacks an…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…
We consider the matrix $A_{ij}$, whose elements are independent random variables. We calculate the mean value of the number of the elements that we need to read to find $\min_i \max_j A_{ij}$.
We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…
We give estimates for the expectation of the norm of random matrices with independent but not necessarily identically distributed entries.
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
The matrix differential equation $x'(t) = Q(t)x(t), x(0) = x_0$ is considered in the case where $Q(t)$ is an unspecified matrix function of time, with the only constraint that $Q(t)\in \mset$ for every $t$, where $\mset$ is a prescribed…
Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…
This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…
In this paper, we introduce and study the notion of phase rank. Given a matrix filled with phases, i.e., with complex entries of modulus $1$, its phase rank is the smallest possible rank for a complex matrix with the same phase, but…
Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy…
An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
We call an interval $[x,y]$ in a poset {\em small} if $y$ is the join of some elements covering $x$. In this paper, we study the chains of paths from a given arbitrary (binary) path $P$ to the maximum path having only small intervals. More…