Maji et al. introduced the concept of fuzzy soft sets as a generalization of the standard soft sets and presented an application of fuzzy soft sets in a decision making problem. The aim of this paper is to apply the concept of fuzzy soft sets to n-ary hypergroup theory. The concepts of (∈(γ), ∈(γ) ∨ q(δ))-fuzzy soft (invertible) n-ary subhypergroups over a commutative n-ary hypergroup are intro...

fuzzy rough n-ary subhypergroups are introduced and characterized.

A group G (with additively written, not necessarily commutative group operation and neutral element 0) is called an H-group if there is a certain system Cl of w-ary algebraic operations (for certain natural numbers n) besides the addition such that for each w-ary operation OJEQ the condition 00... 0w = 0 (with n zeros on the left side) is satisfied. An important concept is that of an Q-ideal in...

in this paper‎, ‎we give a complete proof of theorem 4.1(ii) and a new‎ ‎elementary proof of theorem 4.1(i) in [li and shen‎, ‎on the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ j‎. ‎algebra, ‎323  (2010) 1349--1357]‎. ‎in addition‎, ‎we also give a generalization of baer's theorem‎.

Let p be an odd prime such that p ≡ 3 mod 4 and n be an odd integer. In this paper, two new families of p-ary sequences of period N = p −1 2 are constructed by two decimated p-ary m-sequences m(2t) and m(dt), where d = 4 and d = (p +1)/2 = N +1. The upper bound on the magnitude of correlation values of two sequences in the family is derived using Weil bound. Their upper bound is derived as 3 √ ...

This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...