加载中…
Let with lexicographic ordering. is a totally ordered group. Let . Then is a -tree. Analogous to the construction of graph -algebras, we form a groupoid whose unit space is the space of ends of the tree. The -algebra of the -tree is defined as the -algebra of this groupoid. We prove some properties of this -algebra.

生成讲解博客的中文版本

生成AI智能校验的中文版本