相关论文: The main reasons for matrices multiplying to zero
Zero-schemes on smooth complex projective varieties, forcing all elements of ample and free linear systems to be reducible are studied. Relationships among the minimal length of such zero-schemes, the positivity of the line bundle…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
The recent T2K, MINOS and Double Chooz oscillation data hint a relatively large $\theta_{13}$, which can be accommodated by some general modification of the Tribimaximal/Bimaximal/Democratic mixing matrices. Using such matrices we analyze…
A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…
We prove that, as $n$ approaches infinity, the proportion of $n$-element matroids that are representable tends to zero.
We examine the possibility that a certain class of neutrino mass matrices, namely those with two independent vanishing minors in the flavor basis, regardless of being invertible or not, is sufficient to describe current data. We compute…
We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.
A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…
A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…
Since some years, non-overlapping sets of strings (also called cross-bifix-free sets) have had an increasing interest in the frame of the researches about Theory of Codes. Recently some non-overlapping sets of strings with variable length…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
The Zarankiewicz function gives, for a chosen matrix and minor size, the maximum number of ones in a binary matrix not containing an all-one minor. Tables of this function for small arguments have been compiled, but errors are known in…
Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…
We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note we explore an…
We investigate the zeros of two one-parameter families of harmonic functions and describe how the number of zeros depends on the parameter. Our functions have the property that all zeros lie on certain rays in the complex plane and thus we…
We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete,…
The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…
In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
We prove the existence of a genus-zero complete maximal map with a prescribed singularity set and an arbitrary number of simple and complete ends. We also discuss the conditions under which this maximal map can be made into a complete…
Using a certain Pick-type formula for the mixed volume of Cayley polyhedra, we compute the multiplicity of the isolated common zero of the maximal minors for a matrix of generic homogeneous polynomials of given degrees.