• Title/Summary/Keyword: Preservers

Search Result 41, Processing Time 0.021 seconds

Linear Preservers of Perimeters of Nonnegative Real Matrices

  • Song, Seok-Zun;Kang, Kyung-Tae
    • Kyungpook Mathematical Journal
    • /
    • v.48 no.3
    • /
    • pp.465-472
    • /
    • 2008
  • For a nonnegative real matrix A of rank 1, A can be factored as $ab^t$ for some vectors a and b. The perimeter of A is the number of nonzero entries in both a and b. If B is a matrix of rank k, then B is the sum of k matrices of rank 1. The perimeter of B is the minimum of the sums of perimeters of k matrices of rank 1, where the minimum is taken over all possible rank-1 decompositions of B. In this paper, we obtain characterizations of the linear operators which preserve perimeters 2 and k for some $k\geq4$. That is, a linear operator T preserves perimeters 2 and $k(\geq4)$ if and only if it has the form T(A) = UAV or T(A) = $UA^tV$ with some invertible matrices U and V.

LINEAR PRESERVERS OF SYMMETRIC ARCTIC RANK OVER THE BINARY BOOLEAN SEMIRING

  • Beasley, LeRoy B.;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1317-1329
    • /
    • 2017
  • A Boolean rank one matrix can be factored as $\text{uv}^t$ for vectors u and v of appropriate orders. The perimeter of this Boolean rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A Boolean matrix of Boolean rank k is the sum of k Boolean rank one matrices, a rank one decomposition. The perimeter of a Boolean matrix A of Boolean rank k is the minimum over all Boolean rank one decompositions of A of the sums of perimeters of the Boolean rank one matrices. The arctic rank of a Boolean matrix is one half the perimeter. In this article we characterize the linear operators that preserve the symmetric arctic rank of symmetric Boolean matrices.

LINEAR MAPS PRESERVING PAIRS OF HERMITIAN MATRICES ON WHICH THE RANK IS ADDITIVE AND APPLICATIONS

  • TANG XIAO-MIN;CAO CHONG-GUANG
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.253-260
    • /
    • 2005
  • Denote the set of n ${\times}$ n complex Hermitian matrices by Hn. A pair of n ${\times}$ n Hermitian matrices (A, B) is said to be rank-additive if rank (A+B) = rank A+rank B. We characterize the linear maps from Hn into itself that preserve the set of rank-additive pairs. As applications, the linear preservers of adjoint matrix on Hn and the Jordan homomorphisms of Hn are also given. The analogous problems on the skew Hermitian matrix space are considered.

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.

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\}$.

STRONG PRESERVERS OF SYMMETRIC ARCTIC RANK OF NONNEGATIVE REAL MATRICES

  • Beasley, LeRoy B.;Encinas, Luis Hernandez;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1503-1514
    • /
    • 2019
  • A rank 1 matrix has a factorization as $uv^t$ for vectors u and v of some orders. The arctic rank of a rank 1 matrix is the half number of nonzero entries in u and v. A matrix of rank k can be expressed as the sum of k rank 1 matrices, a rank 1 decomposition. The arctic rank of a matrix A of rank k is the minimum of the sums of arctic ranks of the rank 1 matrices over all rank 1 decomposition of A. In this paper we obtain characterizations of the linear operators that strongly preserve the symmetric arctic ranks of symmetric matrices over nonnegative reals.

SPANNING COLUMN RANKS OF NON-BINARY BOOLEAN MATRICES AND THEIR PRESERVERS

  • Kang, Kyung-Tae;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.507-521
    • /
    • 2019
  • For any $m{\times}n$ nonbinary Boolean matrix A, its spanning column rank is the minimum number of the columns of A that spans its column space. We have a characterization of spanning column rank-1 nonbinary Boolean matrices. We investigate the linear operators that preserve the spanning column ranks of matrices over the nonbinary Boolean algebra. That is, for a linear operator T on $m{\times}n$ nonbinary Boolean matrices, it preserves all spanning column ranks if and only if there exist an invertible nonbinary Boolean matrix P of order m and a permutation matrix Q of order n such that T(A) = PAQ for all $m{\times}n$ nonbinary Boolean matrix A. We also obtain other characterizations of the (spanning) column rank preserver.

On the primacy of auditory phonetics In tonological analysis and pitch description;In connection with the development of a new pitch scale (성조 분석과 음조 기술에서 청각음성학의 일차성;반자동 음조 청취 등급 분석기 개발과 관련하여)

  • Gim, Cha-Gyun
    • Proceedings of the KSPS conference
    • /
    • 2007.05a
    • /
    • pp.3-23
    • /
    • 2007
  • King Sejong the Great, his students in Jip-hyeun-jeon school and Choe Sejin, their successor of the sixteenth century, indicated Middle Korean had three distinctive pitches, low, high, and rising (phyeong-, geo-, sang-sheong). Thanks to $Hun-min-jeng-{\emptyset}eum$ as well as its Annotation and side-dots literatures in fifteenth and sixteenth centuries, we can compare Middle Korean with Hamgyeong dialect, Gyeongsang dialect, and extant tone dialects with joint preservers of what was probably the tonal system of unitary mother Korean language. What is most remarkable about middle Korean phonetic work is its manifest superiority in conception and execution as anything produced in the present day linguistic scholarship. But at this stage in linguistics, prior to the technology and equipment needed for the scientific analysis of sound waves, auditory description was the only possible frame for an accurate and systematic classification. And auditory phonetics still remains fundamental in pitch description, even though modern acoustic categories may supplement and supersede auditory ones in tonological analysis. Auditory phonetics, however, has serious shortcoming that its theory and practice are too subject to be developed into the present century science. With joint researchers, I am developping a new pitch scale. It is a semiautomatic auditory grade pitch analysis program. The result of our labor will give a significant breakthrough to upgrade our component in linguistics.

  • 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\}$.

Fixation and Leaching Characteristics of CCA- and CCFZ- Treated Domestic Softwood Species

  • Kim, Jae-Jin;Kim, Hyung-Jun;Ra, Jong-Bum;Chun, Su Kyoung;Kim, Gyu-Hyeok
    • Journal of the Korean Wood Science and Technology
    • /
    • v.31 no.6
    • /
    • pp.55-59
    • /
    • 2003
  • The fixation and leaching characteristics of chromated copper arsenate (CCA Type C) and chromium- copper-fluoride-zinc (CCFZ) in domestic softwood (Japanese red pine, Korean pine, and Japanese larch) sapwood were investigated using the expressate method to follow chromium fixation and the American Wood-Preservers' Association (AWPA) leaching procedure to determine leaching properties after fixation. The rates of fixation were affected by preservative types; CCA was fixed much faster than CCFZ for all species evaluated. There were definite differences in the fixation rates of different species, with Korean pine requiring shorter to fix than the other species evaluated. Chromium fixation was greatly enhanced by elevated temperatures, and fixation time can be estimated according to fixation temperatures applied. The percentage of arsenic and zinc leached from domestic softwoods was relatively high compared to chromium and copper, indicating that there is still a relatively high unfixed arsenic and zinc components after complete chromium fixation in CCA-and CCFZ-treated samples, respectively.