Related papers: A characterization of the mixed discriminant

A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…

For a permutation $\pi$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $\pi$. We characterize the possible derivatives of…

The matrix Fej\'er-Riesz theorem characterizes positive semidefinite matrix polynomials on the real line $\mathbb{R}$. We extend a characterization to arbitrary closed semialgebraic sets $K\subseteq \mathbb{R}$ by the use of matrix…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

We survey results concerning behavior of positivity of line bundles and possible vanishing theorems in positive characteristic. We also try to describe variation of positivity in mixed characteristic. These problems are very much related to…

We prove that the weak Hilbert property ascends along a morphism of varieties over an arbitrary field of characteristic zero, under suitable assumptions.

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices,…

Let $M$ be G-graded R-module. The idea of a graded weakly primal submodule of $M$, which is a generalization of a graded primal submodule, is introduced and discussed in this paper. Some characteristics and characterizations are assigned to…

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

Given a positive definite covariance matrix $\widehat \Sigma$, we strive to construct an optimal \emph{approximate} factor analysis model $HH^\top +D$, with $H$ having a prescribed number of columns and $D>0$ diagonal. The optimality…

We extend the minimal model theorem to the 3-dimensional schemes which are projective and have semistable reduction over the spectrum of a Dedekind ring.

Linear mixture models have proven very useful in a plethora of applications, e.g., topic modeling, clustering, and source separation. As a critical aspect of the linear mixture models, identifiability of the model parameters is…

Matrix factorization techniques have been widely used as a method for collaborative filtering for recommender systems. In recent times, different variants of deep learning algorithms have been explored in this setting to improve the task of…

The covariance matrix is well-known for its following properties: affine equivariance, additivity, independence property and full affine equivariance. Generalizing the first one leads into the study of scatter functionals, commonly used as…

A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…

The paper develops the general theory for the items in the title, assuming that the matrix is countable and cofinal.

The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…