Related papers: Explicit Description of Centralizers for a Matrix

Given a metric space, the $(k,z)$-clustering problem consists of finding $k$ centers such that the sum of the of distances raised to the power $z$ of every point to its closest center is minimized. This encapsulates the famous $k$-median…

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

This paper presents a comprehensive theoretical investigation into the parameterized complexity of explanation problems in various machine learning (ML) models. Contrary to the prevalent black-box perception, our study focuses on models…

For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.

Let ||.|| be a norm on the algebra M_n of all n-by-n matrices over the complex field C. An interesting problem in matrix theory is that "are there two norms ||.||_1 and ||.||_2 on C^n such that ||A||=max{||Ax||_2: ||x||_1=1} for all A in…

In the $k$-median problem, given a set of locations, the goal is to select a subset of at most $k$ centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of…

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…

We analyze the precision of the characteristic polynomial of an $n\times n$ p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time…

We pursue an analogy of the Schur-Weyl reciprocity for the spinor groups and pick up the irreducible spin representations in the tensor space $\Delta \textstyle{\bigotimes \bigotimes^k V}$. Here $\Delta$ is the fundamental representation of…

We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring $\mathbb{C}[x]/I$ associated to a zero-dimensional ideal $I$ generated by $n$ $\mathbb{C}$-polynomials in $n$ variables. We assume…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…

The metric $k$-median problem is a textbook clustering problem. As input, we are given a metric space $V$ of size $n$ and an integer $k$, and our task is to find a subset $S \subseteq V$ of at most $k$ `centers' that minimizes the total…

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…

Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decimation' scheme that maps it to neural network models of…

Matrix diagonalization is at the cornerstone of numerous fields of scientific computing. Diagonalizing a matrix to solve an eigenvalue problem requires a sequential path of iterations that eventually reaches a sufficiently converged and…

The aim of this work is to construct a monomial and explicit basis for the space $M_{\mu}$ relative to the $n!$ conjecture. We succeed completely for hook-shaped partitions, i.e. $\mu=(K+1,1^L)$. We are indeed able to exhibit a basis and to…

The primary purpose of this note is to prove two recent conjectures concerning the $n$ body matrix that arose in recent papers of Escobar-Ruiz, Miller, and Turbiner on the classical and quantum $n$ body problem in $d$-dimensional space.…

For a diagonalizable monoid scheme $A(M)_S$ acting on an algebraic space $X$, we introduce for any submonoid $N$ of $M$ an attractor space $X^N$. We then investigate and study various aspects of attractors associated to monoids.