On Presentations of Bruck–Reilly Extensions

We first consider the class of monoids in which every left invertible element is also right invertible, and prove that if a monoid belonging to this class admits a finitely presented Bruck–Reilly extension then it is finitely generated. This allow us to obtain necessary and sufficient conditions for the Bruck–Reilly extensions of this class of monoids to be finitely presented. We then prove that thes 𝒟-classes of a Bruck–Reilly extension of a Clifford monoid are Bruck–Reilly extensions of groups. This yields another necessary and sufficient condition for these Bruck–Reilly extensions to be finitely generated and presented. Finally, we show that a Bruck–Reilly extension of a Clifford monoid is finitely presented as an inverse monoid if and only if it is finitely presented as a monoid, and that this property cannot be generalized to Bruck–Reilly extensions of arbitrary inverse monoids.     

SEPARABILITY CONDITIONS IN ACTS OVER MONOIDS

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions, we investigate which monoids have the property that all their (finitely generated) acts satisfy the condition. In particular, we prove that: all acts over a finite monoid are completely separable (and hence satisfy the other three separability conditions); all finitely generated acts over a finitely generated commutative monoid are residually finite and strongly subact separable (and hence weakly subact separable); all acts over a commutative idempotent monoid are residually finite and strongly subact separable; and all acts over a Clifford monoid are strongly subact separable.

     

Generators and presentations for direct and wreath products of monoid acts

Semigroup Forum - We investigate the preservation of the properties of being finitely generated and finitely presented under both direct and wreath products of monoid acts. A monoid M is said to...     

Limits of Pure-Injective Cotilting Modules

The set of pure-injective cotilting modules over an artin algebra is shown to have a monoid structure. This monoid structure does not restrict down to a monoid structure on the finitely generated cotilting modules in general, but it does whenever the algebra is of finite representation type. Pure-injective cotilting modules are also constructed from any set of finitely generated cotilting modules with bounded injective dimension. Presented by Y. Drozd Mathematics Subject Classifications (2000) 16G10, 16P20, 16E30.     

A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative

In this paper we give an algorithm to compute a finite presentation for any finitely generated commutative cancellative monoid, and in particular we apply it to derive an algorithm to decide whether a finitely presented commutative monoid is cancellative or not.     

Inverse Subsemigroups of the Monogenic Free Inverse Semigroup

It is shown that every finitely generated inverse subsemigroup (submonoid) of the monogenic free inverse semigroup (monoid) is finitely presented. As a consequence, the homomorphism and the isomorphism problems for the monogenic free inverse semigroup (monoid) are proven to be decidable.     

On finitely presented,cancellative and commutative ordered monoids

We show that every finitely presented, cancellative and commutative ordered monoid is determined by a finitely generated and cancellative pseudoorder on the monoid (ℕ ⁿ ,+) for some positive integer n. Every cancellative pseudoorder on (ℕ ⁿ ,+) is determined by a submonoid of the group (ℤ ⁿ ,+), and we prove that the pseudoorder is finitely generated if and only if the submonoid is an affine monoid in ℤ ⁿ .     

Strongly taut finitely generated monoids

A strongly taut monoid is a monoid in which all the powers of any element of the monoid have the same elasticity, that is, the ratio between the maximum and the minimum length of the factorizations of an element remains unchanged under powers. We give a procedure to determine if a finitely generated commutative monoid is strongly taut.     

On morphisms of commutative monoids

The aim of this work is to study monoid morphisms between commutative monoids. Algorithms to check if a monoid morphism between two finitely generated monoids is injective and/or surjective are given. The structure of the set of monoid morphisms between a monoid and a cancellative monoid is also studied and an algorithm to obtain a system of generators of this set is provided.     

广义Macaulay-Northcott模与Tor-群

Let （S,≤） be a strictly totally ordered monoid which is also artinian, and R a right noetherian ring. Assume that M is a finitely generated right R-module and N is a left Rmodule. Denote by [[MS,≤]] and [NS,≤] the module of generalized power series over M, and the generalized Macaulay-Northcott module over N, respectively. Then we show that there exists an isomorphism of Abelian groups：Tori[[ RS,≤]]（[[MS,≤]],[NS,≤]）≌ s∈S ToriR （M,N）.     

A finitely presented monoid with a non-finitely generated group of units

We exhibit an example of a monoid defined by finitely many generators and defining relations, the group of units of which is not finitely generated. Received: 30 August 2006 Revised: 23 October 2006     

Finite basis problem for 2-testable monoids

A monoid S ¹ obtained by adjoining a unit element to a 2-testable semigroup S is said to be 2-testable. It is shown that a 2-testable monoid S ¹ is either inherently non-finitely based or hereditarily finitely based, depending on whether or not the variety generated by the semigroup S contains the Brandt semigroup of order five. Consequently, it is decidable in quadratic time if a finite 2-testable monoid is finitely based.     

Atomic Commutative Monoids and Their Elasticity

We present some characterizations of properties related to factorization problems on finitely generated commutative monoids. We also give a series of algorithms for studying these problems from a presentation of a given commutative monoid.     

A Model Zeta Function of the Monoid of Natural Numbers

Doklady Mathematics - The paper studies the zeta function $$\zeta (M({{p}_{1}},{{p}_{2}})|\alpha )$$ of the monoid $$M({{p}_{1}},{{p}_{2}})$$ generated by prime numbers $${{p}_{1}} <...     

Finiteness conditions for finitely generated monoids

In this paper, we show that every finitely generated monoid, with a disjunctive zero 0 such that abc=0 implies cba=0, is finite. This research has been supported by Grant A7877 of the National Research Council of Canada.     

Fixed points of endomorphisms of trace monoids

It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. If the dependence alphabet is a transitive forest, it is proved that the set of regular fixed points of the (Scott) continuous extension of an endomorphism to real traces is Ω-rational for every endomorphism if and only if the monoid is a free product of free commutative monoids.     

Abelian quotients of monoids of homology cylinders

A homology cylinder over a surface consists of a homology cobordism between two copies of the surface and markings of its boundary. The set of isomorphism classes of homology cylinders over a fixed surface has a natural monoid structure and it is known that this monoid can be seen as an enlargement of the mapping class group of the surface. We now focus on abelian quotients of this monoid. We show that both the monoid of all homology cylinders and that of irreducible homology cylinders are not finitely generated and moreover they have big abelian quotients. These properties contrast with the fact that the mapping class group is perfect in general. The proof is given by applying sutured Floer homology theory to homologically fibered knots studied in a previous paper.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

Subgroups of Free Groups: a Contribution to the Hanna Neumann Conjecture

We prove that the strengthened Hanna Neumann conjecture, on the rank of the inter-section of finitely generated subgroups of a free group, holds for a large class of groups characterized by geometric properties. One particular case of our result implies that the conjecture holds for all positively finitely generated subgroups of the free group F(A) (over the basis A), that is, for subgroups which admit a finite set of generators taken in the free monoid over A.