Papers
Topics
Authors
Recent
2000 character limit reached

Bergman's Centralizer Theorem and quantization

Published 16 Aug 2017 in math.QA | (1708.04802v1)

Abstract: We prove Bergman's theorem on centralizers by using generic matrices and Kontsevich's quantization method. For any field $\textbf{k} $ of positive characteristics, set $A=\textbf{k} \langle x_1,\dots,x_s\rangle$ be a free associative algebra, then any centralizer $\mathcal{C}(f)$ of nontrivial element $f\in A\backslash \textbf{k}$ is a ring of polynomials on a single variable. We also prove that there is no commutative subalgebra with transcendent degree $\geq 2$ of $A$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.