Mathematicians unlock hidden order in complex algebraic structures
Researchers have classified a major family of mathematical objects used in cryptography, coding theory, and computational geometry. The breakthrough provides a complete map of how these structures relate to each other, potentially accelerating development of algorithms in finance, telecommunications, and data science.
Originaltitel: A classification of n-representation infinite algebras of type Ã
<p>We classify n-representation infinite algebras Lambda of type (A) over tilde. This type is defined by requiring that Lambda has higher preprojective algebra Pi(n+1)(Lambda) similar or equal to k[x(1),...,x(n+1)] * G, where G < SLn+1(k) is finite abelian. For the classification, we group these algebras according to a more refined type, and give a combinatorial characterisation of these types. This is based on so-called height functions, which generalise the height function of a perfect matching in a dimer model. In terms of toric geometry and McKay correspondence, the types form the lattice simplex of junior elements of G. We show that all algebras of the same type are related by iterated n-APR tilting, and hence are derived equivalent. By disallowing certain tilts, we turn this set into a finite distributive lattice, and we construct its maximal and minimal elements.</p>