Results 21 to 30 of about 4,881 (233)
Growth function for a class of monoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this article we study a class of monoids that includes Garside monoids, and give a simple combinatorial proof of a formula for the formal sum of all elements of the monoid.
Marie Albenque, Philippe Nadeau
doaj +1 more source
The Talented monoid of a graph and its connections with the Leavitt path algebra [PDF]
, 2022 In this talk, we introduce an algebraic entity arising from a directed graph - the talented monoid. The talented monoid has an interesting relationship with the Leavitt path algebra.
Sebandal, Alfilgen
core
A Minimal Pseudo-complex Monoid
, 2023 A monoid is pseudo-complex if the semigroup variety it generates has uncountably many subvarieties, while the monoid variety it generates has only finitely many subvarieties. The smallest pseudo-complex monoid currently known is of order seven.
Lee, Edmond W. H.
core +1 more source
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids [PDF]
, 2016 We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
Dietrich Kuske, Olena Prianychnykova
openaire +2 more sources
Free Monoid in Monoidal Abelian Categories [PDF]
Applied Categorical Structures, 2008 Final version, to appear in Applied Categorical Structures. [17 pages]
openaire +2 more sources
Ordered Monoids and J-Trivial Monoids [PDF]
, 2000 The aim of this paper is to give a new proof of the following result of Straubing and Thérien (which is also a consequence of a well-known result of I. Simon): Every J-trivial monoid is a quotient of an ordered monoid satisfying the identity x
Henckell, Karsten, Pin, Jean-Eric
openaire +2 more sources
, 1989 We give a new condition on a monoid M for the monoid ring F[M] to be a 2-fir. Futhermore, we construct a monoid M that satisfies all the currently known necessary conditions for F[M] to be a semifir and that the group of units ofM is trivial, but M is ...
Cedó, Ferran, F. Cedó
core +1 more source
Theory of Computing Systems, 2013 The author develops an algebraic theory for languages of data words, i.e. words over an alphabet \(\Sigma\times \mathbb{D}\) where \(\Sigma\) is a finite set of labels and \(\mathbb{D}\) is an infinite set of data values. Some of the key notions of the paper are defined relative to a given data symmetry \((\mathbb{D},G)\) in which \(G\) is a subgroup ...
openaire +2 more sources
Czechoslovak Mathematical Journal, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maney, Jack, Ponomarenko, Vadim
openaire +1 more source
Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid
Mathematics, 2020 In this paper, completely regular endomorphisms of unicyclic graphs are explored. Let G be a unicyclic graph and let c E n d ( G ) be the set of all completely regular endomorphisms of G.
Rui Gu, Hailong Hou
doaj +1 more source