A classification of $n$-tuples of commuting shifts of finite multiplicity
Edward J Timko

TL;DR
This paper classifies $n$-tuples of commuting shifts of finite multiplicity using algebraic invariants like ideals and their zero sets, extending the understanding of their equivalence classes.
Contribution
It introduces a classification framework for $n$-tuples of shifts based on their annihilator ideals and geometric properties of their zero sets.
Findings
Equivalence classes are determined by annihilator ideals and positive integers.
Classification reduces to prime ideal cases and their irreducible components.
Provides a complete invariant for the classification problem.
Abstract
Let denote an -tuple of shifts of finite multiplicity, and denote by the ideal consisting of polynomials in complex variables such that . If on is another -tuple of shifts of finite multiplicity, and there is a -invariant subspace of finite codimension in so that is similar to , then we write . If as well, then we write . In the case that is a prime ideal we show that the equivalence class of is determined by and a positive integer . More generally, the equivalence class of is determined by and an -tuple…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Holomorphic and Operator Theory · Advanced Differential Equations and Dynamical Systems
