Related papers: A Testing Algorithm of an Universal Algebra to be …
We determine the class group of those generalized cluster algebras that are Krull domains. In particular, this provides a criterion for determining whether or not a generalized cluster algebra is a UFD. In fact, any finitely generated…
We prove that an analogue of Jordan's theorem on finite subgroups of general linear groups holds for the groups of biregular automorphisms of algebraic surfaces. This gives a positive answer to a question of Vladimir L. Popov.
We show the reduced $C^*$-algebra of a graded ample groupoid is a strongly graded $C^*$-algebra if and only if the corresponding Steinberg algebra is a strongly graded ring. We apply this result to get a theorem about the Leavitt path…
We determine all values of the parameters for which the cell modules form a standard system, for a class of cellular diagram algebras including partition, Brauer, walled Brauer, Temperley-Lieb and Jones algebras. For this, we develop and…
We define a general notion of centrally $\Gamma$-graded sets and groups and of their graded products, and prove some basic results about the corresponding categories: most importantly, they form braided monoidal categories. Here, $\Gamma$…
Normal elements (or multipliers) of the C* algebra of a certain class of locally compact groupoids admit a natural faithful representation as normal operators on the $L^2$-space of a dense orbit of the groupoid. We prove norm estimates on…
We prove Cuntz-Krieger and graded uniqueness theorems for Steinberg algebras. We also show that a Steinberg algebra is basically simple if and only if its associated groupoid is both effective and minimal. Finally we use results of…
The genus gen(D) of a finite-dimensional central division algebra D over a field F is defined as the collection of classes [D'] in the Brauer group Br(F), where D' is a central division F-algebra having the same maximal subfields as D. For…
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…
We introduce and investigate using Hilbert modules the properties of the {\em Fourier algebra} $A(G)$ for a locally compact groupoid $G$. We establish a duality theorem for such groupoids in terms of multiplicative module maps. This…
This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
This survey provides an elementary introduction to operads and to their applications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We introduce the notions of relational groupoids and relational convolution algebras. We provide various examples arising from the group algebra of a group $G$ and a given normal subgroup $H$. We also give conditions for the existence of a…
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…