• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.345-362
• /
• 2023

Prouhet string morphism has been a well investigated morphism in different studies on combinatorics on words. In this paper we consider Prouhet array morphism for the images of binary picture arrays in terms of Parikh q-matrices. We state the formulae to calculate q-counting scattered subwords of the images of any arrays under this array morphism and also investigate the properties such as q-weak ratio property and commutative property under this array morphism in terms of Parikh q- matrices of arrays.

• Journal of Elementary Mathematics Education in Korea
• /
• v.12 no.1
• /
• pp.79-100
• /
• 2008

Freudenthal has advocated the reinvention method. In that method, the pupils start with a meaningful context, not ready-made concepts, and invent informative method through which he could arrive at the formative concepts progressively. In many face the reinvention method is contrary to the traditional method. In traditional method, which was named as 'concretization method' by Freudenthal, the pupils start with ready-made concepts, and applicate this concepts to various instances through which he could arrive at the understanding progressively. Through analysis, it turns out that Korea's seventh elementary mathematics textbook is based on concretization method. In this thesis, first of all, I will reconstruct probability unit of seventh elementary textbook according to Freudenthal's reinvention method. Next, I will perform teaching experiment which is ruled by new lesson design. Lastly, I analysed the effects of teaching experiment. Through this study, I obtained the following results and suggestions. First, the reinvention method is effective on the teaching of probability concept and algorithm. Second, in comparison with current textbook strand, my strand which made probability concept go ahead and combinatorics concept let behind is not deficiency. Third, tree diagram is effective matrix which contribute to formalization of combinatorics calculation. Lastly, except for fraction, diverse representation of probability, for example percentage or informal ratio expression must be introduced in teaching process.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.898-900
• /
• 2005

모듈러 멱승은 양수 x, E, N에 대하여 $x^Emod$ N로 정의된다. 모듈러 멱승 연산은 대부분의 공개키 암호화 알고리즘과 전자서명 프로토콜에서 핵심적인 연산으로 사용되고 있으므로, 그 효율성은 암호 프로토콜의 성능에 직접적인 영향을 미친다. 따라서 모듈러 멱승 연산에 필요한 곱셈 수를 감소시키기 위하여, 슬라이딩 윈도우를 적용한 CLNW 방법이나 VLNW 방법이 가장 널리 사용되고 있다. 본 논문에서는 조합론(combinatorics)에서 많이 응용되는 그래프 모델을 모듈러 멱승 연산에 적용할 수 있음을 보이고, 일반화된 그래프 모델을 통하여 VLNW 방법보다 더 적은 곱셈 수로 모듈러 멱승을 수행하는 방법을 설명한다. 본 논문이 제안하는 방법은 전체 곱셈 수를 감소시키는 새로운 블록들을 일반화된 그래프 모델의 초기 블록 테이블에 추가할 수 있는 초기 블록 테이블의 두 가지 확장 방법들로써, 접두사 블록의 확장과 덧셈 사슬 블록의 확장이다. 이 방법들은 새로운 블록을 초기 블록 테이블에 추가하기 위해 필요한 곱셈의 수와 추가한 뒤의 전체 곱셈 수를 비교하면서 초기 블록 테이블을 제한적으로 확장하므로, 지수 E에 non-zero bit가 많이 나타날수록 VLNW 방법에 비해 좋은 성능을 보이며 이는 실험을 통하여 검증하였다.

• Journal for History of Mathematics
• /
• v.19 no.2
• /
• pp.125-140
• /
• 2006

In 1933, I. Schur introduced a Schur ring in connection with permutation group and regular subgroup. After then, it was studied mostly for purely group theoretical purposes. In 1970s, Klin and Poschel initiated its usage in the investigation of graphs, especially for Cayley and circulant graphs. Nowadays it is known that Schur ring is one of the best way to enumerate Cayley graphs. In this paper we study the origin of Schur ring back to 1933 and keep trace its evolution to graph theory and combinatorics.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• Journal of the Korean School Mathematics Society
• /
• v.24 no.4
• /
• pp.349-367
• /
• 2021

In this study, 85 studies on probability education from 2000 to 2020 were analyzed by publishing year, journals, research subjects, and research topics. Especially, fundamental probabilistic ideas presented by Batanero et al.(2016) were applied to examine which topics were dominant in domestic probability education research. As a result, it was found that there has been a few research in probability education in Korea during the past 20 years, and the number of human subject studies was slightly more than the number of non-human subject studies. In addition, the analysis of research topics according to the fundamental probabilistic ideas showed that two topics, conditional probability and independence and combinatorial enumeration and counting, were dominant in domestic probability education research. However, while both conditional probability and independence and combinatorial enumeration and counting are introduced to young children using intuitive manners in international probability education research, subjects related to these topics were primarily high school students and pre and in-service teachers. Based on the results of this study, the implications for the goal and the direction of future probability education research were discussed.