• 대한수학회지
• /
• 제48권1호
• /
• pp.83-104
• /
• 2011

In this note, compound-commuting additive maps on matrix spaces are studied. We show that compound-commuting additive maps send rank one matrices to matrices of rank less than or equal to one. By using the structural results of rank-one nonincreasing additive maps, we characterize compound-commuting additive maps on four types of matrices: triangular matrices, square matrices, symmetric matrices and Hermitian matrices.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제2권2호
• /
• pp.27-30
• /
• 1998

Let A and B be $m{\times}n$ matrices. A linear operator T preserves the set of matrices on which the rank is additive if rank(A+B) = rank(A)+rank(B) implies that rank(T(A) + T(B)) = rankT(A) + rankT(B). We characterize the set of all linear operators which preserve the set of pairs of $n{\times}n$ matrices on which the rank is additive.

• Journal of applied mathematics & informatics
• /
• 제19권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.

• 대한수학회보
• /
• 제55권5호
• /
• pp.1587-1598
• /
• 2018

We study additive decompositions (and generalized additive decompositions with a zero-dimensional scheme instead of a finite sum of rank 1 tensors), which are not of minimal degree (for sums of rank 1 tensors with more terms than the rank of the tensor, for a zero-dimensional scheme a degree higher than the cactus rank of the tensor). We prove their existence for all degrees higher than the rank of the tensor and, with strong assumptions, higher than the cactus rank of the tensor. Examples show that additional assumptions are needed to get the minimally spanning scheme of degree cactus +1.

• 한국통신학회논문지
• /
• 제15권11호
• /
• pp.955-961
• /
• 1990

신호 의존성 잡음(signal-dependent noise)이 섞인 관측 모형에서 순위 통계량(rank statistic)을 써서 약한 신호를 검파하는 검파기의 검정 통계량을 얻었다. 이 논문에서는 비가선성 잡음(non-additive noise)환경을 생각하려고 순가산성 잡음 뿐만 아니라 신호 의존성 잡음도 함께 나타내는 일반화된 관측모델을 썼다. 이 모형에서 얻은 국소 최적순위(locally optimum rank) 검파기는 국소 최적(locally optimum) 검파기와 비슷한 몰을 가지고, 순가산성 잡음 모형에서의 국소 최적 순위 검파기를 일반화한 것임을 보였다. 또한 다중 입력인 때에도 비슷한 결과를 얻을 수 있음을 알 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.115-122
• /
• 2004

We characterize the additive operators preserving rank-additivity on symmetry matrix spaces. Let $S_{n}(F)$ be the space of all $n\;\times\;n$ symmetry matrices over a field F with 2, $3\;\in\;F^{*}$, then T is an additive injective operator preserving rank-additivity on $S_{n}(F)$ if and only if there exists an invertible matrix $U\;\in\;M_n(F)$ and an injective field homomorphism $\phi$ of F to itself such that $T(X)\;=\;cUX{\phi}U^{T},\;\forallX\;=\;(x_{ij)\;\in\;S_n(F)$ where $c\;\in;F^{*},\;X^{\phi}\;=\;(\phi(x_{ij}))$. As applications, we determine the additive operators preserving minus-order on $S_{n}(F)$ over the field F.

• 대한수학회지
• /
• 제45권2호
• /
• pp.301-312
• /
• 2008

The spanning column rank of an $m{\times}n$ matrix A over a semiring is the minimal number of columns that span all columns of A. We characterize linear operators that preserve the sets of matrix pairs which satisfy additive properties with respect to spanning column rank of matrices over semirings.

• Communications for Statistical Applications and Methods
• /
• 제16권2호
• /
• pp.325-334
• /
• 2009

In this research, we propose a nonparametric test procedure for the right censored and grouped data under the additive hazards model. For deriving the test statistics, we use the likelihood principle. Then we illustrate proposed test with an example and compare the performance with other procedure by obtaining empirical powers. Finally we discuss some interesting features concerning the proposed test.

• 한국통신학회논문지
• /
• 제22권7호
• /
• pp.1543-1549
• /
• 1997

In this paper, rank-based nonparmetric detection of composite signals in additive noise is considered. Based on signs and ranks of observations, the locally optimum detector is deived for weak-signal detection under any specified noise probability density funhction. This detector has similarities to the locally optimum detector for comjposite signals in additive noise. The asymptotic performance of this nonparametric detector is shown to be as good as that of the locally optimum detector.

• 한국통신학회논문지
• /
• 제16권5호
• /
• pp.445-448
• /
• 1991

두 표본을 쓸 수 있을 때 순위 통계량을 써서 가산성 잡음이 섞여 있는 확률 신호를 검파하는 국소 최적 순위 검파기를 얻었다. 이 검파기는 확률 신호를 검파하는 국소 최적 검파기나 한 표본을 쓰는 국소 최적 순위 검파기와 비슷한 열개를 가지며, 알려진 신호를 검파하는 두 표본 국소 최적 순위 검파기를 일반화한 꼴을 가진다는 것을 보였다. 뿐만 아니라, 입력이 여러 개 있을 때에 확률 신호를 국소 최적 순위 검파하는 문제도 간략히 살펴보았다.