Distortion functions and the membership problem for submonoids of groups and monoids

نویسندگان

  • Stuart W. Margolis
  • John Meakin
  • Zoran Šuniḱ
  • ZORAN ŠUNIḰ
چکیده

The notion of upper distortion for graded submonoids embedded in groups and monoids is introduced. A finitely generated monoid M is graded if every element of M can be written in only finitely many ways in terms of some fixed system of generators. Examples of such monoids are free monoids, Artin monoids, and monoids satisfying certain small cancellation conditions. Whenever such a monoid is embedded in another monoid or a group G, we define an upper distortion function comparing the intrinsic word metric on M with the extrinsic word metric on M inherited from G. If the word problem in G is solvable, then the membership problem for M in G is solvable if and only if there exists a recursive upper distortion function for M in G. A particularly good aspect of upper distortion functions, when they exist, is that they lift well under homomorphisms. In order to illustrate this general approach, we solve the membership problem in positively generated submonoids of some one-relator groups, including Baumslag-Solitar groups, surface groups, and some groups given by Adian type relations. To solve these problems we use linear representations (quite often not faithful) in which long products of matrices have large matrix norms, construct upper distortion functions, and lift them back to the original groups.

منابع مشابه

Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings

A rst explicit connection between nitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution to the word problem in commutative monoids by deciding the ideal membership problem. The aim of this paper is to show in a similar fashion how congruences on monoids and groups can be characterized by ideals in respective monoid and group rings. Th...

متن کامل

On finitely generated submonoids of free groups

We prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups. We also prove that it is decidable whether or not a finitely generated submonoid of a free group is graded, and solve the homomorphism and isomorphism problems for graded submonoids of free groups. This generalizes earlier results for submonoids of free monoids. MSC: 20E05; 20...

متن کامل

Exponential membership function and duality gaps for I-fuzzy linear programming problems

Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...

متن کامل

FGP approach to multi objective quadratic fractional programming problem

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

متن کامل

A new method for fuzzification of nested dummy variables by fuzzy clustering membership functions and its application in financial economy

In this study, the aim is to propose a new method for fuzzification of nested dummy variables. The fuzzification idea of dummy variables has been acquired from non-linear part of regime switching models in econometrics. In these models, the concept of transfer functions is like the notion of fuzzy membership functions, but no principle or linguistic sentence have been used for inputs. Consequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004