• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1243-1253
• /
• 2008

In this paper, we construct one-factorizations of given complete graphs of even order. These constructions partition the edges of the complete graph into one-factors and triples. Our new constructions of one-factors and triples can be applied to a recursive construction of Steiner triple systems for all possible orders ${\geq}$15.

• The Mathematical Education
• /
• v.45 no.1 s.112
• /
• pp.123-138
• /
• 2006

In this paper, we confirm through surveys and interviews that it helps students in solving a problem counting the number of combinations to find a structural isomorphism between the given problem and a typical problem with the same mathematical structure. Then we suggest that a problem of distributing balls into boxes might be a good candidate for a typical problem. This approach is coherent to the viewpoint given by English(2004) that it is educationally important to see the connection and relationship between problems with different context but with similar mathematical structure.

• Journal of Elementary Mathematics Education in Korea
• /
• v.21 no.2
• /
• pp.365-389
• /
• 2017

This study aims to analyze elementary gifted students' inquiries on combinatoric tasks. In particular, we designed circular permutation tasks and analyzed students' inquiries on these tasks. We especially analyzed students' expressions, counting processes, and their construction of set of outcomes. The findings showed that the students utilized analogy to resolve given tasks, and they had difficulties in categorizing and re-categorizing possible outcomes of given tasks. Their improper use of analogy also caused difficulties in resolving circular permutation tasks.

• Journal for History of Mathematics
• /
• v.19 no.1
• /
• pp.33-42
• /
• 2006

In this paper, we study the theoretical and historical backgrounds with respect to isomorphism problem of combinatorial objects which is one of major problems in the theory of Combinatorics. And also, we introduce a partial result for isomorphism problem of Cayley objects over a finite field.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.21-26
• /
• 2007

In industry, multihead automatic combination weighers are used to provide accurate weights at high speed. To minimize giveaway, greater accuracy is desired, especially for valuable products. This paper describes a combination algorithm based on bit operation. The combination method is simple and saves time, since only the elements to be considered for combination are generated. The total number of combinations from which the desired output weight is chosen can be increased by extending the combination from memory hoppers to include some weighing hoppers. For an eight-channel weigher, three or four combination elements are best. In addition to targeting approximately equal amounts of products in each channel, this study investigated other schemes. Simulation results show that schemes targeting combination elements with an unequal distribution of the output weight are more accurate. The most accurate scheme involves supplying products to all memory and weighing hoppers before commencing the combination operation. However, this scheme takes more time.

• IE interfaces
• /
• v.13 no.3
• /
• pp.479-485
• /
• 2000

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Recently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research shows that GA has efficiency for finding good solution. Our main motive of this research is developing of a package for LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We built a database constructed by zipcode, latitude, longitude, administrative address and posted land price. This database enables any real field problem to be coded into a mathematical location problem. We developed a package for a class of multi-location problem at PC. The package allows for an interactive interface between user and computer so that user can generate various solutions easily.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.181-193
• /
• 1997

The enumeration of various classes of paths in the real plane has an important implications in the area of combinatorics wit statistical applications. In 1887, D. Andre [3, pp. 21] first solved the famous ballot problem, formulated by Berttand [2], by using the well-known reflection principle which contributed tremendously to resolve the problems of enumeration of various classes of lattice paths in the plane. First, it is necessary to state the definition of NSEW-paths in the palne which will be employed throughout the paper. From [3, 10, 11], we can find results concerning many of the basics discussed in section 1 and 2.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.117-129
• /
• 1999

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Currently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research show that GA has efficiency for finding good solution. Our main motive of this research is developing of a GA in LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We propose fourth alternative genetic algorithm. Computational experiments are carried out to find a best algorithm.

• Bulletin of the Korean Chemical Society
• /
• v.18 no.9
• /
• pp.965-972
• /
• 1997

An approximate molecular theory of classical fluids based on the nonrandom lattice statistical-mechanical theory is presented. To obtain configurational Helmholtz free energy and equation of state (EOS), the lattice-hole theory of the Guggenheim combinatorics is approximated by introducing the nonrandom two-fluid theory. The approximate nature in the derivation makes the model possible to unify the classical lattice-hole theory and to describe correctly the configurational properties of real fluids including macromolecules. The theory requires only two molecular parameters for a pure fluid. Results obtained to date have demonstrated that the model correlates quantitatively the first- and second-order thermodynamic properties of real fluids. The basic simplicity of the model can readily be generalized to multicomponent systems. The model is especially relevant to (multi) phase equilibria of systems containing molecularly complex species.