Certain Finitely Generated Compact Zero Dimensional Semigroups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finitely Generated Weakly Reductive Commutative Semigroups∗

We give characterizations of the property of being weakly reductive for finitely generated commutative semigroups. As a consequence of these characterizations we obtain an algorithm for determining from a presentation of a finitely generated commutative semigroup whether it is weakly reductive. Furthermore, we present some connections between cancellative finitely generated commutative semigrou...

متن کامل

Finitely generated connected locally compact groups

Hofmann and Morris [6] proved that a locally compact connected group G has a finite subset generating a dense subgroup if and only if the weight w(G) of G does not exceed c , the cardinality of the continuum. The minimum cardinality of such a topological generating set is an invariant of the group, is denoted by σ(G), and is called the topological rank of G . For compact abelian groups of weigh...

متن کامل

An Invariant Measure for Finitely Generated Rational Semigroups

For a nitely generated rational semigroup G we establish the existence of a probability measure = G on the Julia set J(G) which has a certain invariance property with respect to the semigroup.

متن کامل

Finitary Power Semigroups of Infinite Groups Are Not Finitely Generated

For a semigroup S the finitary power semigroup of S, denoted Pf (S), consists of all finite subsets of S under the usual multiplication. The main result of this paper asserts that Pf (G) is not finitely generated for any infinite group G.

متن کامل

A Note on Finitely Generated Semigroups of Regular Languages∗

Let E = {E1, . . . , Ek} be a set of regular languages over a finite alphabet Σ. Consider morphism φ : ∆ → (S, ·) where ∆ is the semigroup over a finite set ∆ and (S, ·) = 〈E〉 is the finitely generated semigroup with E as the set of generators and language concatenation as a product. We prove that the membership problem of the semigroup S, the set [u] = {v ∈ ∆ | φ(v) = φ(u)}, is a regular langu...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1988

ISSN: 0263-6115

DOI: 10.1017/s1446788700029852