Related papers: The Problem with the Linpack Benchmark Matrix Gene…
The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…
Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
Recent advancements in ultra-low-power machine learning (TinyML) hardware promises to unlock an entirely new class of smart applications. However, continued progress is limited by the lack of a widely accepted benchmark for these systems.…
Generative adversarial networks are generative models that are capable of replicating the implicit probability distribution of the input data with high accuracy. Traditionally, GANs consist of a Generator and a Discriminator which interact…
We consider the problem of designing optimal $M \times N$ ($M \leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the worst-case estimation errors when only $K$…
We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods. We discuss these differences and…
Large Language Models (LLMs) have demonstrated remarkable capabilities in code generation, capable of tackling complex tasks during inference. However, the extent to which LLMs can be utilized for code checking or debugging through test…
We describe in this paper new design techniques used in the \cpp exact linear algebra library \linbox, intended to make the library safer and easier to use, while keeping it generic and efficient. First, we review the new simplified…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
In this paper, we study products of asymmetric Toeplitz matrices, we give necessary and sufficient conditions for the product of two asymmetric Toeplitz matrices compatible sizes is asymmetric Toeplitz matrix. We also give some results…
The use of generative models to sample equilibrium distributions of many-body systems, as first demonstrated by Boltzmann Generators, has attracted substantial interest due to their ability to produce unbiased and uncorrelated samples in…
Due to their data-driven nature, Machine Learning (ML) models are susceptible to bias inherited from data, especially in classification problems where class and group imbalances are prevalent. Class imbalance (in the classification target)…
The Rank Minimization Problem asks to find a matrix of lowest rank inside a linear variety of the space of n x n matrices. The Low Rank Matrix Completion problem asks to complete a partially filled matrix such that the resulting matrix has…
Inequalities for norms of different versions of the geometric mean of two positive definite matrices are presented.
The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
Generative adversarial networks (GANs) have proven effective in modeling distributions of high-dimensional data. However, their training instability is a well-known hindrance to convergence, which results in practical challenges in their…