Related papers: Matrix algebra of sets and variants of decompositi…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

For a metric space $X$ we study metrics on the two copies of $X$. We define composition of such metrics and show that the equivalence classes of metrics are a semigroup $M(X)$ Our main result is that $M(X)$ is an inverse semigroup,…

A new method of metric space investigation, based on classification of its finite subspaces, is suggested. It admits to derive information on metric space properties which is encoded in metric. The method describes geometry in terms of only…

Let $F\langle X, \ast \rangle$ be the free associative algebra with involution $\ast$ over a field $F$ of characteristic zero. We study the asymptotic behavior of the sequence of $\ast$-codimensions of the T-$\ast$-ideal…

A recent generalization of Gerstenhaber's theorem on spaces of nilpotent matrices is shown to yield a new proof of the classification of linear subspaces of diagonalizable real matrices with the maximal dimension.

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…

We generalize the notions of asymptotic dimension and coarse embeddings from metric spaces to quantum metric spaces in the sense of Kuperberg and Weaver. We show that quantum asymptotic dimension behaves well with respect to metric…

We obtain the strong asymptotics of polynomials $p_n(\lambda)$, $\lambda\in\mathbb{C}$, orthogonal with respect to measures in the complex plane of the form $$ e^{-N(|\lambda|^{2s}-t\lambda^s-\overline{t\lambda}^s)}dA(\lambda), $$ where $s$…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

Let $\mathcal{A}$ be a topological Azumaya algebra of degree $mn$ over a CW complex $X$. We give conditions for the positive integers $m$ and $n$, and the space $X$ so that $\mathcal{A}$ can be decomposed as the tensor product of…

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…

In this paper we define the magnitude of metric spaces using measures rather than finite subsets as had been done previously and show that this agrees with earlier work with Leinster in arXiv:0908.1582. An explicit formula for the magnitude…