Related papers: The Truncated & Supplemented Pascal Matrix and App…

Building on the previous work of Lee et al. and Ferdinand et al. on coded computation, we propose a sequential approximation framework for solving optimization problems in a distributed manner. In a distributed computation system, latency…

We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…

We consider the recursive equation ``x(n+1)=A(n)x(n)'' where x(n+1) and x(n) are column vectors of size k and where A(n) is an irreducible random matrix of size k x k. The matrix-vector multiplication in the (max,+) algebra is defined by…

A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only…

In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding…

Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…

Truncated sum rules have been used to calculate the fundamental limits of the nonlinear susceptibilities; and, the results have been consistent with all measured molecules. However, given that finite-state models result in inconsistencies…

This paper considers the problem of updating the rank-k truncated Singular Value Decomposition (SVD) of matrices subject to the addition of new rows and/or columns over time. Such matrix problems represent an important computational kernel…

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

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…

The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…

We study three fundamental problems of Linear Algebra, lying in the heart of various Machine Learning applications, namely: 1)"Low-rank Column-based Matrix Approximation". We are given a matrix A and a target rank k. The goal is to select a…

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…

In many contexts involving ranked preferences, agents submit partial orders over available alternatives. Statistical models often treat these as marginal in the space of total orders, but this approach overlooks information contained in the…

In this work, maximum sum-rank distance (MSRD) codes and linearized Reed-Solomon codes are extended to finite chain rings. It is proven that linearized Reed-Solomon codes are MSRD over finite chain rings, extending the known result for…

Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random with replacement. These matrices have a one-to-one correspondence with the…