• 대한수학회보
• /
• 제53권5호
• /
• pp.1471-1481
• /
• 2016

We characterize reducing subspaces of weighted shifts with operator weights as wandering invariant subspaces of the shifts with additional structures. We show how some earlier results on reducing subspaces of powers of weighted shifts with scalar weights on the unit disk and the polydisk can be fitted into our general framework.

• 대한수학회보
• /
• 제50권2호
• /
• pp.687-696
• /
• 2013

In this note, we completely characterize the reducing subspaces of $T_{{z^N_1}{z^M_2}}$ on $A^2_{\alpha}(D^2)$ where ${\alpha}$ > -1 and N, M are positive integers with $N{\neq}M$, and show that the minimal reducing subspaces of $T_{{z^N_1}{z^M_2}}$ on the unweighted Bergman space and on the weighted Bergman space are different.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1221-1228
• /
• 2017

We consider weighted Hardy spaces on bidisk ${\mathbb{D}}^2$ which generalize the weighted Bergman spaces $A^2_{\alpha}({\mathbb{D}}^2)$. Let z, w be coordinate functions and $T_{{\bar{z}}^N}_w$ Toeplitz operator with symbol $_{{\bar{z}}^N}_w$. In this paper, we study the reducing subspaces of $T_{{\bar{z}}^N}_w$ on the weighted Hardy spaces.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1443-1455
• /
• 2017

Let $M_{z^N}(N{\in}{\mathbb{Z}}^d_+)$ be a bounded multiplication operator on a class of Hilbert spaces with orthogonal basis $\{z^n:n{\in}{\mathbb{Z}}^d_+\}$. In this paper, we prove that each reducing subspace of $M_{z^N}$ is the direct sum of some minimal reducing subspaces. For the case that d = 2, we find all the minimal reducing subspaces of $M_{z^N}$ ($N=(N_1,N_2)$, $N_1{\neq}N_2$) on weighted Bergman space $A^2_{\alpha}({\mathbb{B}}_2)$(${\alpha}$ > -1) and Hardy space $H^2({\mathbb{B}}_2)$, and characterize the structure of ${\mathcal{V}}^{\ast}(z^N)$, the commutant algebra of the von Neumann algebra generated by $M_{z^N}$.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1649-1660
• /
• 2015

In this paper, we completely characterize the nontrivial reducing subspaces of the Toeplitz operator $T{_{z{^N_1{\bar{z}}^M_2}}$ on the Bergman space $A^2(\mathbb{D}^2)$, where N and M are positive integers.

• 대한수학회보
• /
• 제61권4호
• /
• pp.949-957
• /
• 2024

Let Y_p be the multiplication operator M_p plus the Volterra operator V_p induced by p(z), where p is a polynomial. Under a mild condition, we prove that Y_p acting on the Dirichlet space 𝔇 is similar to multiplication operator M_p acting on a subspace S(𝔻) of 𝔇. Furthermore, it shows that T_zⁿ (n ≥ 2) has exactly 2ⁿ reducing subspaces on 𝔇.

• 대한수학회보
• /
• 제55권1호
• /
• pp.41-50
• /
• 2018

This paper mainly considers a tuple of multiplication operators on Bergman spaces over polydisks which essentially arise from a matrix, their joint reducing subspaces and associated von Neumann algebras. It is shown that there is an interesting link of the non-triviality for such von Neumann algebras with the determinant of the matrix. A complete characterization of their abelian property is given under a more general setting.

• 대한수학회지
• /
• 제45권1호
• /
• pp.205-219
• /
• 2008

It is shown that if $A{\geq}0$ and T are two bounded linear operators on a complex Hilbert space H satisfying the inequality $T^*\;AT{\leq}A$ and the condition $AT=A^{1/2}TA^{1/2}$, then there exists the maximum reducing subspace for A and $A^{1/2}T$ on which the equality $T^*\;AT=A$ is satisfied. We concretely express this subspace in two ways, and as applications, we derive certain decompositions for quasinormal contractions. Also, some facts concerning the quasi-isometries are obtained.

• Steel and Composite Structures
• /
• 제18권2호
• /
• pp.289-303
• /
• 2015

This study presents a strategy so-called Subspace Search Mechanism (SSM) for reducing the computational time for convergence of population based metaheusristic algorithms. The selected metaheuristic for this study is the Cuckoo Search algorithm (CS) dealing with size optimization of trusses. The complexity of structural optimization problems can be partially due to the presence of high-dimensional design variables. SSM approach aims to reduce dimension of the problem. Design variables are categorized to predefined groups (subspaces). SSM focuses on the multiple use of the metaheuristic at hand for each subspace. Optimizer updates the design variables for each subspace independently. Updating rules require candidate designs evaluation. Each candidate design is the assemblage of responsible set of design variables that define the subspace of interest. SSM is incorporated to the Cuckoo Search algorithm for size optimizing of three small, moderate and large space trusses. Optimization results indicate that SSM enables the CS to work with less number of population (42%), as a result reducing the time of convergence, in exchange for some accuracy (1.5%). It is shown that the loss of accuracy can be lessened with increasing the order of complexity. This suggests its applicability to other algorithms and other complex finite element-based engineering design problems.