• 충청수학회지
• /
• 제3권1호
• /
• pp.49-56
• /
• 1990

We do an attempt to solve the Zeeman's tolerance stability conjecture and Takens' conjecture using the concepts of chains.

• 대한수학회보
• /
• 제55권3호
• /
• pp.699-715
• /
• 2018

In this paper, we show a proof of Gordon's Conjecture by using Qiu's labels and two new labels.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제46권1호
• /
• pp.69-79
• /
• 2007

Students experience many problem solving activities in school mathematics. These activities have focused on finding the solution whose existence was known, and then again conjecture about existence of solution or posing of problems has been neglected. It needs to put more emphasis on conjecture and problem posing activities in school mathematics. To do this, a model and examples of designing mathematical activities centered on conjecture and problem posing are needed. In this article, we introduce some examples of designing such activities (from the pythagorean theorem, the determination condition of triangle, and existing solved-problems in textbook) and examine suggestions for mathematics education. Our examples can be used as instructional materials for mathematically able students at middle school.

• 대한수학회지
• /
• 제54권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.

• 충청수학회지
• /
• 제20권1호
• /
• pp.31-35
• /
• 2007

In dealing with transformation group, topological approach is very natural. But, it is not sufficient to investigate geometric properties of transformation group and we need geometric method. Frankel-McDuff Conjecture is very interesting in the point that it shows struggling between topological method and geometric method. In this paper, the author suggest generalized Frankel-McDuff conjecture as a topological version of the conjecture and construct a counterexample for the generalized version, and from this we assert that topological method does not work for Frankel-McDuff Conjecture.

• 대한수학회논문집
• /
• 제13권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.

• 대한수학회논문집
• /
• 제39권1호
• /
• pp.117-125
• /
• 2024

In this paper, our focus is on exploring value sharing problems related to a transcendental entire function f and its associated differential-difference polynomials. We aim to establish some results which are related to differential-difference counterpart of the Brück conjecture.

• 대한수학회보
• /
• 제48권5호
• /
• pp.951-957
• /
• 2011

In 1996, Br$\ddot{u}$ck studied the relation between f and f' if an entire function f shares one value a CM with its first derivative f' and posed the famous Br$\ddot{u}$ck conjecture. In this work, we generalize the value a in the Br$\ddot{u}$ck conjecture to a small function ${\alpha}$. Meanwhile, we prove that the Br$\ddot{u}$ck conjecture holds for a class of meromorphic functions.

• 호남수학학술지
• /
• 제11권1호
• /
• pp.15-19
• /
• 1989

A conjecture of E. T. H. Wang asserts that if every diagonal disjoint from m mutually disjoint zero diagonals of $A{\in}{\Omega}_n$ has a constant sum, then all entries off the m zero diagonals are equal to l/(n-m). E. T. H. Wang proved the conjecture for m=0, 1, n-2 and n-1. In the present paper, it is proved that the conjecture holds true for m=2.

• 대한수학회보
• /
• 제59권2호
• /
• pp.345-350
• /
• 2022

In this work, we confirm a weak version of a conjecture proposed by Hong Wang. The ideal of the work comes from the tree packing conjecture made by Gyárfás and Lehel. Bollobás confirms the tree packing conjecture for many small tree, who showed that one can pack T₁, T₂, …, $T_{n/\sqrt{2}}$ into Kn and that a better bound would follow from a famous conjecture of Erdős. In a similar direction, Hobbs, Bourgeois and Kasiraj made the following conjecture: Any sequence of trees T₁, T₂, …, T_n, with T_i having order i, can be packed into K_n-1,[n/2]. Further Hobbs, Bourgeois and Kasiraj [3] proved that any two trees can be packed into a complete bipartite graph K_n-1,[n/2]. Motivated by the result, Hong Wang propose the conjecture: For each k-partite tree T(𝕏) of order n, there is a restrained packing of two copies of T(𝕏) into a complete k-partite graph B_n+m(𝕐), where $m={\lfloor}{\frac{k}{2}}{\rfloor}$. Hong Wong [4] confirmed this conjecture for k = 2. In this paper, we prove a weak version of this conjecture.