• Title/Summary/Keyword: (strongly) preserve

Search Result 40, Processing Time 0.027 seconds

LINEAR OPERATORS THAT PRESERVE SETS OF PRIMITIVE MATRICES

  • Beasley, Leroy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.51 no.4
    • /
    • pp.773-789
    • /
    • 2014
  • We consider linear operators on square matrices over antinegative semirings. Let ${\varepsilon}_k$ denote the set of all primitive matrices of exponent k. We characterize those linear operators which preserve the set ${\varepsilon}_1$ and the set ${\varepsilon}_2$, and those that preserve the set ${\varepsilon}_{n^2-2n+2}$ and the set ${\varepsilon}_{n^2-2n+1}$. We also characterize those linear operators that strongly preserve ${\varepsilon}_2$, ${\varepsilon}_{n^2-2n+2}$ or ${\varepsilon}_{n^2-2n+1}$.

CHARACTERIZATIONS OF BOOLEAN RANK PRESERVERS OVER BOOLEAN MATRICES

  • Beasley, Leroy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • The Pure and Applied Mathematics
    • /
    • v.21 no.2
    • /
    • pp.121-128
    • /
    • 2014
  • The Boolean rank of a nonzero m $m{\times}n$ Boolean matrix A is the least integer k such that there are an $m{\times}k$ Boolean matrix B and a $k{\times}n$ Boolean matrix C with A = BC. In 1984, Beasley and Pullman showed that a linear operator preserves the Boolean rank of any Boolean matrix if and only if it preserves Boolean ranks 1 and 2. In this paper, we extend this characterization of linear operators that preserve the Boolean ranks of Boolean matrices. We show that a linear operator preserves all Boolean ranks if and only if it preserves two consecutive Boolean ranks if and only if it strongly preserves a Boolean rank k with $1{\leq}k{\leq}min\{m,n\}$.

Thumb Tip Reconstruction with Subcutaneous Pocket Graft - 2 Cases Report - (피하 주머니 이식술을 이용한 수부 무지 첨부 재건술 - 2예 보고 -)

  • Lee, Young-Keun;Moon, Young-Jae;Lee, Jun-Mo
    • Archives of Reconstructive Microsurgery
    • /
    • v.20 no.2
    • /
    • pp.126-131
    • /
    • 2011
  • Purpose: The subcutaneous pocket graft of the thumb tip amputation across or proximal to the lunula is chosen in case of impossible microvascular anastomosis and in patient who strongly desired to preserve the thumb tip after failed replantation. Materials and Methods: Two patients who underwent a subcutaneous pocket graft for a thumb tip reconstruction between August 2008 and November 2009 were reviewed retrospectively. They were all males with a mean age at the time of surgery of 48 years and had sustained complete thumb tip amputations across or proximal to the lunula. In one case, the microsurgical replantation was not feasible and the other one revealed arterial insufficiency at the 7th day after microsurgical replantation. Results: Authors had experienced 2 cases of flaps which survived completely. The results of sensibility was good, the range of motion at interphalangeal joint and tip to tip pinch was acceptable and color mismatch and loss of thumb finger nail was unacceptable after more than 1 year follow up with conventional successful thumb tip replantation. Conclusion: The subcutaneous pocket graft could be chosen in thumb tip amputation in case of impossible microvascular anastomosis as well as who strongly desires to preserve thumb tip after failed replantation.

  • PDF

Characterizations of Zero-Term Rank Preservers of Matrices over Semirings

  • Kang, Kyung-Tae;Song, Seok-Zun;Beasley, LeRoy B.;Encinas, Luis Hernandez
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.4
    • /
    • pp.619-627
    • /
    • 2014
  • Let $\mathcal{M}(S)$ denote the set of all $m{\times}n$ matrices over a semiring S. For $A{\in}\mathcal{M}(S)$, zero-term rank of A is the minimal number of lines (rows or columns) needed to cover all zero entries in A. In [5], the authors obtained that a linear operator on $\mathcal{M}(S)$ preserves zero-term rank if and only if it preserves zero-term ranks 0 and 1. In this paper, we obtain new characterizations of linear operators on $\mathcal{M}(S)$ that preserve zero-term rank. Consequently we obtain that a linear operator on $\mathcal{M}(S)$ preserves zero-term rank if and only if it preserves two consecutive zero-term ranks k and k + 1, where $0{\leq}k{\leq}min\{m,n\}-1$ if and only if it strongly preserves zero-term rank h, where $1{\leq}h{\leq}min\{m,n\}$.

ISOLATION NUMBERS OF INTEGER MATRICES AND THEIR PRESERVERS

  • Beasley, LeRoy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.3
    • /
    • pp.535-545
    • /
    • 2020
  • Let A be an m × n matrix over nonnegative integers. The isolation number of A is the maximum number of isolated entries in A. We investigate linear operators that preserve the isolation number of matrices over nonnegative integers. We obtain that T is a linear operator that strongly preserve isolation number k for 1 ≤ k ≤ min{m, n} if and only if T is a (P, Q)-operator, that is, for fixed permutation matrices P and Q, T(A) = P AQ or, m = n and T(A) = P AtQ for any m × n matrix A, where At is the transpose of A.

RESOLUTION OF THE CONJECTURE ON STRONG PRESERVERS OF MULTIVARIATE MAJORIZATION

  • Beasley, Leroy-B.;Lee, Sang-Gu;Lee, You-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.39 no.2
    • /
    • pp.283-287
    • /
    • 2002
  • In this paper, we will investigate the set of linear operators on real square matrices that strongly preserve multivariate majorisation without any additional conditions on the operator. This answers earlier conjecture on nonnegative matrices in [3] .

A Study on the Creating and Utilizing the Green Space in Tokyo -focusing on city parks- (동경의 녹지공간 조성과 그 운용에 관한 연구 -도시공원을 중심으로-)

  • 이현욱
    • Journal of the Korean Geographical Society
    • /
    • v.34 no.3
    • /
    • pp.247-264
    • /
    • 1999
  • In this study, I investigate how city parks have been created, and what are some characteristics of the location and function of 69 city parks in Tokyo. The city parks in Tokyo have been made in three patterns. The first is planned parks which have been created as a urban facilities considering the scales and types. The second is memorial parks which have been made to memorialize the national monumental event or to preserve natural and cultural resources. The third is public property parks which have been made by occurrence of public vacant land which is resulted from the grant of Royal Garden, restoration of public rented ground, producton of reclaimed land, utilization of dry river bed. The city parks can be classified in five patterns according to distance from CBD and park area. The first is central parks which have historical characteristics strongly. The second is planned parks that are specialized functionally. The third is large scale urban edge parks which are located in the edge of 23-Gu(district) in Tokyo. The fourth is hill parks which have natural characteristics strongly. The fifth is waterside parks that are located along a lake, a pond, a river, or artificial waterside facilities. From this study I have found out that a great effort has been made to activate the utilization of parks for residents in Tokyo, through mnagement goals and ways of parks, composition and chatacteristics of park facility resources, various Events, residents participation in undertaking of parks.

  • PDF

LINEAR PRESERVERS OF BOOLEAN RANK BETWEEN DIFFERENT MATRIX SPACES

  • Beasley, LeRoy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.3
    • /
    • pp.625-636
    • /
    • 2015
  • The Boolean rank of a nonzero $m{\times}n$ Boolean matrix A is the least integer k such that there are an $m{\times}k$ Boolean matrix B and a $k{\times}n$ Boolean matrix C with A = BC. We investigate the structure of linear transformations T : $\mathbb{M}_{m,n}{\rightarrow}\mathbb{M}_{p,q}$ which preserve Boolean rank. We also show that if a linear transformation preserves the set of Boolean rank 1 matrices and the set of Boolean rank k matrices for any k, $2{\leq}k{\leq}$ min{m, n} (or if T strongly preserves the set of Boolean rank 1 matrices), then T preserves all Boolean ranks.