NON-DETERMINISTIC LINEAR HYPERSUBSTITUTIONS
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2015, Vol 35, Issue 1
Abstract
A non-deterministic hypersubstitution maps operation symbols to sets of terms of the corresponding arity. A non-deterministic hypersubstitution of type τ is said to be linear if it maps any operation symbol to a set of linear terms of the corresponding arity. We show that the extension of non-deterministic linear hypersubstitutions of type τ map sets of linear terms to sets of linear terms. As a consequence, the collection of all nondeterministic linear hypersubstitutions forms a monoid. Non-deterministic linear hypersubstitutions can be applied to identities and to algebras of type τ.
Authors and Affiliations
Nareupanat Lekkoksung, Prakit Jampachon
A NOTE ON IDEAL BASED ZERO-DIVISOR GRAPH OF A COMMUTATIVE RING
In this paper, we consider the ideal based zero divisor graph ΓI (R) of a commutative ring R. We discuss some graph theoretical properties of ΓI (R) in relation with zero divisor graph. We also relate certain parameters...
Jordan numbers, Stirling numbers and sums of powers
In the paper a new combinatorical interpretation of the Jordan numbers is presented. Binomial type formulae connecting both kinds of numbers mentioned in the title are given. The decomposition of the product of polynomia...
ON PERFECTNESS OF INTERSECTION GRAPH OF IDEALS OF Zn
In this short paper, we characterize the positive integers n for which intersection graph of ideals of Zn is perfect.
ON THE AUTOTOPISM GROUP OF THE CORDERO-FIGUEROA SEMIFIELD OF ORDER 3^6
In [5] M. Biliotti, V. Jha and N. Johnson were able to completely determine the autotopism group of a generalized twisted field as a subgroup of ΓL(K) × ΓL(K), where K = GF(p^n) and ΓL(K) is the group of nonsingular semi...
A SHORT NOTE ON LCBA—FUZZY LOGIC WITH A NON-ASSOCIATIVE CONJUNCTION
We significantly simplify the axiomatic system LCBA for fuzzy logic with a non-associative conjunction.