The Dixmier conjecture and the shape of possible counterexamples
classification
🧮 math.RA
keywords
conjecturecounterexamplesdixmierpossibleboundcommondegreesdivisor
read the original abstract
We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the counterexamples of the Dixmier Conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.