نتایج جستجو برای: profinite semigroup
تعداد نتایج: 6647 فیلتر نتایج به سال:
Let G be a profinite group with a countable basis of neighborhoods of the identity. A cohomology and homology theory for the group G with non-discrete topological coefficients is developed, improving previous expositions of the subject (see [Wi], [R–Z] and [S-W]). Though the category of topological G-modules considered is additive but not abelian, there is a theory of derived functors. All stan...
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion of any abstract algebra is the extended Stone dual space of the Boolean algebra of recognisable subsets of the abstract algebra endowed with certain residuat...
In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...
A directed set I is a partially ordered set such that for all i, j ∈ I there exists a k ∈ I such that k ≥ i and k ≥ j. An inverse system of groups is a collection of groups {Gi} indexed by a directed set I together with group homomorphisms πij : Gi −→ Gj whenever i ≥ j such that πii = idGi and πjk ◦ πij = πik. Let H be a group. We call a family of homomorphisms {ψi : H −→ Gi : i ∈ I} compatible...
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free...
Inspired by the results of [APR], we propose combinatorial Gelfand models for semigroup algebras of some finite semigroups, which include the symmetric inverse semigroup, the dual symmetric inverse semigroup, the maximal factorizable subsemigroup in the dual symmetric inverse semigroup, and the factor power of the symmetric group. Furthermore we extend the Gelfand model for the semigroup algebr...
We call (T (t))t≥0 an abstract delay semigroup. This notion is introduced in more detail in Section 2. The semigroup thus obtained is rarely a contraction semigroup. In this paper we will show that under very mild conditions, we may change the inner product on E into an equivalent inner product, such that the delay semigroup becomes a (generalized) contraction semigroup. A contraction semigroup...
Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigroup be isomorphic to the input semigroup of its semigroup automaton, a necessary condition if the semigroup is finite. The left-discrimination sequence of an automaton is defined as a sequence of semigroups beginning with the input semigroup of the automaton, each member being the input semigroup o...
In the present note, we discuss certain observations made by the author in February 2009 concerning strongly torsion-free profinite groups [cf. [Mzk2], Definition 1.1, (iii)]. These observations grew out of e-mail correspondences between the author, Akio Tamagawa, and Marco Boggi, as well as oral discussions between the author and Akio Tamagawa. Definition 1. Let G be a profinite group. (i) We ...
In their more general form, our equations are of the form u → v, where u and v are profinite words. The first result not only subsumes Eilenberg-Reiterman’s theory of varieties and their subsequent extensions, but it shows for instance that any class of regular languages defined by a fragment of logic closed under conjunctions and disjunctions (first order, monadic second order, temporal, etc.)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید