Related papers: Domain Range Semigroups and Finite Representations
We establish representation types (finite, tame or wild) of finite dimensional Munn algebras with semisimple bases. As an application, we establish representation types of finite 0-simple semigroups and their mutually annihilating unions.
We prove that any equational basis that defines RRA over wRRA must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose "small"…
Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…
The article covers developments in the representation theory of finite group schemes over the last fifteen years. We start with the finite generation of cohomology of a finite group scheme and proceed to discuss various consequences and…
We consider a version of a famous open problem formulated by Kadison, asking whether bounded representations of operator algebras are automatically completely bounded. We investigate this question in the context of amenable operator…
In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…
Using the well-known equivalence between meet-completions of posets and standard closure operators we show a general method for constructing meet-completions for isotone poset expansions. With this method we find a meet-completion for…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…
Finite group theorists have established many formulas that express interesting properties of a finite group in terms of sums of characters of the group. An obstacle to applying these formulas is lack of control over the dimensions of…
We present some general results implying nonfinite axiomatisability of many additively idempotent semirings with finitely based semigroup reducts. The smallest is a $3$-element commutative example, which we show also has \texttt{NP}-hard…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
Let O be a complete discrete valuation domain with finite residue field. In this paper we describe the irreducible representations of the groups Aut(M) for any finite O-module M of rank two. The main emphasis is on the interaction between…
A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semi-bounded if the corresponding operators $i\dd\pi(x)$ from the derived representations are uniformly bounded from above on some non-empty open subset…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
We parameterize the finite-dimensional irreducible representations of a class of pointed Hopf algebras over an algebraically closed field of characteristic zero by dominant characters. The Hopf algebras we are considering arise in the work…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. For a finite simple semigroup we find necessary and sufficient conditions to be an equational domain. Moreover, we study semigroups…
We characterize the class of RFD $C^*$-algebras as those containing a dense subset of elements that attain their norm under a finite-dimensional representation. We show further that this subset is the whole space precisely when every…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…