๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Group of L-Fuzzy Homeomorphisms and the Group of Permutations of the Ground Set

โœ Scribed by T.P. Johnson


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
70 KB
Volume
245
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper we study some relations between the group of L-fuzzy homeomorphisms of an L-fuzzy topological space X and the group of permutations of the ground set X. In contrast with the results in general topology, it is proved that the subgroups generated by cycles and proper normal subgroups can be represented as groups of L-fuzzy homeomorphisms for some L-fuzzy topology on X. The relation between the group of L-fuzzy homeomorphisms and the group of homeomorphisms of the associated topology is also discussed.


๐Ÿ“œ SIMILAR VOLUMES


Representing the Quotient Groups of a Fi
โœ Derek F. Holt; Jacqueline Walton ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has

Computing the Subgroups of a Permutation
โœ John J. Cannon; Bruce C. Cox; Derek F. Holt ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.

On the Movement of a Permutation Group
โœ Peter M. Neumann; Cheryl E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 56 KB
The graphical complexity of direct produ
โœ Mariusz Grech ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

In this article, we improve known results, and, with one exceptional case, prove that when k โ‰ฅ 3, the direct product of the automorphism groups of graphs whose edges are colored using k colors, is itself the automorphism group of a graph whose edges are colored using k colors. We have handled the ca