Related papers: Rank and fooling set size

Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…

A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Selecting the latent dimensions (ranks) in tensor factorization is a central challenge that often relies on heuristic methods. This paper introduces a rigorous approach to determine rank identifiability in probabilistic tensor models, based…

We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the…

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

A Hurwitz stable polynomial of degree $n\geq1$ has a Hadamard factorization if it is a Hadamard product (i.e. element-wise multiplication) of two Hurwitz stable polynomials of degree $n$. It is known that Hurwitz stable polynomials of…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Let $H$ be a Krull monoid with finite class group $G$ and suppose that every class contains a prime divisor. If an element $a \in H$ has a factorization $a=u_1 \cdot \ldots \cdot u_k$ into irreducible elements $u_1, \ldots, u_k \in H$, then…

We prove a variety results on tensor product factorizations of finite dimensional Hopf algebras (more generally Hopf algebras satisfying chain conditions in suitable braided categories). The results are analogs of well-known results on…

Given nonnegative integers $n$ and $d$, where $n \gg d$, what is the minimum number $r$ such that there exist linear forms $\ell_1, \ldots, \ell_r \in \mathbb{C}[x_1, \ldots, x_n]$ so that $\ell_1^d + \cdots + \ell_r^d$ is supported exactly…

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

We deduce factorization properties for a quasi-Banach module over a quasi-Banach algebra. Especially we extend a result by Hewitt and prove that if any such algebra which possess a bounded left approximate identity, then any element in the…

Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices…

Given a numerical semigroup $S = < a_1, a_2,..., a_t>$ and $s\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\ge0$. Such a factorization is {\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such…

We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…

To a graded finite-rank matrix factorisation of the difference of two homogeneous potentials one can assign two numbers, the left and right quantum dimension. The existence of such a matrix factorisation with non-zero quantum dimensions…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…