A recursive formula for the number of intuitionistic fuzzy subgroups of a finite cyclic group

2017 ◽  
Author(s):  
Chandni ◽  
P. K. Sharma ◽  
Pushpinder Singh ◽  
Manreet Singh
Keyword(s):  
Cyclic Group ◽  
Recursive Formula ◽  
Finite Cyclic Group ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Subgroups

Distributivity and pseudocomplementation of lattices of generalized \(L\)-subgroups

2016 ◽  
Vol 5 (2) ◽  
pp. 107 ◽  
Author(s):  
Dilek Bayrak ◽  
Sultan Yamak
Keyword(s):  
Cyclic Group ◽  
Abelian Groups ◽  
Study Groups ◽  
Finite Cyclic Group ◽  
Pseudocomplemented Lattice ◽  
Fuzzy Subgroups

The main goal of this paper is to study the lattice of \((0,\mu)\)-\(L\)-subgroups of a group. We characterize abelian groups by the lattice of \((0,\mu)\)-\(L\)-subgroups. Also, we show that a group $G$ is locally cyclic if and only if the lattice of \((0,\mu)\)-\(L\)-subgroups is distributive. As consequence, we obtain that the lattices of all \((\in,\in\vee q)\)-fuzzy subgroups and all fuzzy subgroups of a finite cyclic group are distributive. Finally, we study groups which of the lattice of \((\lambda,\mu)\)-\(L\)-subgroups is pseudocomplemented lattice.

scholarly journals Commutative semigroups whose endomorphisms are power functions

2021 ◽  
Author(s):  
Ryszard Mazurek
Keyword(s):  
Positive Integer ◽  
Power Function ◽  
Cyclic Group ◽  
Commutative Semigroup ◽  
Commutative Monoid ◽  
Power Functions ◽  
Commutative Semigroups ◽  
Finite Cyclic Group

AbstractFor any commutative semigroup S and positive integer m the power function $$f: S \rightarrow S$$ f : S → S defined by $$f(x) = x^m$$ f ( x ) = x m is an endomorphism of S. We partly solve the Lesokhin–Oman problem of characterizing the commutative semigroups whose all endomorphisms are power functions. Namely, we prove that every endomorphism of a commutative monoid S is a power function if and only if S is a finite cyclic group, and that every endomorphism of a commutative ACCP-semigroup S with an idempotent is a power function if and only if S is a finite cyclic semigroup. Furthermore, we prove that every endomorphism of a nontrivial commutative atomic monoid S with 0, preserving 0 and 1, is a power function if and only if either S is a finite cyclic group with zero adjoined or S is a cyclic nilsemigroup with identity adjoined. We also prove that every endomorphism of a 2-generated commutative semigroup S without idempotents is a power function if and only if S is a subsemigroup of the infinite cyclic semigroup.

scholarly journals On Fundamental Theorems of t-Intuitionistic Fuzzy Isomorphism of t-Intuitionistic Fuzzy Subgroups

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 74547-74556 ◽  
Author(s):  
Laila Latif ◽  
Umer Shuaib ◽  
Hanan Alolaiyan ◽  
Abdul Razaq
Keyword(s):  
Intuitionistic Fuzzy ◽  
Fuzzy Subgroups ◽  
Fundamental Theorems

scholarly journals On L h , k -Labeling Index of Inverse Graphs Associated with Finite Cyclic Groups

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
K. Mageshwaran ◽  
G. Kalaimurugan ◽  
Bussakorn Hammachukiattikul ◽  
Vediyappan Govindan ◽  
Ismail Naci Cangul
Keyword(s):  
Cyclic Group ◽  
Upper Bound ◽  
Labeling Index ◽  
Positive Difference ◽  
Cyclic Groups ◽  
Finite Cyclic Group ◽  
Minimum Number ◽  
The Difference ◽  
Radio Labeling

An L h , k -labeling of a graph G = V , E is a function f : V ⟶ 0 , ∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k . The difference between the highest and lowest assigned values is the index of an L h , k -labeling. The minimum number for which the graph admits an L h , k -labeling is called the required possible index of L h , k -labeling of G , and it is denoted by λ k h G . In this paper, we obtain an upper bound for the index of the L h , k -labeling for an inverse graph associated with a finite cyclic group, and we also establish the fact that the upper bound is sharp. Finally, we investigate a relation between L h , k -labeling with radio labeling of an inverse graph associated with a finite cyclic group.

scholarly journals Some results on χ-single valued neutrosophic subgroups

2021 ◽  
Vol 23 (3) ◽  
pp. 1583
Author(s):  
M. Shazib Hameed ◽  
Zaheer Ahmad ◽  
Salman Mukhtar ◽  
Asad Ullah
Keyword(s):  
Fuzzy Set ◽  
Intuitionistic Fuzzy Set ◽  
Vital Role ◽  
Neutrosophic Set ◽  
Pythagorean Fuzzy Set ◽  
Intuitionistic Fuzzy ◽  
Novel Structure ◽  
Fuzzy Subgroups

<p>In this study, we develop a novel structure χ-single valued neutrosophic set, which is a generalization of the intuitionistic set, inconsistent intuitionistic fuzzy set, Pythagorean fuzzy set, spherical fuzzy set, paraconsistent set, etc. Fuzzy subgroups play a vital role in vagueness structure, it differ from regular subgroups in that it is impossible to determine which group elements belong and which do not. In this paper, we investigate the concept of a χ-single valued neutrosophic set and χ-single valued neutrosophic subgroups. We explore the idea of χ-single valued neutrosophic set on fuzzy subgroups and several characterizations related to χ-single valued neutrosophic subgroups are suggested.</p>

scholarly journals Automorphisms of Regular Wreath Product -Groups

2009 ◽  
Vol 2009 ◽  
pp. 1-12 ◽  
Author(s):  
Jeffrey M. Riedl
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Representation Theory ◽  
Wreath Product ◽  
Cyclic Group ◽  
Product Group ◽  
Finite Cyclic Group ◽  
Arbitrary Finite Group

We present a useful new characterization of the automorphisms of the regular wreath product group of a finite cyclic -group by a finite cyclic -group, for any prime , and we discuss an application. We also present a short new proof, based on representation theory, for determining the order of the automorphism group Aut(), where is the regular wreath product of a finite cyclic -group by an arbitrary finite -group.

Uniqueness of Free Actions on S3 Respecting a Knot

1987 ◽  
Vol 39 (4) ◽  
pp. 969-982 ◽  
Author(s):  
Michel Boileau ◽  
Erica Flapan
Keyword(s):  
Fixed Point ◽  
Cyclic Group ◽  
Group Action ◽  
Cyclic Groups ◽  
Finite Cyclic Group ◽  
Cyclic Group Action ◽  
Periodic Diffeomorphisms ◽  
Free Actions

In this paper we consider free actions of finite cyclic groups on the pair (S3, K), where K is a knot in S3. That is, we look at periodic diffeo-morphisms f of (S3, K) such that fn is fixed point free, for all n less than the order of f. Note that such actions are always orientation preserving. We will show that if K is a non-trivial prime knot then, up to conjugacy, (S3, K) has at most one free finite cyclic group action of a given order. In addition, if all of the companions of K are prime, then all of the free periodic diffeo-morphisms of (S3, K) are conjugate to elements of one cyclic group which acts freely on (S3, K). More specifically, we prove the following two theorems.THEOREM 1. Let K be a non-trivial prime knot. If f and g are free periodic diffeomorphisms of (S3, K) of the same order, then f is conjugate to a power of g.

scholarly journals Vertex connectivity of the power graph of a finite cyclic group II

2019 ◽  
Vol 19 (02) ◽  
pp. 2050040 ◽  
Author(s):  
Sriparna Chattopadhyay ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Cyclic Group ◽  
Undirected Graph ◽  
Prime Numbers ◽  
Vertex Connectivity ◽  
Induced Subgraph ◽  
Power Graph ◽  
Finite Cyclic Group ◽  
Minimum Number ◽  
Positive Integers ◽  
Appl Math

The power graph [Formula: see text] of a given finite group [Formula: see text] is the simple undirected graph whose vertices are the elements of [Formula: see text], in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. The vertex connectivity [Formula: see text] of [Formula: see text] is the minimum number of vertices which need to be removed from [Formula: see text] so that the induced subgraph of [Formula: see text] on the remaining vertices is disconnected or has only one vertex. For a positive integer [Formula: see text], let [Formula: see text] be the cyclic group of order [Formula: see text]. Suppose that the prime power decomposition of [Formula: see text] is given by [Formula: see text], where [Formula: see text], [Formula: see text] are positive integers and [Formula: see text] are prime numbers with [Formula: see text]. The vertex connectivity [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [Panda and Krishna, On connectedness of power graphs of finite groups, J. Algebra Appl. 17(10) (2018) 1850184, 20 pp, Chattopadhyay, Patra and Sahoo, Vertex connectivity of the power graph of a finite cyclic group, to appear in Discr. Appl. Math., https://doi.org/10.1016/j.dam.2018.06.001]. In this paper, for [Formula: see text], we give a new upper bound for [Formula: see text] and determine [Formula: see text] when [Formula: see text]. We also determine [Formula: see text] when [Formula: see text] is a product of distinct prime numbers.

scholarly journals Extended periodic links and HOMFLYPT polynomial

2019 ◽  
Vol 28 (11) ◽  
pp. 1940006
Author(s):  
Nafaa Chbili ◽  
Hajer Jebali
Keyword(s):  
Fixed Points ◽  
Cyclic Group ◽  
Finite Cyclic Group

Extended strongly periodic links have been introduced by Przytycki and Sokolov as a symmetric surgery presentation of three-manifolds on which the finite cyclic group acts without fixed points. The purpose of this paper is to prove that the symmetry of these links is reflected by the first coefficients of the HOMFLYPT polynomial.

scholarly journals The Number of Subgroup Chains of Finite Nilpotent Groups

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1537 ◽  
Author(s):  
Lingling Han ◽  
Xiuyun Guo
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Recursive Formula ◽  
Nilpotent Groups ◽  
Classification Problem ◽  
Finite Abelian Groups ◽  
Counting Problem ◽  
Cyclic Groups ◽  
Fuzzy Subgroups

In this paper, we mainly count the number of subgroup chains of a finite nilpotent group. We derive a recursive formula that reduces the counting problem to that of finite p-groups. As applications of our main result, the classification problem of distinct fuzzy subgroups of finite abelian groups is reduced to that of finite abelian p-groups. In particular, an explicit recursive formula for the number of distinct fuzzy subgroups of a finite abelian group whose Sylow subgroups are cyclic groups or elementary abelian groups is given.

Sign in / Sign up

Export Citation Format

Share Document