Related papers: Non-Expansive Matrix Based number Systems

For a given polynomial $V(x)\in \mathbb C[x]$, a random matrix eigenvalues measure is a measure $\prod_{1\leq i<j\leq N}(x_i-x_j)^2 \prod_{i=1}^N e^{-V(x_i)}dx_i$ on $\gamma^N$. Hermitian matrices have real eigenvalues $\gamma=\mathbb R$,…

In a Euclidean Jordan algebra V of rank n which carries the trace inner product, to each element x we associate the eigenvalue vector whose components are the eigenvalues of x written in the decreasing order. For any number p between (and…

Let $\lambda$ be a partition of an integer $n$ and ${\mathbb F}_q$ be a finite field of order $q$. Let $P_\lambda(q)$ be the number of strictly upper triangular $n\times n$ matrices of the Jordan type $\lambda$. It is known that the…

We study the minimizers of the sum of the principal Dirichlet eigenvalue of the negative Laplacian and the perimeter with respect to a general norm in the class of Jordan domains in the plane. This is equivalent (modulo scaling) to…

Invariant subspaces of a matrix $A$ are considered which are obtained by truncation of a Jordan basis of a generalized eigenspace of $A$. We characterize those subspaces which are independent of the choice of the Jordan basis. An…

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices over a field $\mathbb{F}$ of characteristic not equal to $2$. If $n\ge 2$, we show that an arbitrary map $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$ is Jordan multiplicative,…

Given a Jordan algebra $A$ and a vector space $V$, we describe and classify all Jordan algebras containing $A$ as a subalgebra of codimension ${\rm dim}_k (V)$ in terms of a non-abelian cohomological type object ${\mathcal J}_{A} \, (V, \,…

In this paper, we study the algebraic formula complexity of multiplying $d$ many $2\times 2$ matrices, denoted $\mathrm{IMM}_{d}$, and show that the well-known divide-and-conquer algorithm cannot be significantly improved at any depth, as…

We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}= \bigcup_{a \in\mathcal{A} } A_{a}$ where…

Let $A\in\mathbb C^{n\times n}$ and let $\mathcal X\subset \mathbb C^n$ be an $A$-invariant subspace with $\dim \mathcal X=d\geq 1$, corresponding to exterior eigenvalues of $A$. Given an initial subspace $\mathcal V\subset \mathbb C^n$…

We study the smallest eigenvalue statistics of the $\beta$-Laguerre and $\beta$-Jacobi ensembles. Using Kaneko's integral formula, we show that the smallest eigenvalue marginal density and distribution functions of the two ensembles for any…

Let J and J' be Jordan rings. We prove under some conditions that if J contains a nontrivial idempotent, then n-multiplicative maps and n-multiplicative derivations from J to J' are additive maps.

Let $X$ be an open subset of $\Bbb C^N$, and let $A$ be an $n\times n$ matrix of holomorphic functions on $X$. We call a point $\xi\in X$ $\mathbf{Jordan}$ $\mathbf{stable}$ for $A$ if $\xi$ is not a splitting point of the eigenvalues of…

We consider the problem of preprocessing an $n\times n$ matrix $\mathbf{M}$, and supporting queries that, for any vector $v$, returns the matrix-vector product $\mathbf{M} v$. This problem has been extensively studied in both theory and…

A 0-1 matrix $M$ is saturating for a 0-1 matrix $P$ if $M$ does not contain a submatrix that can be turned into $P$ by flipping any number of its $1$-entries to $0$-entries, and changing any $0$-entry to $1$-entry of $M$ introduces a copy…

We study the time complexity of computing the $(\min,+)$ matrix product of two $n\times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the first matrix and the columns of the second matrix can be…

In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…

This paper is devoted to the study of preservation of eigenvalues, Jordan structure and complementary invariant subspaces of structured matrices under structured perturbations. Perturbations and structure-preserving perturbations are…

An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that…

Let $\mathfrak{M}(\mathbb{D}, m, n, P)$ be the ring of all $m \times n$ matrices over a division ring $\mathbb{D}$, with the product given by $A \bullet B=A P B$, where $P$ is a fixed $n \times m$ matrix over $\mathbb{D}$. When $2\leq m, n…