• Journal of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.87-99
• /
• 2001

We prove that the germ of a CR mapping f between real analytic real hypersurfaces has a holomorphic extension and satisfies a complete system of finite order if the source is of finite type in the sense of Bloom-Graham and the target is k-nondegenerate under certain generic assumptions on f.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.4
• /
• pp.387-394
• /
• 2020

Matthews introduced the concepts of partial metric spaces and proved the Banach fixed point theorem in complete partial metric spaces. Dukic, Kadelburg, and Radenovic proved fixed point theorems for Geraghty-type mappings in complete partial metric spaces. In this paper, we prove the fixed point theorem for some contractive mapping in a complete partial metric space.

• Journal of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.225-243
• /
• 2000

We explain the notion of complete system and how it naturally arises from the equivalence problem of G-structures. Then we construct a complete system of 3rd order for the infinitesimal CR automorphisms of CR manifold of nondegenerate Levi form.

• Journal of the Korean Mathematical Society
• /
• v.39 no.1
• /
• pp.91-102
• /
• 2002

Let M and N be CR manifolds with nondegenerate Levi forms of hypersurface type of dimension 2m ＋ 1 and 2n ＋ 1, respectively, where 1 $\leq$ m $\leq$ n. Let f : M longrightarrow N be a CR mapping. Under a generic assumption we construct a complete system of finite order for the infinitesimal deformations of f. In particular, we prove the space of infinitesimal deformations of f forms a finite dimensional Lie algebra.

• Kyungpook Mathematical Journal
• /
• v.59 no.4
• /
• pp.665-678
• /
• 2019

We construct an iteration scheme involving a hybrid pair of mappings, one a single-valued asymptotically nonexpansive mapping t and the other a multivalued nonexpansive mapping T, in a complete CAT(0) space. In the process, we remove a restricted condition (called the end-point condition) from results of Akkasriworn and Sokhuma [1] and and use this to prove some convergence theorems. The results concur with analogues for Banach spaces from Uddin et al. [16].

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.507-518
• /
• 2016

The aim of this paper is to prove some strong convergence theorems for the modified Ishikawa iteration process involving a pair of a generalized asymptotically nonexpansive single-valued mapping and a quasi-nonexpansive multi-valued mapping in the framework of $\mathbb{R}$-trees under the gate condition.

• ETRI Journal
• /
• v.20 no.4
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.117-128
• /
• 2012

Using the concept of a g-monotone mapping we prove some common fixed point theorems for g-non-decreasing mappings which satisfy some generalized nonlinear contractions in partially ordered complete quasi b-metric spaces. The new theorems are generalizations of very recent fixed point theorems due to L. Ciric, N. Cakic, M. Rojovic, and J. S. Ume, [Monotone generalized nonlinear contractions in partailly ordered metric spaces, Fixed Point Theory Appl. (2008), article, ID-131294] and R. P. Agarwal, M. A. El-Gebeily, and D. O'Regan [Generalized contractions in partially ordered metric spaces, Appl. Anal. 87 (2008), 1-8].

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.873-892
• /
• 2020

Thurston, in 1986, discovered that the Schwarzian derivative has mysterious properties similar to the curvature on a manifold. After his work, there are several approaches to develop this notion on Riemannian manifolds. Here, a tensor field is identified in the study of global conformal diffeomorphisms on Finsler manifolds as a natural generalization of the Schwarzian derivative. Then, a natural definition of a Mobius mapping on Finsler manifolds is given and its properties are studied. In particular, it is shown that Mobius mappings are mappings that preserve circles and vice versa. Therefore, if a forward geodesically complete Finsler manifold admits a Mobius mapping, then the indicatrix is conformally diffeomorphic to the Euclidean sphere S^n-1 in ℝⁿ. In addition, if a forward geodesically complete absolutely homogeneous Finsler manifold of scalar flag curvature admits a non-trivial change of Mobius mapping, then it is a Riemannian manifold of constant sectional curvature.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.