22 research outputs found
Identities in unitriangular and gossip monoids
We establish a criterion for a semigroup identity to hold in the monoid of upper unitriangular matrices with entries in a commutative semiring
. This criterion is combinatorial modulo the arithmetic of the
multiplicative identity element of . In the case where is idempotent,
the generated variety is the variety , which by a result of
Volkov is generated by any one of: the monoid of unitriangular Boolean
matrices, the monoid of all reflexive relations on an element set, or
the Catalan monoid . We propose -matrix analogues of these latter two
monoids in the case where is an idempotent semiring whose multiplicative
identity element is the `top' element with respect to the natural partial order
on , and show that each generates . As a consequence we
obtain a complete solution to the finite basis problem for lossy gossip
monoids.Comment: 14 page
Identities of the stylic monoid
We observe that for each n≥ 2 , the identities of the stylic monoid with n generators coincide with the identities of n-generated monoids from other distinguished series of J-trivial monoids studied in the literature, e.g., Catalan monoids and Kiselman monoids. This solves the Finite Basis Problem for stylic monoids. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.075-02-2022-877; Ministry of Education and Science of the Russian Federation, MinobrnaukaThe work was supported by the Ministry of Science and Higher Education of the Russian Federation (Ural Mathematical Center project No. 075-02-2022-877
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..
Semigroup congruences : computational techniques and theoretical applications
Computational semigroup theory is an area of research that is subject to growing interest. The development of semigroup algorithms allows for new theoretical results to be discovered, which in turn informs the creation of yet more algorithms. Groups have benefitted from this cycle since before the invention of electronic computers, and the popularity of computational group theory has resulted in a rich and detailed literature. Computational semigroup theory is a less developed field, but recent work has resulted in a variety of algorithms, and some important pieces of software such as the Semigroups package for GAP.
Congruences are an important part of semigroup theory. A semigroup’s congruences determine its homomorphic images in a manner analogous to a group’s normal subgroups. Prior to the work described here, there existed few practical algorithms for computing with semigroup congruences. However, a number of results about alternative representations for congruences, as well as existing algorithms that can be borrowed from group theory, make congruences a fertile area for improvement. In this thesis, we first consider computational techniques that can be applied to the study of congruences, and then present some results that have been produced or precipitated by applying these techniques to interesting examples.
After some preliminary theory, we present a new parallel approach to computing with congruences specified by generating pairs. We then consider alternative ways of representing a congruence, using intermediate objects such as linked triples. We also present an algorithm for computing the entire congruence lattice of a finite semigroup. In the second part of the thesis, we classify the congruences of several monoids of bipartitions, as well as the principal factors of several monoids of partial transformations. Finally, we consider how many congruences a finite semigroup can have, and examine those on semigroups with up to seven elements