Embedding polydisk algebras into the disk algebra and an application to stable ranks
Raymond Mortini

TL;DR
This paper demonstrates how to embed polydisk algebras into the disk algebra, enabling the construction of subalgebras with any desired stable rank, thus advancing the understanding of algebraic structures in complex analysis.
Contribution
It introduces a method to embed polydisk algebras into the disk algebra, allowing for the creation of subalgebras with arbitrary stable ranks.
Findings
Successful embedding of polydisk algebras into the disk algebra.
Construction of subalgebras with prescribed stable ranks.
Implications for the structure of uniform algebras.
Abstract
It is shown how to embed the polydisk algebras (finite and infinite ones) into the disk algebra . As a consequence, one obtains uniform closed subalgebras of which have arbitrarily prescribed stable ranks
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 · Advanced Operator Algebra Research · Algebraic structures and combinatorial models
