English
Related papers

Related papers: On the distance from a matrix to nilpotents

200 papers

Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugates of any number a from K in terms of the Mahler measure M(a) of a. In the case that K is a cubic field, our bound is best possible in terms…

Number Theory · Mathematics 2023-09-19 Jan-Hendrik Evertse

Suppose that the $n^2$ vertices of the grid graph $P_n^2$ are labeled, such that the set of their labels is $\{1,2,\ldots,n^2\}$. The labeling induces a walk on $P_n^2$, beginning with the vertex whose label is $1$, proceeding to the vertex…

Combinatorics · Mathematics 2023-11-29 Sela Fried

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

Probability · Mathematics 2014-08-18 Sean O'Rourke , Alexander Soshnikov

We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…

Computational Geometry · Computer Science 2009-09-30 Christian Knauer , Maarten Löffler , Marc Scherfenberg , Thomas Wolle

Let $\N_n$ be the set of nilpotent $n$ by $n$ matrices over an algebraically closed field $k$. For each $r\ge 2$, let $C_r(\N_n)$ be the variety consisting of all pairwise commuting $r$-tuples of nilpotent matrices. It is well-kown that…

Representation Theory · Mathematics 2013-08-13 Robert M. Guralnick , Nham V. Ngo

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

We confirm the following conjecture which has been proposed in [{\em Linear Algebra and its Applications}, {\bf 436} (2012), No. 5, 1425-1435.]: $$ 0.945\approx\displaystyle\lim_{n\longrightarrow…

Combinatorics · Mathematics 2020-10-13 Alireza Abdollahi , Niloufar Zakeri

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

Combinatorics · Mathematics 2018-10-19 Cole Franks , Michael Saks

It is shown that the Kolmogorov distance between the spectral distribution function of a random covariance matrix $\frac1p XX^T$, where $X$ is a $n\times p$ matrix with independent entries and the distribution function of the…

Probability · Mathematics 2007-12-24 F. Götze , A. Tikhomirov

We provide a sufficient condition for the numerical range of a nilpotent matrix N to be circular in terms of the existence of cycles in an undirected graph associated with N. We prove that if we add to this matrix N a diagonal real matrix…

Functional Analysis · Mathematics 2019-08-01 Luís Carvalho , Cristina Diogo , Sérgio Mendes

The class of metrizable spaces $M$ with the following approximation property is introduced and investigated: $M\in AP(n,0)$ if for every $\e>0$ and a map $g\colon\I^n\to M$ there exists a 0-dimensional map $g'\colon\I^n\to M$ which is…

Geometric Topology · Mathematics 2008-01-22 Taras Banakh , Vesko Valov

We consider the convergence of the empirical spectral measures of random $N \times N$ unitary matrices. We give upper and lower bounds showing that the Kolmogorov distance between the spectral measure and the uniform measure on the unit…

Probability · Mathematics 2017-11-01 Elizabeth S. Meckes , Mark W. Meckes

In this paper, we systematically develop the $m$-contiguity distance between simplicial maps as a discrete approximation framework for homotopical complexity in the category of simplicial complexes. We construct an increasing sequence of…

Algebraic Topology · Mathematics 2026-04-16 Nilay Ekiz Yazici , Nursultan Kuanyshov , Ayse Borat

Given a matrix-valued function $\mathcal{F}(\lambda)=\sum_{i=1}^d f_i(\lambda) A_i$, with complex matrices $A_i$ and $f_i(\lambda)$ entire functions for $i=1,\ldots,d$, we discuss a method for the numerical approximation of the distance to…

Numerical Analysis · Mathematics 2025-04-11 Miryam Gnazzo , Nicola Guglielmi

Let $K, D$ be $n$-dimensional convex bodes. Define the distance between $K$ and $D$ as $$ d(K,D) = \inf \{\lambda | T K \subset D+x \subset \lambda \cdot TK \}, $$ where the infimum is taken over all $x \in R^n$ and all invertible linear…

Functional Analysis · Mathematics 2007-05-23 M. Rudelson

Let $A$ be a $m\times m$ complex matrix with zero trace and let $\e>0$. Then there are $m\times m$ matrices $B$ and $C$ such that $A=[B,C]$ and $\|B\|\|C\|\le K_\e m^\e\|A\|$ where $K_\e$ depends only on $\e$. Moreover, the matrix $B$ can…

Functional Analysis · Mathematics 2014-03-05 William B. Johnson , Narutaka Ozawa , Gideon Schechtman

If $S$ is a given regular $n$-simplex, $n \ge 2$, of edge length $a$, then the distances $a_1$, $\cdots$, $a_{n+1}$ of an arbitrary point in its affine hull to its vertices are related by the fairly known elegant relation $\phi_{n+1}…

Commutative Algebra · Mathematics 2017-01-03 Mowaffaq Hajja , Mostafa Hayajneh , Bach Nguyen , Shadi Shaqaqha

We provide a simple proof that in any homogeneous, compact metric space of diameter $D$, if one finds the average distance $A$ achieved in $X$ with respect to some isometry invariant Borel probability measure, then $$\frac{D}{2} \leq A \leq…

Metric Geometry · Mathematics 2014-07-22 Mark Herman , Jonathan Pakianathan

We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…

Numerical Analysis · Mathematics 2011-11-09 Roman Werpachowski

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in…

Optimization and Control · Mathematics 2016-01-28 Dmitriy Drusvyatskiy , Hon-Leung Lee , Giorgio Ottaviani , Rekha R. Thomas
‹ Prev 1 4 5 6 7 8 10 Next ›