The concept of j-hyperideals, for all positive integers 1≤j≤n and n≥2, in n-ary semihypergroups, is a generalization of the concept of left, lateral and right hyperideals in ternary semihypergroups. In this paper, we first introduce the concept of j-(0-)simple n-ary semihypergroups and discuss their related properties through terms of j-hyperideals. Furthermore, we characterize the minimality and maximality of j-hyperideals in n-ary semihypergroups and establish the relationships between the (0-)minimal, maximal j-hyperideals and the j-(0-)simple n-ary semihypergroups. Our main results are to extend and generalize the results on semihypergroups and ternary semihypergroups. Moreover, a related question raised by Petchkaew and Chinram is solved.

No abstract

This paper deals with a class of hyperstructures called ordered n-ary semihypergroups which are studied by means of j-hyperideals for all positive integers 1≤j≤n and n≥3. We first introduce the notion of (softly) left regularity, (softly) right regularity, (softly) intra-regularity, complete regularity, generalized regularity of ordered n-ary semihypergroups and investigate their related properties. Several characterizations of them in terms of j-hyperideals are provided. Finally, the relationships between various classes of regularities in ordered n-ary semihypergroups are also established.

We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work. Specifically, our main result shows that D-iteration converges faster than P-iteration and SP-iteration to the fixed point. Consequently, we have that D-iteration converges faster than the others under the same computational cost. Moreover, the analogue of their convergence theorem holds for D-iteration.

Any relational hypersubstitution for algebraic systems of type (τ,τ′) = ((mi)i∈I,(nj)j∈J) is a mapping which maps any mi-ary operation symbol to an mi-ary term and maps any nj - ary relational symbol to an nj-ary relational term preserving arities, where I,J are indexed sets. Some algebraic properties of the monoid of all relational hypersubstitutions for algebraic systems of a special type, especially the characterization of its order and the set of all regular elements, were first studied by Phusanga and Koppitz[13] in 2018. In this paper, we study the Green’srelationsontheregularpartofthismonoidofaparticulartype(τ,τ′) = ((m),(n)), where m, n ≥ 2.