相关论文: The main reasons for matrices multiplying to zero

Let $V$ be a vector space with countable dimension over a field, and let $u$ be an endomorphism of it which is locally finite, i.e. $(u^k(x))_{k \geq 0}$ is linearly dependent for all $x$ in $V$. We give several necessary and sufficient…

Seeking simple, efficient solutions of a matrix equation leads (quite circuitously) to optimizing unimodular zerofree matrices. Canonicalizing such matrices under signed-permutation double action offers an ideal application of GPUs…

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

Let K be a (commutative) field with characteristic not 2, and V be a linear subspace of n by n matrices that have at most two eigenvalues in K (respectively, at most one non-zero eigenvalue in K). We prove that the dimension of V is less…

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…

We prove that the variety defined by the determinant of the matrix of diagonals is $F$-pure for matrices of all sizes and in all positive prime characteristics. Moreover, we find a system of parameters for it.

The geometry of divisors on algebraic curves has been studied extensively over the years. The foundational results of this Brill-Noether theory imply that on a general curve, the spaces parametrizing linear series (of fixed degree and…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

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…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…

A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…

We say that a category $\mathscr{D}$ is dimension zero over a field $F$ provided that every finitely generated representation of $\mathscr{D}$ over $F$ is finite length. We show that $\textrm{Rel}(R)$, a category that arises naturally from…

We derive analytic expressions for infinite products of random 2x2 matrices. The determinant of the target matrix is log-normally distributed, whereas the remainder is a surprisingly complicated function of a parameter characterizing the…

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…

We analyze neutrino mass matrices having one texture zero, assuming that the neutrino mixing matrix has either its first (TM$_1$) or second (TM$_2$) column identical to that of the tribimaximal mixing matrix. We found that all the six…

Birkhoff polytope is the set of all bistochastic matrices (also known as doubly stochastic matrices). Bistochastic matrices form a special class of stochastic matrices where each row and column sums up to one. Permutation matrices and…

Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations…

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Given a finite set $\{M_0,\dots,M_{d-1}\}$ of nonnegative $2\times 2$ matrices and a nonnegative column-vector $V$, we associate to each $(\omega_n)\in\{0,\dots,d-1\}^\mathbb N$ the sequence of the column-vectors…