• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.225-251
• /
• 2018

The m-isometry of a single operator in Agler and Stankus [3] was naturally generalized to the m-isometric tuple of several commuting operators by Gleason and Richter [22]. Some examples of m-isometric tuples including the recently much studied Arveson-Drury d-shift were given in [22]. We provide more examples of m-isometric tuples of operators by using sums of operators or products of operators or functions of operators. A class of m-isometric tuples of unilateral weighted shifts parametrized by polynomials are also constructed. The examples in Gleason and Richter [22] are then obtained by choosing some specific polynomials. This work extends partially results obtained in several recent papers on the m-isometry of a single operator.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.485-495
• /
• 2017

The aim of this paper is twofold. Firstly, we introduce the concept of semi-partial isometry in a Banach algebra and carry out a comparison and a classification study for this concept. In particular, we show that in the context of $C^*$-algebras this concept coincides with the notion of partial isometry. Our results encompass several earlier ones concerning partial isometries in Hilbert spaces, Banach spaces and $C^*$-algebras. Finally, we study the notion of (m, p)-semi partial isometries.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.15-30
• /
• 2024

In this paper, we focus on partial isometry elements and strongly EP elements on a ring. We construct characterizing equations such that an element which is both group invertible and MP-invertible, is a partial isometry element, or is strongly EP, exactly when these equations have a solution in a given set. In particular, an element a ∈ R^# ∩ R^† is a partial isometry element if and only if the equation x = x(a^†)^*a^† has at least one solution in {a, a#, a^†, a^*, (a^#)^*, (a^†)^*}. An element a ∈ R^#∩R^† is a strongly EP element if and only if the equation (a^†)^*xa^† = xa^†a has at least one solution in {a, a^#, a^†, a^*, (a^#)^*, (a^†)^*}. These characterizations extend many well-known results.

• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.455-468
• /
• 1996

Certain analytic behavior of geometric objects defined on a Riemannian manifold depends on some very crude properties of the manifold. Some of those crude invariants are the volume growth rate, isoperimetric constants, and the likes. However, these crude invariants sometimes exercise surprising control over the analytic behavior.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.739-745
• /
• 2014

It has been shown in compressive sensing that every s-sparse $x{\in}R^N$ can be recovered from the measurement vector y=Ax or the noisy vector y=Ax+e via ${\ell}_1$-minimization as soon as the 3s-restricted isometry constant of the sensing matrix A is smaller than 1/2 or smaller than $1/\sqrt{3}$ by applying the Iterative Hard Thresholding (IHT) algorithm. However, recovery can be guaranteed by practical algorithms for some certain assumptions of acquisition schemes. One of the key assumption is that the sensing matrix must satisfy the Restricted Isometry Property (RIP), which is often violated in the setting of many practical applications. In this paper, we studied a generalization of RIP, called Restricted Biorthogonality Property (RBOP) for anisotropic cases, and the new recovery algorithms called oblique pursuits. Then, we provide an analysis on the success of sparse recovery in terms of restricted biorthogonality constant for the IHT algorithms.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.358-360
• /
• 2004

The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.309-318
• /
• 2006

Let X and Y be real Banach spaces and ${\varepsilon}\;>\;0$, p > 1. Let f : $X\;{\to}\;Y$ be a bijective mapping with f(0) = 0 satisfying $$|\;{\parallel}f(x)-f(y){\parallel}-{\parallel}{x}-y{\parallel}\;|\;{\leq}{\varepsilon}{\parallel}{x}-y{\parallel}^p$$ for all $x\;{\in}\;X$ and, let $f^{-1}\;:\;Y\;{\to}\;X$ be uniformly continuous. Then there exist a constant ${\delta}\;>\;0$ and N(${\varepsilon},p$) such that lim N(${\varepsilon},p$)=0 and a unique surjective isometry I : X ${\to}$ Y satisfying ${\parallel}f(x)-I(x){\parallel}{\leq}N({\varepsilon,p}){\parallel}x{\parallel}^p$ for all $x\;{\in}\;X\;with\;{\parallel}x{\parallel}{\leq}{\delta}$.

• Journal of the Korean Arthroscopy Society
• /
• v.2 no.1
• /
• pp.15-20
• /
• 1998

Less has been written about the PCL than the ACL. There has, however, been an increasing amount of the interest in the PCL recently. Surgical reconstructions using grafts are often performed. However, these procesures often fail to provide long-term stability and function. Graft attachment sites are critical determinants of success in the PCL reconstruction. The clinical literature contains conflicting recommendations for graft attachment sites. We present a review of the isometry of the PCL.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.2
• /
• pp.119-128
• /
• 2014

Computing the natural-looking interpolation of different shapes is a fundamental problem of computer graphics. It is proved by some researchers that such an interpolation can be achieved by pursuing the isometry. In this paper, a novel coordinate system that is invariant under isometries is defined. The coordinate system can easily be converted from the global vertex coordinates. Furthermore, the global coordinates can be efficiently recovered from the new coordinates by simply solving two sparse least-squares problems. Since the proposed coordinate system is invariant under isometries, then transformations such as global rigid trans-formations, articulated posture deformations, or any other isometric deformations, do not change the coordinate values. Therefore, shape interpolation can be done in this framework without being affected by the distortions caused by the isometry.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1727-1733
• /
• 2014

The 2-hyperreflexivity of Toeplitz-harmonic type subspace generated by an isometry or a quasinormal operator is shown. The k-hyperreflexivity of the tensor product $\mathcal{S}{\otimes}\mathcal{V}$ of a k-hyperreflexive decom-posable subspace $\mathcal{S}$ and an abelian von Neumann algebra $\mathcal{V}$ is established.