• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.367-378
• /
• 2018

In this paper, we study m-isometric Toeplitz operators $T_{\varphi}$ with rational symbols. We characterize m-isometric Toeplitz operators $T_{\varphi}$ by properties of the rational symbols ${\varphi}$. In addition, we give a necessary and sufficient condition for Toeplitz operators $T_{\varphi}$ with analytic symbols ${\varphi}$ to be m-expansive or m-contractive. Finally, we give some results for m-expansive and m-contractive Toeplitz operators $T_{\varphi}$ with trigonometric polynomial symbols ${\varphi}$.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.617-625
• /
• 2011

In [6], it was shown that hyponormality for Toeplitz operators with polynomial symbols can be reduced to classical Schur's algorithm in function theory. In [6], Zhu has also given the explicit values of the Schur's functions ${\Phi}_0$, ${\Phi}_1$ and ${\Phi}_2$. Here we explicitly evaluate the Schur's function ${\Phi}_3$. Using this value we find necessary and sufficient conditions under which the Toeplitz operator $T_{\varphi}$ is hyponormal, where ${\varphi}$ is a trigonometric polynomial given by ${\varphi}(z)$ = ${\sum}^N_{n=-N}a_nz_n(N{\geq}4)$ and satisfies the condition $\bar{a}_N\(\array{a_{-1}\\a_{-2}\\a_{-4}\\{\vdots}\\a_{-N}}\)=a_{-N}\;\(\array{\bar{a}_1\\\bar{a}_2\\\bar{a}_4\\{\vdots}\\\bar{a}_N}\)$. Finally we illustrate the easy applicability of the derived results with a few examples.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.1
• /
• pp.65-73
• /
• 2011

In this note we present some necessary and sufficient conditions for the hyponormality of Toeplitz operators $T_{\varphi}$ under certain assumptions concerning the trigonometric polynomial symbol ${\varphi}$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.533-542
• /
• 2019

We study commutants of Toeplitz operators acting on the Dirichlet space of the unit disk and prove that an operator in the Toeplitz algebra commuting with a Toeplitz operator with a nonconstant polynomial symbol must be a Toeplitz operator with an analytic symbol.

• Honam Mathematical Journal
• /
• v.40 no.1
• /
• pp.155-162
• /
• 2018

In this paper, we are concerned with hyponormal Toeplitz operators on the Hardy space of the unit circle. Our main result of this paper is to provide a simple and transparent proof on the hyponormality of Toeplitz operators with symmetric-type symbols via Schur complement lemma.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2431-2441
• /
• 1999

Equations are widely used in representing information. One of the basic questions about equations is to determine whether a given equation follows logically from the set of equations. Rewrite systems are one of the method to answer many instances of this problem. A rewrite system simplifies a given term by applying rewrite rules successively. Hence it is important that the process of simplification does not go on indefinitely. One of the methods to check whether a rewrite system terminates (that is, the rewrite system does not go on indefinitely) is polynomial orderings. A polynomial ordering assigns an appropriate polynomial to each function symbol. However, how to assign polynomials to function symbols is not known. We propose an automatic way of generating polynomial orderings using genetic algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.647-653
• /
• 2011

In this note we are concerned with the hyponormality of Toeplitz operators $T_{\phi}$ with polynomial symbols ${\phi}=\bar{g}+f(f,g{\in}H^{\infty}(\mathbb{T}))$ when g divides f.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.20-28
• /
• 2012

We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.683-689
• /
• 2007

Let $\mathcal{B}$ be a certain Banach space consisting of analytic functions defined on a bounded domain G in the complex plane. Let ${\varphi}$ be an analytic polynomial or a rational function and let $M_{\varphi}$ denote the operator of multiplication by ${\varphi}$. Under certain condition on ${\varphi}$ and G, we characterize the commutant of $M_{\varphi}$ that is the set of all bounded operators T such that $TM_{\varphi}=M_{\varphi}T$. We show that $T=M_{\Psi}$, for some function ${\Psi}$ in $\mathcal{B}$.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.205-208
• /
• 2003

In this paper, we realized radio controller with Convolution code and CRC code to solve the wired and wireless controller's problem that is present industry spot. We used microprocessor as a controller, and analyzed testing data with and without Convolution code. Convolution code of constraint length k=3, symbols rate 1/2 dramatically improves the radio controller's fidelity, and the number of CRC bit is 16bit(2byte) and the polynomial of /Χ$^{15}$ ＋Χ$^{2}$＋1 is used.