Minimal tiled orders of finite global dimension (Q2362760): Difference between revisions

Let \(\Lambda\) be a basic tiled order in a simple algebra over a complete discrete valuation domain with exponent matrix \((e_{i,j})\). A graph \(G(\Lambda)\) is defined by declaring that two distinct vertices \(i,j\) are connected when \(e_{i,j} + e_{j,i} = 1\). A tiled order is said to be \(G\)-connected if it is Morita-equivalent to a basic tiled order \(\Lambda\) with connected \(G(\Lambda)\). For instance, tiled orders with global dimension less or equal than \(2\) are shown to be \(G\)-connected (Theorem 3). Tree orders are constructed in such a way that their graph is a tree. They are characterized as the minimal \(G\)-connected tiled orders of finite global dimension (Theorem 4). This statement constitutes the main result of the paper.