Related papers: On the distance from a matrix to nilpotents

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that…

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…

We prove that if $\mathbb{F}$ is a field of positive odd characteristic $p,$ and $m,$ and $n$ are positive integers such that $m\geq2,$ and $n\leq p,$ every $n\times n$ nonderogatory matrix $A\in \mathbb{M}_n(\mathbb{F})$ which is sum of…

We prove that, over a field $\mathbb{F}$ of odd characteristic $p$, a companion matrix $C$ is the sum of $E$ and $N$, with $E$ $p$-potent (i.e. $E^p = E$,) and $N$ nilpotent, if and only if the trace of $C$ is an integer multiple of unity…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

The algebra of ${\rm GL}_n$-invariants of $m$-tuples of $n\times n$ matrices with respect to the action by simultaneous conjugation is a classical topic in case of infinite base field. On the other hand, in case of a finite field generators…

Applications in machine learning and data mining require computing pairwise Lp distances in a data matrix A. For massive high-dimensional data, computing all pairwise distances of A can be infeasible. In fact, even storing A or all pairwise…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

Let $k$ be an algebraically closed field of characteristic $p >0$. We consider the variety of nilpotent pairs $(A,B)$ with $[A,B]=\lambda I$, namely the set of pairs $ X = \{ (A,B) \in M_n(k) \times M_n(k) \mid A,B \text{ nilpotent},…

Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…

For a complex nilpotent finite dimensional Lie algebra of matrices,and a Jordan-H\"older basis of it, we prove a spectral radius formula which extends a well-known result for commuting matrices.

Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\]…

A result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map be two groups is close to a homomorphism implies a tight lower bound on the distance between the multiplication tables of two non-isomorphic groups.

For any sequence of matrix algebras that converge to a coadjoint orbit we give explicit formulas that show that the distances between the matrix algebras (viewed as quantum metric spaces) converges to 0. In the process we develop a general…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…