• Journal of the Korean Mathematical Society
• /
• v.14 no.1
• /
• pp.33-40
• /
• 1977

• Journal of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.65-77
• /
• 1976

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1421-1433
• /
• 2011

In this paper, using a fixed point approach, the generalized Hyeres-Ulam stability of the following quadratic functional equation $f(x+y+z)+f(x+{\sigma}(y))+f(y+{\sigma}(z))+f(x+{\sigma}(z))=3(f(x)+f(y)+f(z))$ will be studied, where f is a function from abelian group G into a quasi-${\beta}$-normed space and ${\sigma}$ is an involution on the group G. Next, we consider its pexiderized equation of the form $f(x+y+z)+f(x+{\sigma}(y))+f(y+{\sigma}(z))+f(x+{\sigma}(z))=g(x)+g(y)+g(z)$ and its generalized Hyeres-Ulam stability.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.817-828
• /
• 2005

In this note we show that there is an anti-symplectic involution $\sigma\;:\;X\;\to\;X$ on a simply-connected, closed, non-Kahler and symplectic 4-manifold X with a disjoint union of Riemann surfaces ${\amalg}^n_{i=1}{\Sigma}_i,\;n\;{\ge}\;2$ as a fixed point set. Also we show that its quotient X/$\sigma$ is homeomorphic to $\mathbb{CP}^2{\sharp}r\mathbb{CP}^2$ but not diffeomorphic to $\mathbb{CP}^2{\sharp}r\mathbb{CP}^2,\;r\;=\;b_2^-(X/{\sigma})$.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.216-221
• /
• 1998

본 논문에서는 새로운 가변길이 블록 암호알고리즘을 제안한다. 제안된 블록 암호알고리즘은 128비트에서 256비트까지의 가변적인 키 길이를 가지며 가변적인 라운드 수를 사용한다. 각 라운드는 서로 다른 두 개의 F함수를 사용하여 2단계로 구성되는 double involution 구조를 사용하며, 또한 두 개의 서로 다른 키 스케줄링 알고리즘을 사용하여 알려진 공격에 대해 안전하도록 설계하였다.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.665-680
• /
• 2002

For a smooth projective irreducible algebraic curve C of odd gonality, the maximal possible dimension of the variety of special linear systems ${W^r}_d$(C) is d－3r by a result of M. Coppens et at. [4]. This bound also holds if C does not admit an involution. Furthermore it is known that if dim ${W^r}_d(C)qeq$ d-3r-1 for a curve C of odd gonality, then C is of very special type of curves by a recent progress made by G. Martens [11] and Kato-Keem [9]. The purpose of this paper is to pursue similar results for curves of even gonality which does not admit an involution.

• Communications of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.455-468
• /
• 2020

An element in a ring R with identity is called invo-clean if it is the sum of an idempotent and an involution and R is called invoclean if every element of R is invo-clean. Let C(R) be the center of a ring R and g(x) be a fixed polynomial in C(R)[x]. We introduce the new notion of g(x)-invo clean. R is called g(x)-invo if every element in R is a sum of an involution and a root of g(x). In this paper, we investigate many properties and examples of g(x)-invo clean rings. Moreover, we characterize invo-clean as g(x)-invo clean rings where g(x) = (x-a)(x-b), a, b ∈ C(R) and b - a ∈ Inv(R). Finally, some classes of g(x)-invo clean rings are discussed.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.283-294
• /
• 2007

By a near ${\lambda}$-lattice is meant an upper ${\lambda}$-semilattice where is defined a parti binary operation $x{\Lambda}y$ with respect to the induced order whenever $x$, $y$ has a common lower bound. Alternatively, a near ${\lambda}$-lattice can be described as an algebra with one ternary operation satisfying nine simple conditions. Hence, the class of near ${\lambda}$-lattices is a quasivariety. A ${\lambda}$-semilattice $\mathcal{A}=(A;{\vee})$ is said to have sectional (antitone) involutions if for each $a{\in}A$ there exists an (antitone) involution on [$a$, 1], where 1 is the greatest element of $\mathcal{A}$. If this antitone involution is a complementation, $\mathcal{A}$ is called an ortho ${\lambda}$-semilattice. We characterize these near ${\lambda}$-lattices by certain identities.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.90-97
• /
• 1998

In this paper, we propose a new variable length block cipher. It has a variable key length from 128-bit to 256-bit and uses a variable number of rounds. In each round, the proposed algorithm uses the double involution structure which consists of tow steps and two different F functions. In addition, the proposed algorithm has two different key schedulings for providing the strength against known attacks.

• Asian-Australasian Journal of Animal Sciences
• /
• v.13 no.9
• /
• pp.1201-1204
• /
• 2000

We examined expression patterns of imc-415 gene in mammary gland and in HC11 mammary epithelial cells in culture. mRNA levels of imc-415 gene were higher at pregnancy and involution stages of mouse mammary gland compared with lactation period. Expression of imc-415 gene was induced with serum starvation or treatment with Fas monoclonal antibody in HC11 mammary epithelial cells in culture.