• Title/Summary/Keyword: extremal type

Search Result 33, Processing Time 0.025 seconds

APPLICATIONS ON THE BESSEL-STRUVE-TYPE FOCK SPACE

  • Soltani, Fethi
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.4
    • /
    • pp.875-883
    • /
    • 2017
  • In this work, we establish Heisenberg-type uncertainty principle for the Bessel-Struve Fock space ${\mathbb{F}}_{\nu}$ associated to the Airy operator $L_{\nu}$. Next, we give an application of the theory of extremal function and reproducing kernel of Hilbert space, to establish the extremal function associated to a bounded linear operator $T:{\mathbb{F}}_{\nu}{\rightarrow}H$, where H be a Hilbert space. Furthermore, we come up with some results regarding the extremal functions, when T are difference operators.

COMPLETION OF HANKEL PARTIAL CONTRACTIONS OF NON-EXTREMAL TYPE

  • KIM, IN HYOUN;YOO, SEONGUK;YOON, JASANG
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.5
    • /
    • pp.1003-1021
    • /
    • 2015
  • A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.

Statistical Studies on the Derivation of Design Low Flows (I) (설계갈수량의 유도를 위한 수문통계학적 연구 (I))

  • 이순혁;박영근;박종근
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.34 no.3
    • /
    • pp.43-52
    • /
    • 1992
  • Design low flows were derived from the decision of a best fitting probability distribution and of an optimum transformation method can be contributed to the planning of water utilization and management of various hydraulic structures during dry season in the main river systems in Korea. The results were analyzed and summarized as follows. 1.Basic statistics for the selected watersheds were calculated as one of means for the analysis of extremal distribution. 2.Parameters for the different frequency distributions were calculated by the method of moment. 3.Type m extremal distribution was confirmed as a best one among others for the frequency distribution of the low flows by x$^2$ goodness of fit test. 4.Formulas for the design low flows of the Type m extremal distribution with two and three parameters were dervied for the selected watersheds. 5.Design low flows for the Type m extremal distribution when a minimum drought is zero or larger than zero were derived for the selected watersheds, respectively. 6.Design low flows of the Type m extremal distribution with two parameters are appeared to be reasonable when a minimum drought approaches to zero and the observed low flows varied within a relating small range while those with three parameters are seemed to be consistent with the probability distribution of low flows when a minimum drought is larger than zero and the observed low flows showed a wide range.

  • PDF

Probability Funetion of Best Fit to Distribution of Extremal Minimum Flow and Estimation of Probable Drought Flow (극소치유량에 대한 적정분포형의 설정과 확률갈수량의 산정)

  • 김지학;이순탁
    • Water for future
    • /
    • v.8 no.1
    • /
    • pp.80-88
    • /
    • 1975
  • In this paper the authors established the best fit distribution function by applying the concept of probabiaity to the annual minimum flow of nine areas along the Nakdong river basin which is one of the largest Korean rivers and calculated the probable minimum flow suitable to those distribution function. Lastly, the authors tried to establish the best method to estimate the probable minimun flow by comparing some frequency analysis methods. The results obtained are as follows (1) It was considered that the extremal distribution type III was the most suitable one in the distributional types as a result of the comparision with Exponential distribution, Log-Normal distribution, Extremal distribution type-III and so on. (2) It was found that the formula of extremal distribution type-II for the estimation of probable minimum flow gave the best result in deciding the probable minimum flow of the Nakdong river basin. Therfore, it is recommended that the probable minimum flow should be estimated by using the extremal distribution type-III method. (3) It could be understood that in the probable minimum flow the average non-excessive probability appeared to be $Po{\fallingdotseq}1-\frac{1}{2T}$ and gave the same values of the probable variable without any difference in the various methods of plotting technique.

  • PDF

ON EXTREMAL ELLIPTIC K3 SURFACES

  • Ye, Qiang
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.6
    • /
    • pp.1091-1113
    • /
    • 1999
  • In this paper, we first classify the possible configurations of fibrations which are not semi-stable on extremal elliptic K3 surfaces. Then we give a complete list of extremal elliptic K3 surfaces whose singular fibers are all not of type $I_n$.

  • PDF

ON THE EXTREMAL TYPE I BINARY SELF-DUAL CODES WITH NEAR-MINIMAL SHADOW

  • HAN, SUNGHYU
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.1_2
    • /
    • pp.85-95
    • /
    • 2019
  • In this paper, we define near-minimal shadow and study the existence problem of extremal Type I binary self-dual codes with near-minimal shadow. We prove that there is no such codes of length n = 24m + 2($m{\geq}0$), n = 24m + 4($m{\geq}9$), n = 24m + 6($m{\geq}21$), and n = 24m + 10($m{\geq}87$).

Statistical Studies on the Derivation of Design Low Flows (II) (설계갈수량의 유도를 위한 수문통계학적 연구(II))

  • 이순혁;박명근;박종국
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.34 no.4
    • /
    • pp.39-47
    • /
    • 1992
  • Derivation of reasonable design low flows was attempted by comparative analysis of design low flows was derived by Power and SMEMAX transformations for the normalizations of skewed distribution and by Type m extremal distribution presented in the first report of this study with annual low flows in the five watersheds of main river basins in Korea. The results were anslyzed and summarized as follows. 1.Basic statistics of annual low flows for the selected watersheds were calculated by using Power and SMEMAX transformations. 2.Power thansformation has found to be the best for the normalization of skewed distribution among others including log, square root and SMEMAX transformations. 3.Design low flows for the selected watersheds were derived by the Power and SMEMAX transformations. 4.Judging by the relative suitabilities of the Type III extremal distribution, Power and SMEMAX transformation, it was found that design low flows of all methods are closer to the observed data within 10 years of the return period and those of Power transformation can be acknowledzed as a reasonable one among others from the viewpoint of the median between values of Type m extremal distribution and SMEMAX transformation in addition to closing the observed than others over 10 years of the return period.

  • PDF

CONVEX POLYTOPES OF GENERALIZED DOUBLY STOCHASTIC MATRICES

  • Cho, Soo-Jin;Nam, Yun-Sun
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.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/.

  • PDF