• 호남수학학술지
• /
• 제27권2호
• /
• pp.163-181
• /
• 2005

We study some properties of intuitionistic fuzzy equivalence relations. Also we introduce the concepts of intuitionistic fuzzy transitive closures and level sets of an intuitionistic fuzzy relation and we investigate some of their properties.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.97-104
• /
• 2010

The article is devoted to exhibit some general properties of strong chain recurrent set and strong chain transitive components for a continuous map f on a compact metric space X. We investigate the relation between the weak shadowing property and strong chain transitivity. It is shown that a continuous map f from a compact metric space X onto itself with the average shadowing property is strong chain transitive.

• 대한수학회지
• /
• 제51권4호
• /
• pp.837-851
• /
• 2014

We consider ${\omega}$-chaos as defined by S. H. Li in 1993. We show that c-dense ${\omega}$-scrambled sets are present in every transitive system with two-sided limit shadowing property (TSLmSP) and that every transitive map on topological graph has a dense Mycielski ${\omega}$-scrambled set. As a preliminary step, we provide a characterization of dynamical properties of maps with TSLmSP.

• 대한수학회논문집
• /
• 제38권1호
• /
• pp.243-256
• /
• 2023

We deal with a type of inverse pseudo-orbit tracing property with respect to the class of continuous methods, as suggested and studied by Pilyugin [54]. In this paper, we consider a continuous method induced through the diffeomorphism of a compact smooth manifold, and using the concept, we proved the following: (i) If a diffeomorphism f of a compact smooth manifold M has the robustly pointwise inverse pseudoorbit tracing property, f is structurally stable. (ii) For a C1 generic diffeomorphism f of a compact smooth manifold M, if f has the pointwise inverse pseudo-orbit tracing property, f is structurally stable. (iii) If a diffeomorphism f has the robustly pointwise inverse pseudo-orbit tracing property around a transitive set Λ, then Λ is hyperbolic for f. Finally, (iv) for C¹ generically, if a diffeomorphism f has the pointwise inverse pseudo-orbit tracing property around a locally maximal transitive set Λ, then Λ is hyperbolic for f. In addition, we investigate cases of volume preserving diffeomorphisms.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.292-298
• /
• 2002

We focus on the slicing off some sub-nets using the transitive matrix. Control flows in the Petri nets is done based on the token flows. One control f]ow explains the independent tokens status and if the token-in divides into several tokens after firing a transition then the control flow divides to several flows, as well. Accordingly, we define that the basic unit of concur-rency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. The BUC is S-invariant which has one control flow. We show the usefulness of transitive matrix to slice off some subnets from the original net based on BUC-through on an example.

• 대한수학회보
• /
• 제53권3호
• /
• pp.657-665
• /
• 2016

A general notion of ${\chi}$-transitive groups was introduced by C. Delizia et al. in [6], where ${\chi}$ is a class of groups. In [5], Ciobanu, Fine and Rosenberger studied the relationship among the notions of conjugately separated abelian, commutative transitive and fully residually ${\chi}$-groups. In this article we study the concept of 2-Engel transitive groups and among other results, its relationship with conjugately separated 2-Engel and fully residually ${\chi}$-groups are established. We also introduce the notion of 2-Engelizer of the element x in G and denote the set of all 2-Engelizers in G by $E^2(G)$. Then we construct the possible values of ${\mid}E^2(G){\mid}$.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.213-227
• /
• 2022

We discuss the relation between units and nilpotents of a ring, concentrating on the transitivity of units on nilpotents under regular group actions. We first prove that for a ring R, if U(R) is right transitive on N(R), then Köthe's conjecture holds for R, where U(R) and N(R) are the group of all units and the set of all nilpotents in R, respectively. A ring is called right UN-transitive if it satisfies this transitivity, as a generalization, a ring is called unilpotent-IFP if aU(R) ⊆ N(R) for all a ∈ N(R). We study the structures of right UN-transitive and unilpotent-IFP rings in relation to radicals, NI rings, unit-IFP rings, matrix rings and polynomial rings.

• 충청수학회지
• /
• 제25권1호
• /
• pp.27-33
• /
• 2012

Let $f$ be a difeomorphism of a closed $n$ -dimensional smooth manifold M, and $p$ be a hyperbolic periodic point of $f$. Let ${\Lambda}(p)$ be a closed set which containing $p$. In this paper, we show that (i) if $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$, then ${\Lambda}(p)$ is the chain component which contains $p$. (ii) suppose $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$. Then if $f|_{\Lambda(p)}$ has the $C^{1}$-stably shadowing property then it is hyperbolic.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1683-1709
• /
• 2015

Let (${\Omega}$, S) be an association scheme where ${\Omega}$ is a non-empty finite set and S is a partition of ${\Omega}{\times}{\Omega}$. For a positive integer k we say that (${\Omega}$, S) is k-equivalenced if each non-diagonal element of S has valency k. In this paper we focus on 4-equivalenced association schemes, and prove that they are transitive.

• 한국시뮬레이션학회논문지
• /
• 제12권2호
• /
• pp.13-24
• /
• 2003

In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system Into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.