Related papers: Semiring and involution identities of powers of in…

We construct an invariant of t-structures on the derived category of a Noetherian ring. This invariant is complete when restricting to the category of quasi-coherent complexes, and also gives a classification of nullity classes with the…

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…

It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and…

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

We introduce locally involutive semigroups and embed them into the category of ordered groupoids. This embedding restricts to a correspondence between quasi-involutive semigroups and ordered groupoids with mediator, extending the classical…

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

We show that the term equivalence between MV-algebras and MV-semirings lifts to involutive residuated lattices and a class of semirings called \textit{involutive semirings}. The semiring perspective helps us find a necessary and sufficient…

We characterize affine semigroups having one Betti element and we compute some relevant non-unique factorization invariants for these semigroups. As an example, we particularize our description to numerical semigroups.

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…

We describe how to construct all inverse semigroups Morita equivalent to a given inverse semigroup. This is done by taking the maximum inverse images of the regular Rees matrix semigroups over the inverse semigroup where the sandwich matrix…

We study the universal groups of inverse semigroups associated with point sets and with tilings. We focus our attention on two classes of examples. The first class consists of point sets which are obtained by a cut and projection scheme…

Let T(X) be the semigroup of full transformations on a finite set X with n elements. We prove that every subsemilattice of T(X) has at most 2^{n-1} elements and that there are precisely n subsemilattices of size exactly 2^{n-1}, each…

The role of finite centralizers of involutions in pseudo-finite groups is analyzed. It is shown that a pseudo-finite group admitting a definable involutory automorphism fixing only finitely many elements is finite-by-abelian-by-finite. As a…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…