• 대한수학회지
• /
• 제44권6호
• /
• pp.1291-1312
• /
• 2007

We study some extremal problems on the Cartan-Hartogs domains. Through computing the minimal circumscribed Hermitian ellipsoid of the Cartan-Hartogs domains, we get the $Carath\acute{e}odory$ extremal mappings between the Cartan-Hartogs domains and the unit hyperball, and the explicit formulas for computing the $Carath\acute{e}odory$ extremal value.

• 대한수학회논문집
• /
• 제27권4호
• /
• pp.753-762
• /
• 2012

We prove some sharp extremal distance results for functions in weighted Bergman spaces on the upper halfplane. We also prove new analogous results in the context of bounded strictly pseudoconvex domains with smooth boundary.

• 대한수학회지
• /
• 제54권6호
• /
• pp.1683-1698
• /
• 2017

In this paper, we study the $Carath{\acute{e}}odory$ extremal problems on the Hua domain of the first three types. We give the explicit formula for the $Carath{\acute{e}}odory$ extremal problems between the first three types of Hua domain and the unit ball, which improves the works done on Hua domain and Cartan-egg domain and super-Cartan domain.

• 충청수학회지
• /
• 제20권2호
• /
• pp.147-156
• /
• 2007

We introduce the extremal length and examine its properties. And we consider the geometric applications of extremal length to the boundary behavior of analytic functions, conformal mappings. We derive the theorem in connection with the capacity. This theorem applies the extremal length to the analytic function defined on the domain with a number of holes. And we obtain the theorems in connection with the pure geometric problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• pp.379-379
• /
• 1998

The report presents an approach to constructing or control algorithms for finite dimensional dynamical systems under the deficit of information about dynamical disturbances. The approach is based on the constructions of the extremal shift strategy of the differential game theory.

• 대한수학회보
• /
• 제52권1호
• /
• pp.85-103
• /
• 2015

We prove some sharp extremal distance results for functions in various spaces of analytic functions on bounded strictly pseudoconvex domains with smooth boundary. Also, we obtain atomic decompositions in multifunctional Bloch and weighted Bergman spaces of analytic functions on strictly pseudoconvex domains with smooth boundary, which extend known results in the classical case of a single function.

• 대한수학회논문집
• /
• 제37권2호
• /
• pp.521-535
• /
• 2022

In this paper, we introduce the k-Hankel-Wigner transform on R in some problems of time-frequency analysis. As a first point, we present some harmonic analysis results such as Plancherel's, Parseval's and an inversion formulas for this transform. Next, we prove a Heisenberg's uncertainty principle and a Calderón's reproducing formula for this transform. We conclude this paper by studying an extremal function for this transform.

• East Asian mathematical journal
• /
• 제11권2호
• /
• pp.303-313
• /
• 1995

• 대한수학회논문집
• /
• 제16권4호
• /
• pp.679-690
• /
• 2001

Doubly stochastic matrices are n$\times$n nonnegative ma-trices whose row and column sums are all 1. Convex polytope $\Omega$$_{n}$ of doubly stochastic matrices and more generally (R,S), so called transportation polytopes, are important since they form the domains for the transportation problems. A theorem by Birkhoff classifies the extremal matrices of , $\Omega$$_{n}$ and extremal matrices of transporta-tion polytopes (R,S) were all classified combinatorially. In this article, we consider signed version of $\Omega$$_{n}$ and (R.S), obtain signed Birkhoff theorem; we define a new class of convex polytopes (R,S), calculate their dimensions, and classify their extremal matrices, Moreover, we suggest an algorithm to express a matrix in (R,S) as a convex combination of txtremal matrices. We also give an example that a polytope of signed matrices is used as a domain for a decision problem. In this context of finite reflection(Coxeter) group theory, our generalization may also be considered as a generalization from type $A_{*}$ n/ to type B$_{n}$ D$_{n}$. n/.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제26권3호
• /
• pp.177-188
• /
• 2019

Suppose G is a molecular graph with edge set E(G). The hyper-Zagreb index of G is defined as $HM(G)={\sum}_{uv{\in}E(G)}[deg_G(u)+deg_G(v)]^2$, where $deg_G(u)$ is the degree of a vertex u in G. In this paper, all chemical trees of order $n{\geq}12$ with the first twenty smallest hyper-Zagreb index are characterized.