Related papers: Representing Sugihara monoids via weakening relati…
A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
Motivated by the theory of unitary representations of finite dimensional Lie supergroups, we describe those Lie superalgebras which have a faithful finite dimensional unitary representation. We call these Lie superalgebras unitary. This is…
We prove that an abstract (possibly infinite dimensional) complex irreducible representation of a discrete supersolvable group is monomial if and only if it has finite weight. We also prove a general result that implies converse of Schur's…
Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…
We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…
For an arbitrary finite monoid $M$ and subgroup $K$ of the unit group of $M$, we prove that there is a bijection between irreducible representations of $M$ with nontrivial $K$-fixed space and irreducible representations of $\mathcal{H}_K$,…
This is the second in a series of papers that develops the theory of reflection monoids, motivated by the theory of reflection groups. Reflection monoids were first introduced in arXiv:0812.2789. In this paper we study their presentations…
A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a…
We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…
We study the construction of premonoidal categories, where the pentagon relation fails, through representations of finite group algebras and their quantum doubles. Both finite group algebras and their quantum doubles have a finite number of…
We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the…
The rational representation theory of a reductive normal algebraic monoid (with one-dimensional center) forms a highest weight category, in the sense of Cline, Parshall, and Scott. This is a fundamental fact about the representation theory…
The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…
The algebra of monodromy matrices for sl(n) trigonometric R-matrices is studied. It is shown that a generic finite-dimensional polynomial irreducible representation of this algebra is equivalent to a tensor product of L-operators.…
The class of finitely presented algebras A over a field K with a set of generators x_{1},...,x_{n} and defined by homogeneous relations of the form x_{i_1}x_{i_2}...x_{i_l}=x_{sigma(i_1)}x_{sigma(i_2)}...x_{sigma(i_l)}, where l geq 2 is a…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
Let $H$ be a multiplicatively written monoid with identity $1_H$ and let $\mathcal{P}_{\text{fin},1}(H)$ denote the reduced finitary power monoid of $H$, that is, the monoid consisting of all finite subsets of $H$ containing $1_H$ with set…