• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.529-545
• /
• 2022

This article concerns a ring property that arises from combining one-sided duo factor rings and centers. A ring R is called right CIFD if R/I is right duo by some proper ideal I of R such that I is contained in the center of R. We first see that this property is seated between right duo and right π-duo, and not left-right symmetric. We prove, for a right CIFD ring R, that W(R) coincides with the set of all nilpotent elements of R; that R/P is a right duo domain for every minimal prime ideal P of R; that R/W(R) is strongly right bounded; and that every prime ideal of R is maximal if and only if R/W(R) is strongly regular, where W(R) is the Wedderburn radical of R. It is also proved that a ring R is commutative if and only if D₃(R) is right CIFD, where D₃(R) is the ring of 3 by 3 upper triangular matrices over R whose diagonals are equal. Furthermore, we show that the right CIFD property does not pass to polynomial rings, and that the polynomial ring over a ring R is right CIFD if and only if R/I is commutative by a proper ideal I of R contained in the center of R.

• Journal of the Korean Mathematical Society
• /
• v.57 no.6
• /
• pp.1535-1549
• /
• 2020

This paper deals with the inverse of tails of Hurwitz zeta function. More precisely, for any positive integer s ≥ 2 and 0 ≤ a < 1, we give an algorithm for finding a simple form of f_s,a(n) such that $$\lim_{n{\rightarrow}{\infty}}\{\({\sum\limits_{k=n}^{\infty}}{\frac{1}{(k+a)^s}}\)^{-1}-f_{s,a}(n)\}=0$$. We show that f_s,a(n) is a polynomial in n-a of order s-1. All coefficients of f_s,a(n) are represented in terms of Bernoulli numbers.

• Journal of the Korean Mathematical Society
• /
• v.41 no.6
• /
• pp.1049-1070
• /
• 2004

We classify all partial differential equations with polynomial coefficients in $\chi$ and y of the form A($\chi$) $u_{{\chi}{\chi}}$ ＋ 2B($\chi$, y) $u_{{\chi}y}$ ＋ C(y) $u_{yy}$ ＋ D($\chi$) $u_{{\chi}}$ ＋ E(y) $u_{y}$ = λu, which has weak orthogonal polynomials as solutions and show that partial derivatives of all orders are orthogonal. Also, we construct orthogonal polynomials in d-variables satisfying second order partial differential equations in d-variables.s.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2013

In this paper, we propose a new multiplication algorithm for two polynomials using primitive polynomial with all 1 of coefficient on finite fields GF($2^m$), and design the multiplier with high-speed parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $m^2$ same basic cells that have a 2-input XOR gate and a 2-input AND gate. Since the basic cell have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $D_A+D_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.

• Communications of Mathematical Education
• /
• v.21 no.2 s.30
• /
• pp.283-302
• /
• 2007

It is said that the university mathematics education in Korea faces critical situations due to the decreases of both qualities and quantities of students. In this paper we examine college students in order to know their basic ability for understanding about fundamental functions, such as polynomial, trigonometric, logarithm and exponential functions which have learned from highschool mathematics courses. The subject are 354 freshmen of 4 universities located in Daejeon and Chongchung area. The result of this study shows as follows. i ) More than half students are not able to draw graphs of given functions, except polynomial. ii ) More students do not fully understand about function properties such as domain, codomain, range, max and min value, cycle and parallel translation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.3
• /
• pp.57-63
• /
• 2005

Kim and Fenn et al. proposed two modular AB multipliers based on LFSR(Linear Feedback Shift Register) architecture. These multipliers use AOP, which has all coefficients with '1', as an irreducible polynomial. Thereby, they have good hardware complexity compared to the previous architectures. This paper proposes a modular $AB^2$ multiplier based on LFSR architecture and a modular exponentiation architecture to improve the hardware complexity of the Kim's. Our multiplier also use the AOP as an irreducible polynomial as the Kim architecture. Simulation result shows that our multiplier reduces the hardware complexity about $50\%$ in the perspective of XOR and AND gates compared to the Kim's. The architecture could be used as a basic block to implement public-key cryptosystems.

• Journal for History of Mathematics
• /
• v.23 no.2
• /
• pp.101-121
• /
• 2010

This article includes an introduction, a history of Pick's theorem on lattice polyhedron and its proof, Reeve's theorem on 3-dimensional lattice polyhedrons extended from the Pick's theorem and Ehrhart polynomial generalized as an n-dimensional lattice polyhedron, and then shows the relationship between the volume of 3-dimensional polyhedron and the number of its lattice points by means of Reeve's theorem. It is aimed to apply the relationship to the visualization of sums in sequences.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1269-1282
• /
• 2010

We in this note consider a new concept, so called $\pi$-McCoy, which unifies McCoy rings and IFP rings. The classes of McCoy rings and IFP rings do not contain full matrix rings and upper (lower) triangular matrix rings, but the class of $\pi$-McCoy rings contain upper (lower) triangular matrix rings and many kinds of full matrix rings. We first study the basic structure of $\pi$-McCoy rings, observing the relations among $\pi$-McCoy rings, Abelian rings, 2-primal rings, directly finite rings, and ($\pi-$)regular rings. It is proved that the n by n full matrix rings ($n\geq2$) over reduced rings are not $\pi$-McCoy, finding $\pi$-McCoy matrix rings over non-reduced rings. It is shown that the $\pi$-McCoyness is preserved by polynomial rings (when they are of bounded index of nilpotency) and classical quotient rings. Several kinds of extensions of $\pi$-McCoy rings are also examined.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.155-161
• /
• 2017

This paper suggests polynomial time solution algorithm for Sudoku puzzle problem. This problem has been known NP (non-deterministic polynomial time)-complete. The proposed algorithm set the initial value of blank cells to value range of [$1,2,{\cdots},9$]. Then the candidate set values in blank cells deleted by preassigned clue in row, column, and block. We apply the basic rules of Stuart, and proposes two additional rules. Finally we apply binary backtracking(BBT) technique. For the experimental Sudoku puzzle with various categories of solution, the BBT algorithm can be obtain all of given Sudoku puzzle regardless of any types of solution.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.10-16
• /
• 2010

90/150 CA is a CA completely specified by using rule 90 and rule 150. Since 90/150 CA whose minimal and characteristic polynomials are identical has outstanding randomness, this CA is more attractive than LFSR. Sarkar proposed a scheme based on the 90 uniform CA and the 150 uniform CA. That scheme provided authentication by digital signature and other basic security requirements like confidentiality. In this paper we analyze 90 or 150 uniform CA and give a synthesis method of 2n-cell uniform CA and (2n+1)-cell uniform CA using a special n-cell 90/150 CA. And we propose an effective method of computation of characteristic polynomial corresponding to uniform CA.