• Honam Mathematical Journal
• /
• v.42 no.4
• /
• pp.681-699
• /
• 2020

In this paper, topological entropy of iterated function systems (IFS) on one dimensional spaces is considered. Estimation of an upper bound of topological entropy of piecewise monotone IFS is obtained by open covers. Then, we provide a way to calculate topological entropy of piecewise monotone IFS. In the following, some examples are given to illustrate our theoretical results. Finally, we have a discussion about the possible applications of these examples in various sciences.

• Journal of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.265-281
• /
• 2021

In the kneading theory developed by Milnor and Thurston, it is proved that the kneading matrix and the kneading determinant associated with a continuous piecewise monotone map are invariant under orientation-preserving conjugacy. This paper considers the problem for orientation-reversing conjugacy and proves that the former is not an invariant while the latter is. It also presents applications of the result towards the computational complexity of kneading matrices and the classification of maps up to topological conjugacy.

• Communications of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.571-589
• /
• 2020

It is known that the kneading matrix associated with a continuous piecewise monotone self-map of an interval contains crucial combinatorial information of the map and all its iterates, however for every iterate of such a map we can associate its kneading matrix. In this paper, we describe the relation between kneading matrices of maps and their iterates for a family of chaotic maps. We also give a new definition for the kneading matrix and describe the relationship between the corresponding determinant and the usual kneading determinant of such maps.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.36-43
• /
• 1986

In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.