Related papers: The Problem with the Linpack Benchmark Matrix Gene…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
Let $L\subset \mathbb{Z}^n$ be a lattice and $I_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle$ be the corresponding lattice ideal in $\Bbbk[x_1,\ldots, x_n]$, where $\Bbbk$ is a field. In this paper we describe minimal…
We give a closed form for the correlation functions of ensembles of a class of asymmetric real matrices in terms of the Pfaffian of an antisymmetric matrix formed from a $2 \times 2$ matrix kernel associated to the ensemble. We apply this…
We present a framework to understand GAN training as alternating density ratio estimation and approximate divergence minimization. This provides an interpretation for the mismatched GAN generator and discriminator objectives often used in…
We compare Monte Carlo event generators dedicated to simulating the production and decay of extra-dimensional black holes at the Large Hadron Collider.
Large Language Models (LLMs) can achieve strong performance on everyday coding tasks, but they can fail on complex tasks that require non-trivial reasoning about program semantics. Finding training examples to teach LLMs to solve these…
We study a class of holomorphic matrix models. The integrals are taken over middle dimensional cycles in the space of complex square matrices. As the size of the matrices tends to infinity, the distribution of eigenvalues is given by a…
This article discusses some difficulties in the implementation of combinatorial algorithms associated with the choice of all elements with certain properties among the elements of a set with great cardinality.The problem has been resolved…
In this paper, we consider the problem of generating a set of counterfactual explanations for a group of instances, with the one-for-many allocation rule, where one explanation is allocated to a subgroup of the instances. For the first…
As quantum computers continue to increase in size and topological complexity, benchmarking crosstalk becomes more complex and resource-intensive. This limits the ability to obtain relevant crosstalk metrics for applications such as error…
It follows from Grothendieck's little inequality that to any complex (m x n) matrix X of column norm at most 1, and an 0 <e <1, there exist a natural number q, an (m x q) matrix C with $(1-e)^2 \leq CC^* \leq (4/\pi) (1 + e)^2$ and an (q x…
We construct a binary mutation invariant for skew-symmetric integer matrices. The invariant is not an integer congruence invariant for matrices of odd size: we provide examples of congruent such matrices with different values for the…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
An Ingletonian polymatroid satisfies, in addition to the polymatroid axioms, the inequalities of Ingleton (Combin. Math. Appln., 1971). These inequalities are required for a polymatroid to be representable. It is has been an open question…
Brief review of concepts and unsolved problems in the theory of matrix models.
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
We show 2 matrices that have identical eigenvalues but different eigenfunctions. This shows that in obtaining two body nuclear matrix elements empirically, it is not sufficient to consider only energy levels. Other quantities like…
Many scientific computing problems can be reduced to Matrix-Matrix Multiplications (MMM), making the General Matrix Multiply (GEMM) kernels in the Basic Linear Algebra Subroutine (BLAS) of interest to the high-performance computing…
Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…
We apply a novel method for the equivalence group and its infinitesimal generators to the investigation of invariants of linear ordinary differential equations. First, a comparative study of this method is illustrated by an example. Next,…