• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.439-455
• /
• 2019

Let ${\Sigma}_k(p)$ be the class of univalent meromorphic functions defined on the unit disc ${\mathbb{D}}$ with k-quasiconformal extension to the extended complex plane ${\hat{\mathbb{C}}}$, where $0{\leq}k<1$. Let ${\Sigma}^0_k(p)$ be the class of functions $f{\in}{\Sigma}_k(p)$ having expansion of the form $f(z)=1/(z-p)+{\sum_{n=1}^{\infty}}\;b_nz^n$ on ${\mathbb{D}}$. In this article, we obtain sharp area distortion and weighted area distortion inequalities for functions in ${\sum_{k}^{0}}(p)$. As a consequence of the obtained results, we present a sharp upper bound for the Hilbert transform of characteristic function of a Lebesgue measurable subset of ${\mathbb{D}}$.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.659-666
• /
• 2014

Let $\mathcal{A}$ be the class of analytic functions f in the open unit disk $\mathbb{U}$={z : ${\mid}z{\mid}$ < 1} with the normalization conditions $f(0)=f^{\prime}(0)-1=0$. If $f(z)=z+\sum_{n=2}^{\infty}a_nz^n$ and ${\delta}$ > 0 are given, then the $T_{\delta}$-neighborhood of the function f is defined as $$TN_{\delta}(f)\{g(z)=z+\sum_{n=2}^{\infty}b_nz^n{\in}\mathcal{A}:\sum_{n=2}^{\infty}T_n{\mid}a_n-b_n{\mid}{\leq}{\delta}\}$$, where $T=\{T_n\}_{n=2}^{\infty}$ is a sequence of positive numbers. In the present paper we investigate some problems concerning $T_{\delta}$-neighborhoods of function in various classes of analytic functions with $T=\{2^{-n}/n^2\}_{n=2}^{\infty}$. We also find bounds for $^{\delta}^*_T(A,B)$ defined by $$^{\delta}^*_T(A,B)=jnf\{{\delta}&gt;0:B{\subset}TN_{\delta}(f)\;for\;all\;f{\in}A\}$$ where A, B are given subsets of $\mathcal{A}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4502-4521
• /
• 2020

At EUROCRYPT 2015, Todo proposed a new technique named division property, and it is a powerful technique to find integral distinguishers. The original division property is also named word-based division property. Later, Todo and Morii once again proposed a new technique named the bit-based division property at FSE 2016 and find more rounds integral distinguisher for SIMON-32. There are two basic approaches currently being adopted in researches under the bit-based division property. One is conventional bit-based division property (CBDP), the other is bit-based division property using three-subset (BDPT). Particularly, BDPT is more powerful than CBDP. In this paper, we use Boolean Satisfiability Problem (SAT)-aided cryptanalysis to search integral distinguishers. We conduct experiments on SIMON-32/-48/-64/-96, SIMON (102)-32/-48/-64, SIMECK-32/-48/-64, LBlock, GIFT and Khudra to prove the efficiency of our method. For SIMON (102)-32/-48/-64, we can determine some bits are odd, while these bits can only be determined as constant in the previous result. For GIFT, more balanced (zero-sum) bits can be found. For LBlock, we can find some other new integral distinguishers. For Khudra, we obtain two 9-round integral distinguishers. For other ciphers, we can find the same integral distinguishers as before.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.503-510
• /
• 2004

Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. An interpolating operator for n vectors satisfies the equation $Tx_i\;=\;y_i,\;for\;i\;=\;1,\;2,\;\cdots,\;n$. In this paper the following is proved: Let H be a Hilbert space and L be a commutative subspace lattice on H. Let H and y be vectors in H. Let $M_x\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_ix\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;and\;M_y\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_iy\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}. Then the following are equivalent. (1) There exists an operator A in AlgL such that Ax = y, Af = 0 for all f in ${\overline{M_x}}^{\bot}$, AE = EA for all $E\;{\in}\;L\;and\;A^{*}\;=\;A$. (2) $sup\;\{\frac{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;<\;{\infty},\;{\overline{M_u}}\;{\subset}{\overline{M_x}}$ and < Ex, y >=< Ey, x > for all E in L.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.1
• /
• pp.65-72
• /
• 2012

Let T > 0 be given. Let $(C[0,T],m_{\varphi})$ be the analogue of Wiener measure space, associated with the Borel proba-bility measure ${\varphi}$ on ${\mathbb{R}}$, let $(L_{2}[0,T],\tilde{\omega})$ be the centered Gaussian measure space with the correlation operator $(-\frac{d^{2}}{dx^{2}})^{-1}$ and ${\el}_2,\;\tilde{m}$ be the abstract Wiener measure space. Let U be the space of all sequence $<c_{n}>$ in ${\el}_{2}$ such that the limit $lim_{{m}{\rightarrow}\infty}\;\frac{1}{m+1}\;\sum{^{m}}{_{n=0}}\;\sum_{k=0}^{n}\;c_{k}\;cos\;\frac{k{\pi}t}{T}$ converges uniformly on [0,T] and give a set function m such that for any Borel subset G of $\el_2$, $m(\mathcal{U}\cap\;P_{0}^{-1}\;o\;P_{0}(G))\;=\tilde{m}(P_{0}^{-1}\;o\;P_{0}(G))$. The goal of this note is to study the relationship among the measures $m_{\varphi},\;\tilde{\omega},\;\tilde{m}$ and $m$.

• Honam Mathematical Journal
• /
• v.19 no.1
• /
• pp.97-105
• /
• 1997

Let $R_k({\alpha})$, $0{\leq}{\alpha}<1$, $k{\geq}2$ denote certain subclasses of analytic functions in the unit disc E with bounded radius rotation. A function f, analytic in E and given by $f(z)=z+{\sum_{m=2}^{\infty}}a_m{z^m}$, is said to be in the family $R_k(n,{\alpha})n{\in}N_o=\{0,1,2,{\cdots}\}$ and * denotes the Hadamard product. The classes $R_k(n,{\alpha})$ are investigated and same properties are given. It is shown that $R_k(n+1,{\alpha}){\subset}R_k(n,{\alpha})$ for each n. Some integral operators defined on $R_k(n,{\alpha})$ are also studied.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.1-15
• /
• 2000

In this paper, we propose a practical cut generation method based on the Chvatal-Gomory procedure for the (0, 1)-Knapsack problem with a variable capacity. For a given set N of n items each of which has a positive integral weight and a facility of positive integral capacity, a feasible solution of the problem is defined as a subset S of N along with the number of facilities that can satisfy the sum of weights of all the items in S. We first derive a class of valid inequalities for the problem using Chvatal-Gomory procedure, then analyze the associated separation problem. Based on the results, we develop an affective cut generation method. We then analyze the theoretical strength of the inequalities which can be generated by the proposed cut generation method. Preliminary computational results are also presented which show the effectiveness of the proposed cut generation method.

• Communications of the Korean Mathematical Society
• /
• v.10 no.4
• /
• pp.875-880
• /
• 1995

Let $S_p(\alpha)$ denote the class of the Spirallike functions of order $\alpha, 0 < $\mid$\alpha$\mid$ < \frac{\pi}{2}$ Let $\Pi_N$ denote the subset of $S_p(\alpha)$ consisting of all products $z\Pi^N_{j=1}(1-u_j z)^{-mt_j}$ where $m = 1 + e^{-2i\alpha},$\mid$u_j$\mid$ = 1, t_j > 0$ for $j = 1, \cdots, N$ and $\sum^{N}_{j=1}{t_j = 1}$. In this paper we prove that extreme points of $S_p(\alpha)$ may be found which lie in $\Pi_N$ for some $N \geq 2$. We are let to conjecture that all exreme points of $S_p(\alpha)$ lie in $\Pi_N$ for somer $N \geq 1$ and that every such function is an extreme point.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.59-64
• /
• 2014

We investigate $p(n){\cdot}2^{O(\sqrt{n})}$ algorithm for 0/1 knapsack problem where x is the total bit length of a list of sizes of n objects. The algorithm is adaptable of method that achieves a similar complexity for the partition and Subset Sum problem. The method can be applied to other optimization or decision problem based on a list of numerics sizes or weights. 0/1 knapsack problem can be used to solve NP-Complete Problems with pseudo-polynomial time algorithm. We try to apply this technique to bio-informatics problem which has pseudo-polynomial time complexity.

• Journal of the Chungcheong Mathematical Society
• /
• v.1 no.1
• /
• pp.27-32
• /
• 1988

In this paper, we study the multipliers of $A^p_q$ into $L^{p^{\prime}}$ when 0 < p' < p. For this purpose, we study the condition on the measure ${\mu}$ satisfying $A^p_q{\subset}A^{p^{\prime}}(d{\mu})$. It turns out that the quotient $k_q={\mu}/v_q$ over hyperbolic ball of radius less than 1 belongs to $L^s_q$, where $\frac{1}{s}+\frac{p^{\prime}}{p}=1$. For the proof, we replace the norm of $k_q$ by the Riemann sum, and then use a result of interpolation theory.