中文

解决Dixon与Pressman猜想的图论方法

环与代数 2020-10-12 v1 组合数学

摘要

给定n×nn \times n矩阵A1,,AkA_1, \dots, A_k,考虑线性算子L(A1,,Ak) ⁣:  MnMnL(A_1,\dots,A_k) \colon \; \operatorname{M}_n \to \operatorname{M}_n,定义为 L(A1,,Ak)(Ak+1)=σSk+1sign(σ)Aσ(1)Aσ(2)Aσ(k+1). L(A_1,\dots,A_k)(A_{k+1})= \sum_{\sigma\in S_{k+1}} \operatorname{sign}(\sigma) A_{\sigma(1)}A_{\sigma(2)} \cdots A_{\sigma(k+1)}. Amitsur-Levitzki定理断言,对每个k2n1k \geq 2n-1L(A1,,Ak)L(A_1, \ldots, A_k)恒为00。Dixon与Pressman猜想,若kk是介于222n22n - 2之间的偶数,则对一般位置的A1,,AkMn(R)A_1, \ldots, A_k\in \operatorname{M}_n(\mathbb{R}),算子L(A1,,Ak)L(A_1, \ldots, A_k)的核维数为kk。我们利用图论技术证明了该猜想。

关键词

引用

@article{arxiv.2010.04679,
  title  = {A graph-theoretic approach to a conjecture of Dixon and Pressman},
  author = {Matthew Brassil and Zinovy Reichstein},
  journal= {arXiv preprint arXiv:2010.04679},
  year   = {2020}
}

备注

32 pages