PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS

2002 ◽  
Vol 12 (05) ◽  
pp. 659-670 ◽  
Author(s):  
J. C. ROSALES ◽  
P. A. GARCÍA-SÁNCHEZ ◽  
J. I. GARCÍA-GARCÍA
Keyword(s):  
Commutative Monoid ◽  
Finitely Generated ◽  
Commutative Monoids ◽  
Algorithmic Method ◽  
Simple Equations ◽  
Torsion Free

We give an algorithmic method for computing a presentation of any finitely generated submonoid of a finitely generated commutative monoid. We use this method also for calculating the intersection of two congruences on ℕp and for deciding whether or not a given finitely generated commutative monoid is t-torsion free and/or separative. The last section is devoted to the resolution of some simple equations on a finitely generated commutative monoid.

scholarly journals On the set of catenary degrees of finitely generated cancellative commutative monoids

2016 ◽  
Vol 26 (03) ◽  
pp. 565-576 ◽  
Author(s):  
Christopher O’Neill ◽  
Vadim Ponomarenko ◽  
Reuben Tate ◽  
Gautam Webb
Keyword(s):  
Nonnegative Integer ◽  
Nonzero Element ◽  
Commutative Monoid ◽  
Finitely Generated ◽  
Commutative Monoids ◽  
Maximum Value ◽  
Extremal Behavior ◽  
Catenary Degree ◽  
Open Question

The catenary degree of an element [Formula: see text] of a cancellative commutative monoid [Formula: see text] is a nonnegative integer measuring the distance between the irreducible factorizations of [Formula: see text]. The catenary degree of the monoid [Formula: see text], defined as the supremum over all catenary degrees occurring in [Formula: see text], has been studied as an invariant of nonunique factorization. In this paper, we investigate the set [Formula: see text] of catenary degrees achieved by elements of [Formula: see text], focusing on the case where [Formula: see text] is finitely generated (where [Formula: see text] is known to be finite). Answering an open question posed by García-Sánchez, we provide a method to compute the smallest nonzero element of [Formula: see text] that parallels a well-known method of computing the maximum value. We also give several examples demonstrating certain extremal behavior for [Formula: see text].

On the Residual Finiteness of Polygonal Products of Nilpotent Groups

1992 ◽  
Vol 35 (3) ◽  
pp. 390-399 ◽  
Author(s):  
Goansu Kim ◽  
C. Y. Tang
Keyword(s):  
Nilpotent Groups ◽  
Vertex Group ◽  
Residual Finiteness ◽  
Finitely Generated ◽  
Residually Finite ◽  
Cyclic Subgroups ◽  
Isolated Subgroup ◽  
Torsion Free

AbstractIn general polygonal products of finitely generated torsion-free nilpotent groups amalgamating cyclic subgroups need not be residually finite. In this paper we prove that polygonal products of finitely generated torsion-free nilpotent groups amalgamating maximal cyclic subgroups such that the amalgamated cycles generate an isolated subgroup in the vertex group containing them, are residually finite. We also prove that, for finitely generated torsion-free nilpotent groups, if the subgroups generated by the amalgamated cycles have the same nilpotency classes as their respective vertex groups, then their polygonal product is residually finite.

Genus of nilpotent groups of Hirsch length six

1995 ◽  
Vol 117 (3) ◽  
pp. 431-438 ◽  
Author(s):  
Charles Cassidy ◽  
Caroline Lajoie
Keyword(s):  
Finite Number ◽  
Nilpotent Group ◽  
Nilpotent Groups ◽  
Finitely Generated ◽  
Torsion Free

AbstractIn this paper, we characterize the genus of an arbitrary torsion-free finitely generated nilpotent group of class two and of Hirsch length six by means of a finite number of arithmetical invariants. An algorithm which permits the enumeration of all possible genera that can occur under the conditions above is also given.

scholarly journals Hyperbolic Groups are Hyperhopfian

2000 ◽  
Vol 68 (1) ◽  
pp. 126-130 ◽  
Author(s):  
Robert J. Daverman
Keyword(s):  
Abelian Subgroup ◽  
Hyperbolic Manifolds ◽  
Hyperbolic Groups ◽  
Fundamental Groups ◽  
Finitely Generated ◽  
Residually Finite ◽  
Torsion Free

AbstractThe main result indicates that every finitely generated, residually finite, torsion-free, cohopfian group having on free Abelian subgroup of rank two is hyperhopfian. The argument relies on earlier work and ideas of Hirshon. As a corollary, fundamental groups of all closed hyperbolic manifolds are hyperhopfian.

scholarly journals Some properties of the Levitzki radical in alternative rings

1982 ◽  
Vol 32 (1) ◽  
pp. 52-60 ◽  
Author(s):  
Michael Rich
Keyword(s):  
Nilpotent Ideal ◽  
Finitely Generated ◽  
Alternative Ring ◽  
Locally Nilpotent ◽  
Torsion Free

AbstractTwo local nilpotent properties of an associative or alternative ringAcontaining an idempotent are shown. First, ifA=A11+A10+A01+A00is the Peirce decomposition ofArelative toethen ifais associative or semiprime alternative and 3-torsion free then any locally nilpotent idealBofAiigenerates a locally nilpotent ideal 〈B〉 ofA. As a consequenceL(Aii) =Aii∩L(A)for the Levitzki radicalL. Also bounds are given for the index of nilpotency of any finitely generated subring of 〈B〉. Second, ifA(x)denotes a homotope ofAthenL(A)⊆L(A(x))and, in particular, ifA(x)is an isotope ofAthenL(A)=L(A(x)).

scholarly journals Torsion in tensor powers of modules

2015 ◽  
Vol 219 ◽  
pp. 113-125
Author(s):  
Olgur Celikbas ◽  
Srikanth B. Iyengar ◽  
Greg Piepmeyer ◽  
Roger Wiegand
Keyword(s):  
Local Ring ◽  
Complete Intersection ◽  
Tensor Products ◽  
Central Theme ◽  
Finitely Generated ◽  
Finitely Generated Module ◽  
Free Modules ◽  
Tensor Powers ◽  
Torsion Free ◽  
Nonzero Torsion

AbstractTensor products usually have nonzero torsion. This is a central theme of Auslander's 1961 paper; the theme continues in the work of Huneke and Wiegand in the 1990s. The main focus in this article is on tensor powers of a finitely generated module over a local ring. Also, we study torsion-free modulesNwith the property thatM ⊗RNhas nonzero torsion unlessMis very special. An important example of such a moduleNis the Frobenius powerpeRover a complete intersection domainRof characteristicp> 0.

Decision problems concerning S-arithmetic groups

1985 ◽  
Vol 50 (3) ◽  
pp. 743-772 ◽  
Author(s):  
Fritz Grunewald ◽  
Daniel Segal
Keyword(s):  
Additive Group ◽  
Nilpotent Groups ◽  
Isomorphism Problem ◽  
Algorithmic Problem ◽  
Finitely Generated ◽  
Finitely Presented Groups ◽  
Finite Dimensional ◽  
Associative Rings ◽  
Finitely Presented ◽  
Torsion Free

This paper is a continuation of our previous work in [12]. The results, and some applications, have been described in the announcement [13]; it may be useful to discuss here, a little more fully, the nature and purpose of this work.We are concerned basically with three kinds of algorithmic problem: (1) isomorphism problems, (2) “orbit problems”, and (3) “effective generation”.(1) Isomorphism problems. Here we have a class of algebraic objects of some kind, and ask: is there a uniform algorithm for deciding whether two arbitrary members of are isomorphic? In most cases, the answer is no: no such algorithm exists. Indeed this has been one of the most notable applications of methods of mathematical logic in algebra (see [26, Chapter IV, §4] for the case where is the class of all finitely presented groups). It turns out, however, that when consists of objects which are in a certain sense “finite-dimensional”, then the isomorphism problem is indeed algorithmically soluble. We gave such algorithms in [12] for the following cases: = {finitely generated nilpotent groups}; = {(not necessarily associative) rings whose additive group is finitely generated}; = {finitely Z-generated modules over a fixed finitely generated ring}.Combining the methods of [12] with his own earlier work, Sarkisian has obtained analogous results with the integers replaced by the rationals: in [20] and [21] he solves the isomorphism problem for radicable torsion-free nilpotent groups of finite rank and for finite-dimensional Q-algebras.

Arithmetic modules over generalized Dedekind domains

2020 ◽  
pp. 2250045
Author(s):  
Indah Emilia Wijayanti ◽  
Hidetoshi Marubayashi ◽  
Iwan Ernanto ◽  
Sutopo
Keyword(s):  
Free Module ◽  
Dedekind Domain ◽  
Finitely Generated ◽  
Multiplication Module ◽  
Dedekind Domains ◽  
Torsion Free Module ◽  
Polynomial Module ◽  
Torsion Free

Let [Formula: see text] be a finitely generated torsion-free module over a generalized Dedekind domain [Formula: see text]. It is shown that if [Formula: see text] is a projective [Formula: see text]-module, then it is a generalized Dedekind module and [Formula: see text]-multiplication module. In case [Formula: see text] is Noetherian it is shown that [Formula: see text] is either a generalized Dedekind module or a Krull module. Furthermore, the polynomial module [Formula: see text] is a generalized Dedekind [Formula: see text]-module (a Krull [Formula: see text]-module) if [Formula: see text] is a generalized Dedekind module (a Krull module), respectively.

Sign in / Sign up

Export Citation Format

Share Document