中文
相关论文

相关论文: On the distance from a matrix to nilpotents

200 篇论文

In the infinite regular tree $\mathbb{T}_{q+1}$ with $q \in \mathbb{Z}_{\ge 2}$, we consider families $\{\mu_u^n\}$, indexed by vertices $u$ and nonnegative integers ("discrete time steps") $n$, of probability measures such that $\mu_u^n(v)…

组合数学 · 数学 2021-09-21 Pakawut Jiradilok , Supanat Kamtue

We study the set $\partition{\nb}$ of all possible Jordan canonical forms of nilpotent matrices commuting with a given nilpotent matrix $B$. We describe $\partition{\nb}$ in the special case when $B$ has only one Jordan block. In the…

交换代数 · 数学 2007-12-01 Polona Oblak

The problem of finding \emph{distance} between \emph{pattern} of length $m$ and \emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a…

数据结构与算法 · 计算机科学 2018-05-04 Przemysław Uznański

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

组合数学 · 数学 2014-04-08 Marcos Charalambides

We consider two ensembles of nxn matrices. The first is the set of all nxn matrices with entries zeroes and ones such that all column sums and all row sums equal r, uniformly weighted. The second is the set of nxn matrices with zero and one…

数学物理 · 物理学 2023-05-17 Paul Federbush

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

组合数学 · 数学 2010-12-01 Norbert Sauer

Let $n,k$ be fixed natural numbers with $1\le k\le n$ and let $A_{n+1,k,2k,\dots,sk}$ denote an $(n+1)\times (n+1)$ complex multidiagonal matrix having $s=[n/k]$ sub- and superdiagonals at distances $k,2k,\dots,sk$ from the main diagonal.…

环与代数 · 数学 2021-05-21 L. Losonczi

We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…

群论 · 数学 2010-04-02 Ganna Kudryavtseva , Volodymyr Mazorchuk

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

组合数学 · 数学 2010-05-03 Richard P. Brent , Brendan D. McKay

In this short note, we show that the distance function to any finite set $X\subset \mathbb{R}^n$ is a topological Morse function, regardless of whether $X$ is in general position. We also precisely characterize its topological critical…

微分几何 · 数学 2024-07-23 Charles Arnal

Using geometric techniques like projection and dimensionality reduction, we show that there exists a randomized sub-linear time algorithm that can estimate the Hamming distance between two matrices. Consider two matrices ${\bf A}$ and ${\bf…

数据结构与算法 · 计算机科学 2021-07-07 Arijit Bishnu , Arijit Ghosh , Gopinath Mishra

We proved in previous work that all real nilpotent Lie algebras of dimension up to $10$ carrying an ad-invariant metric are nice. In this paper we show by constructing explicit examples that nonnice irreducible nilpotent Lie algebras…

微分几何 · 数学 2024-04-10 Diego Conti , Viviana del Barco , Federico A. Rossi

Let the pair $(\mathfrak{g},J)$ be a nilpotent Lie algebra $\mathfrak{g}$ (NLA for short) endowed with a nilpotent complex structure $J$. In this paper, motivated by a question in the work of Cordero, Fern\'andez, Gray and Ugarte, we prove…

微分几何 · 数学 2023-04-18 Qin Gao , Quanting Zhao , Fangyang Zheng

Let $\pi$ be a permutation of $\{1,2,\ldots,n\}$. If we identify a permutation with its graph, namely the set of $n$ dots at positions $(i,\pi(i))$, it is natural to consider the minimum $L^1$ (Manhattan) distance, $d(\pi)$, between any…

组合数学 · 数学 2018-08-03 Simon R. Blackburn , Cheyne Homberger , Peter Winkler

We study the structure of the nilpotent commutator $\nb$ of a nilpotent matrix $B$. We show that $\nb$ intersects all nilpotent orbits for conjugation if and only if $B$ is a square--zero matrix. We describe nonempty intersections of $\nb$…

环与代数 · 数学 2011-06-09 Polona Oblak

Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…

概率论 · 数学 2010-05-18 Elizabeth Meckes

Let (N,J) be a real 2n-dimensional nilpotent Lie group endowed with an invariant complex structure. A left-invariant Riemannian metric on N compatible with J is said to be minimal, if it minimizes the norm of the invariant part of the Ricci…

微分几何 · 数学 2013-09-24 Edwin Alejandro Rodriguez Valencia

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

数值分析 · 数学 2013-06-24 Michael Karow , Emre Mengi

The Newlander-Nirenberg theorem says that a necessary and sufficient condition for the complex coordinates associated with a given almost complex structure tensor $I_M{}^N$ to exist is the vanishing of the Nijenhuis tensor ${\cal…

数学物理 · 物理学 2020-03-05 Andrei Smilga

We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a…

最优化与控制 · 数学 2024-04-02 Hans J. H. Tuenter
‹ 上一页 1 8 9 10 下一页 ›