English
Related papers

Related papers: Pseudovarieties of ordered completely regular semi…

200 papers

This paper is the first part of a study devoted to description of modular elements in the lattices of semigroup and epigroup varieties. We provide strengthened necessary and sufficient conditions under which a semigroup or epigroup variety…

Group Theory · Mathematics 2025-11-25 Vyacheslav Yu. Shaprynski\vı , Dmitry V. Skokov

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

Group Theory · Mathematics 2026-01-22 James East , Attila Egri-Nagy , Andrew R. Francis , James D. Mitchell

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

Formal Languages and Automata Theory · Computer Science 2013-10-21 Ines Klimann , Jean Mairesse , Matthieu Picantin

The finite basis property is often connected with the finite rank property, which it entails. Many examples have been produced of finite rank varieties which are not finitely based. In this note, we establish a result on nilpotent…

Group Theory · Mathematics 2019-03-18 J. Almeida , M. H. Shahzamanian

We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…

Logic · Mathematics 2019-02-14 Gérard Leloup

In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…

Commutative Algebra · Mathematics 2018-04-17 Peyman Nasehpour

We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…

Formal Languages and Automata Theory · Computer Science 2018-06-18 Lukas Fleischer

A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…

Rings and Algebras · Mathematics 2025-07-14 Paolo Lipparini

We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the…

Group Theory · Mathematics 2019-03-18 Jorge Almeida , Alfredo Costa

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

Combinatorics · Mathematics 2023-09-26 Peter M. Higgins

Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…

Group Theory · Mathematics 2022-02-03 Simon M. Goberstein

We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…

Category Theory · Mathematics 2021-04-21 Mark V Lawson

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…

Rings and Algebras · Mathematics 2012-01-25 Elijah Stines

We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…

Combinatorics · Mathematics 2024-04-17 Vincent Beck , Cédric Lecouvey

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

Group Theory · Mathematics 2017-08-02 Vítězslav Kala

In this paper we propose a semiring-theoretic approach to MV-algebras based on the connection between such algebras and idempotent semirings - such an approach naturally imposing the introduction and study of a suitable corresponding class…

Rings and Algebras · Mathematics 2017-06-02 Antonio Di Nola , Ciro Russo

The aim of this paper is to provide an atlas of identity bases for varieties generated by small semigroups and groups. To help the working mathematician easily find information, we provide a companion website that runs in the background…

Group Theory · Mathematics 2019-11-15 João Araújo , João Pedro Araújo , Peter J. Cameron , Edmond W. H. Lee , Jorge Raminhos

We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.

Group Theory · Mathematics 2011-03-17 Stanislav Kublanovsky

We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…

Formal Languages and Automata Theory · Computer Science 2024-11-26 Rémi Morvan