The complete solution in (n, yx, yj) 6 Z3 of the Diophantine equation b„ = ±2yi yi is given, where (bn)nez is Berstel's recurrence sequence defined by />o = Z>i=0, b2 = l, b„+3 = 2bn+2 4b„+l + 4bn.

Inference mechanisms and interpretations of fuzzy rule bases are studied together from the point of view of systems of fuzzy relation equations. A proper use of an inference mechanism connected to a fuzzy relation interpreting a fuzzy rule base is certified by keeping the fundamental interpolation condition. The paper aims at new solutions of systems of fuzzy relation equations which are motiva...

Some identities between partitions and compositions were obtained in the literature. As a natural extension, we introduce and study modulo-p partitions, where p is a positive integer. Moreover, several recurrence relations and some sufficient conditions for the existence of modulo-p partitions are given, respectively. In addition, we obtain some identities of modulo-p partitions. In the end, us...

Chebyshev polynomials of the first and the second kind in n variables z. , Zt , ... , z„ are introduced. The variables z, , z-,..... z„ are the characters of the representations of SL(n + 1, C) corresponding to the fundamental weights. The Chebyshev polynomials are eigenpolynomials of a second order linear partial differential operator which is in fact the radial part of the Laplace-Beltrami op...

Abstract. Following Poupard’s study of strictly ordered binary trees with respect to two parameters, namely, “end of minimal chain” and “parent of maximum leaf” a true Tree Calculus is being developed to solve a partial difference equation system and then make a joint study of those two statistics. Their joint distribution is shown to be symmetric and to be expressed in the form of an explicit ...

Min-implication fuzzy relation equations based on Booleantype implications can also be viewed as a way of implementing fuzzy associative memories with perfect recall. In this paper, fuzzy associative memories with perfect recall are constructed, and new on-line learning algorithms adapting the weights of its interconnections are incorporated into this neural network when the solution set of the...

It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...

Representing and consequently processing fuzzy data in standard and binary databases is problematic. The problem is further amplified in binary databases where continuous data is represented by means of discrete ‘1’ and ‘0’ bits. As regards classification, the problem becomes even more acute. In these cases, we may want to group objects based on some fuzzy attributes, but unfortunately, an appr...

Options pricing model parameters are inherently imprecise due to fluctuations in the real-world financial market. Traditional option pricing methods do not account for the uncertainty in parameters, but the fuzzy set theory may be applicable. This paper proposes a cash-or-nothing European call binary option pricing model based on the hypothesis that the underlying asset price, risk-free rate of...