Related papers: Uniqueness of size-2 positive semidefinite matrix …

Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general…

Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

A new class of two-level non-regular fractional factorial designs is defined. We call this class an {\it affinely full-dimensional factorial design}, meaning that design points in the design of this class are not contained in any affine…

We generalize previous results for the superplane Landau model to exhibit an explicit worldline N = 2 supersymmetry for an arbitrary magnetic field on any two-dimensional manifold. Starting from an off-shell N = 2 superfield formalism, we…

Let $S$ be a nonnegative semiring of the real line, called here a positive semiring. We study factorizations in both the additive monoid $(S,+)$ and the multiplicative monoid $(S\setminus\{0\}, \cdot)$. In particular, we investigate when,…

In this article we investigate the coprimeness properties of one and two-dimensional discrete equations, in a situation where the equations are decomposable into several factors of polynomials. After experimenting on a simple equation, we…

Finite size effects for the Ising Model coupled to two dimensional random surfaces are studied by exploiting the exact results from the 2-matrix models. The fixed area partition function is numerically calculated with arbitrary precision by…

We propose a flexible and theoretically supported framework for scalable nonnegative matrix factorization. The goal is to find nonnegative low-rank components directly from compressed measurements, accessing the original data only once or…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. The theory of operator spaces provides a set up which describes 4 norm optimal factorizations of Grothendieck's sort.…

In this paper, we tackle two important problems in low-rank learning, which are partial singular value decomposition and numerical rank estimation of huge matrices. By using the concepts of Krylov subspaces such as Golub-Kahan…

In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to…

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…