Related papers: Characterization of matrices $B$ such that $(I,B,B…
In this survey article, we describe recent work that connects three separate objects of interest: totally nonnegative matrices; quantum matrices; and matrix Poisson varieties.
This paper addresses the estimation of the latent dimensionality in nonnegative matrix factorization (NMF) with the \beta-divergence. The \beta-divergence is a family of cost functions that includes the squared Euclidean distance,…
Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…
We determine the metric dimension of the zero-divisor graph of the matrix semiring over a commutative entire antinegative semiring.
For positive semidefinite $n\times n$ matrices $A$ and $B$, the singular value inequality $(2+t)s_{j}(A^{r}B^{2-r}+A^{2-r}B^{r})\leq 2s_{j}(A^{2}+tAB+B^{2})$ is shown to hold for $r=\frac{1}{2}, 1, \frac{3}{2}$ and all $-2<t\leq 2$.
We describe a way of representing finite biquandles with n elements as 2n x 2n block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can…
Wiebe's criterion, which recognizes complete intersections of dimension zero among the class of noetherian local rings, is revisited and exploited in order to provide information on what we call C.I.0-ideals (those such that the…
One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
Many quantities that characterize network elements are defined in an explicit form and calculated directly from the network structure; examples of include several centrality measures like degree, closeness, or betweenness. However, there…
A neutral network is a subgraph of a Hamming graph, and its principal eigenvalue determines its robustness: the ability of a population evolving on it to withstand errors. Here we consider the most robust small neutral networks: the graphs…
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…
Given a set of $n$ distinct real numbers, our goal is to form a symmetric, unreduced, tridiagonal, matrix with those numbers as eigenvalues. We give an algorithm which is a stable implementation of a naive algorithm forming the…
We prove that finite-index conformal nets are fully dualizable objects in the 3-category of conformal nets. Therefore, assuming the cobordism hypothesis applies, there exists a local framed topological field theory whose value on the point…
Let $so_3(K)$ be the Lie algebra of $3\times 3$ skew-symmetric matrices over a field $K$ of characteristic 0. The ideal $I(M_3(K),so_3(K))$ of the weak polynomial identities of the pair $(M_3(K),so_3(K))$ consists of the elements…
We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…
We give an online algorithm and prove novel mistake and regret bounds for online binary matrix completion with side information. The mistake bounds we prove are of the form $\tilde{O}(D/\gamma^2)$. The term $1/\gamma^2$ is analogous to the…