Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

An algorithm for counting number of all (normal) fuzzy subgroups in $U_{6n}$

Marek Hyčko

TL;DR

A dynamical programming algoritm for counting the number of all (normal) fuzzy subgroups of a U_{6n} group with respect to M. T.rn.

Abstract

Using already known resuls concerning the structure of (normal) subgroups of a $U_{6n}$ group we provide a dynamical programming algoritm for counting the number of all (normal) fuzzy subgroups of $U_{6n}$ with respect to M. Tărnăceanu and L. Bentea equivalence relation.

An algorithm for counting number of all (normal) fuzzy subgroups in $U_{6n}$

TL;DR

A dynamical programming algoritm for counting the number of all (normal) fuzzy subgroups of a U_{6n} group with respect to M. T.rn.

Abstract

Using already known resuls concerning the structure of (normal) subgroups of a group we provide a dynamical programming algoritm for counting the number of all (normal) fuzzy subgroups of with respect to M. Tărnăceanu and L. Bentea equivalence relation.
Paper Structure (1 section, 3 theorems, 8 equations, 2 algorithms)

This paper contains 1 section, 3 theorems, 8 equations, 2 algorithms.

Table of Contents

  1. Preliminaries

Key Result

Lemma 1.2

Let $G_1$ and $G_2$ be subgroups of $U_{6n}$. Then the following holds

Theorems & Definitions (7)

  • Definition 1.1
  • Lemma 1.2
  • proof
  • Theorem 1.3
  • proof
  • Theorem 1.4
  • proof