• 전기의세계
• /
• v.23 no.4
• /
• pp.53-59
• /
• 1974

This paper investigates the theoretical properties of a logic element called the multithreshold threshold element, which is a generalization of the single-threshold threshold element. The primary partition os a systematic method of obtaining the multi-threshold realization of a switching function by the index numbers. The concept of comparable vertices of the same index numbers introduced in this paper is very promising for testing the multi-threshold partition by the initial condition to be defined by the minterms of the same index numbers.

• Korean Journal of Mathematics
• /
• v.23 no.4
• /
• pp.637-642
• /
• 2015

We study congruence properties of the number of cubic partition pairs weighted by the parity of the crank. If we define such number to be c(n), then $c(5n+4){\equiv}0$ (mod 5) and $c(7n+2){\equiv}0$ (mod 7), for all nonnegative integers n.

• Korean Journal of Mathematics
• /
• v.21 no.3
• /
• pp.237-246
• /
• 2013

In this paper we first consider the partition of the general region made by the monotonically increasing and continuous function and then obtain the measure from the partition of the region. The results obtained here is a little bit different from the previous results in [1, 2, 3] and finally we discuss the difference.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.131-143
• /
• 2003

In this paper, we present a survey about the various graph partition problems including the clustering problem, the k-cut problem, the multiterminal cut problem, the multicut problem, the sparsest cut problem, the network attack problem, the network disconnection problem. We compare those problems focusing on the problem characteristics such as the objective function and the conditions that the partitioned clusters should satisfy. We also introduce the mathematical programming formulations, and the solution approaches developed for the problems.

• Nuclear Engineering and Technology
• /
• v.5 no.2
• /
• pp.77-82
• /
• 1973

A method of obtaining the partition function for a system of electrons is developed by defining a new density matrix, in which the Fermi statistics is explicitly incorporated. The corresponding Bloch equation is formulated and a practical method of solving the equation is obtained for weak potential. This theory is applied to structurally disordered ststems which might be reasonable models for liquid metals.

• Honam Mathematical Journal
• /
• v.39 no.2
• /
• pp.267-273
• /
• 2017

The objective of this note is to establish three results between q-products and combinatorial partition identities in a elementary way. Several closely related q-product identities such as (for example)continued fraction identities and Jacobis triple product identities are also considered.

• Honam Mathematical Journal
• /
• v.38 no.4
• /
• pp.809-818
• /
• 2016

Chaudhary and Choi [7] presented 14 identities which reveal certain interesting interrelations among character formulas, combinatorial partition identities and continued partition identities. In this sequel, we aim to give slightly modified versions for 8 identities which are chosen among the above-mentioned 14 formulas.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.548-550
• /
• 1999

최근 시스템 환경의 급격한 변화에 따라 기존 시스템의 유지보수와 재사용에 관련된 여러 가지 문제점이 발견되었다. 객체지향개념은 우리에게 재사용과 유지보수를 용이하게 해 줄 것으로 생각되었지만 기대만큼의 효과는 거두지 못하고 있다. 이러한 현실적인 문제를 해결하기 위해 많은 클래스들을 관련성을 이용해 패키지로 분류하는 클러스터링 기법들이 연구되었다. 대부분이 소프트웨어의 품질을 평가하기 위한 매트릭스를 기반으로 한 것이었지만, 실제 현장에서 개발자들의 경험에 의한 클러스터링 기법과는 많은 차이가 발생한다. 본 논문에서는 메트릭스를 이용한 Composition 방법과 개발자들의 경험을 이용한 Partition 방법을 혼합하여 정량화된 수치를 제공하며 개발자들의 경험을 충족시키는 방법을 제시하고자 한다.

• East Asian mathematical journal
• /
• v.35 no.1
• /
• pp.9-15
• /
• 2019

Kaavya introduce an involution on the set of partitions with crank 0 and studied the number of partitions of n which are invariant under Kaavya's involution. If a partition ${\lambda}$ with crank 0 is invariant under her involution, we say ${\lambda}$ is a self-conjugate partition with crank 0. We prove that the number of such partitions of n is equal to the number of partitions with rank 0 which are invariant under the usual partition conjugation. We also study arithmetic properties of such partitions and their q-theoretic implication.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.15-25
• /
• 2022

In 1963, Graham introduced a problem to find integer partitions such that the reciprocal sum of their parts is 1. Inspired by Graham's work and classical partition identities, we show that there is an integer partition of a sufficiently large integer n such that the reciprocal sum of the parts is 1, while the parts satisfy certain congruence conditions.