• Journal for History of Mathematics
• /
• v.17 no.3
• /
• pp.13-22
• /
• 2004

In this paper, we consider two conjectures, the Bieberbach Conjecture that was proved true and the Lu Qi-Keng Conjecture that was proved not true. We inspect them historically and introduce the interesting results. From them we find that the deep theory of mathematics comes from continuous conjectures.

• Kyungpook Mathematical Journal
• /
• v.32 no.3_spc
• /
• pp.435-443
• /
• 1992

• Communications of the Korean Mathematical Society
• /
• v.13 no.2
• /
• pp.217-224
• /
• 1998

In this paper we study the minimal resolution conjecture which is a generalization of the ideal generation conjecture. And we show how the results about this conjecture can make the calculation of minimal resolution in certain cases.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1079-1098
• /
• 2019

In this paper we give some branching rules for the fundamental representations of Kac-Moody Lie algebras associated to T-shaped graphs. These formulas are useful to describe generators of the generic rings for free resolutions of length three described in [7]. We also make some conjectures about the generic rings.

• Journal of Educational Research in Mathematics
• /
• v.13 no.3
• /
• pp.365-382
• /
• 2003

This study intends to develope and apply mathematical activities for gifted students. According to the Polya's research and Krutetskii's study, mathematical activities were developed and observed. The activities were aimed at discovery of Euler's theorem through exploration of soccer ball at first. After the repeated application and reflection, the aim and the main activities were changed to the exploration of soccer ball itself and about related mathematical facts. All the students actively participated in the activities, proposed questions need to be proved, disproved by counter examples during the fourth program. Also observation, conjectures, inductive arguments played a prominent role.

• Korean Journal of Mathematics
• /
• v.13 no.1
• /
• pp.113-122
• /
• 2005

We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.277-284
• /
• 2004

An m-transversal to a family of convex sets in the plane is an m-point set which intersects every members of the family. One of Grubaum's conjectures says that a planar family of translates of a convex compact set has a 3-transversal provided that any two of its members intersect. Recently the conjecture has been proved affirmatively (see [4]). In the present paper we provide a different and straightforward proof for the conjecture for the family of translates of a closed trapezoid in the plane and give several concrete 3-transversals.

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1841-1851
• /
• 2017

Motivated by the Bloch-Beilinson conjectures, Voisin has made a conjecture concerning zero-cycles on self-products of Calabi-Yau varieties. We reformulate Voisin's conjecture in the setting of $hyperk{\ddot{a}}hler$ varieties, and we prove this reformulated conjecture for one family of $hyperk{\ddot{a}}hler$ fourfolds.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.383-387
• /
• 2002

Let p be an odd prime, and let f($\varkappa$) be the interpolating polynomial associated with a table of data points (j+1, (equation omitted) ) for 0$\leq$j$\leq$p. In this article, we find congruence identities modulo p of (p-1)!f($\varkappa$), (p-2)!f($\varkappa$), and (p-3)!f($\varkappa$). Moreover we present some conjectures of these types.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.127-131
• /
• 2020

We discuss two unrelated topics regarding Cops and Robbers, a well-known pursuit-evasion game played on a simple graph. First, we address a recent question of Breen et al. and prove the PSPACE-completeness of the cop throttling number, that is, the minimal possible sum of the number k of cops and the number capt(k) of moves that the robber can survive against k cops under the optimal play of both sides. Secondly, we revisit a teleporting version of the game due to Wagner; we disprove one of his conjectures and suggest a new related research problem.