• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.551-555
• /
• 2011

In this note, we will give a short proof of an identity for cubic partition function.

• 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.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.565-566
• /
• 2017

An error in the proof of Theorem 1 of "On partition congruences for overcubic partition pairs" [Commun. Korean Math. Soc. 27 (2012), no. 3, 477-482] is corrected.

• Communications of the Korean Mathematical Society
• /
• v.27 no.3
• /
• pp.477-482
• /
• 2012

In this note, we investigate partition congruences for a certain type of partition function, which is named as the overcubic partition pairs in light of the literature. Let $\bar{cp}(n)$ be the number of overcubic partition pairs. Then we will prove the following congruences: $$\bar{cp}(8n+7){\equiv}0(mod\;64)\;and\;\bar{cp}(9m+3){\equiv}0(mod\;3)$$.

• Journal of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.685-697
• /
• 2022

Recently, Gireesh, Shivashankar, and Naika [11] found some infinite classes of congruences for the 3- and the 9-regular cubic partitions modulo powers of 3. We extend their study to all the 3^k-regular cubic partitions. We also find new families of congruences.

• Journal of the Chungcheong Mathematical Society
• /
• v.9 no.1
• /
• pp.153-164
• /
• 1996

An $O(h^4)$ cubic spline collocation method for biharmonic equation with a special boundary conditions is formulated and a fast direct method is proposed for the linear system arising when the cubic spline collocation method is employed. This method requires $O(N^2\;{\log}\;N)$ arithmatic operations over an $N{\times}N$ uniform partition.

• Journal of computational fluids engineering
• /
• v.3 no.2
• /
• pp.1-8
• /
• 1998

We make use of cubic B-spline interpolation function in two cases: heat conduction and fluid flow problems. Cubic B-spline test function is employed because it is superior to approximation of linear and non-linear problems. We investigated the accuracy of the numerical formulation and focused on the position of the breakpoints within the computational domain. When the domain is divided by partitions of equal space, the results show poor accuracy. For the case of a heat conduction problem this partition can not reflect the temperature gradient which is rapidly changed near the wall. To correct the problem, we have more grid points near the wall or the region which has a rapid change of variables. When we applied the unequally spaced breakpoints, the results show high accuracy. Based on the comparison of the linear problem, we extended to the highly non-linear fluid flow problems.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.525-538
• /
• 1996

In the course of working on the preconditioning of $C^1$-bicubic collocation method, one has to deal with the $C^1$-bicubic splines. In this paper we are concerned with $C^1$-bicubic spline interpolant for a given function. We construct a basis for the space of $C^1$-bicubic splines for a given partition and find the $C^1$-bicubic spline interpolant for a given function defined on a set.

• Communications of the Korean Mathematical Society
• /
• v.27 no.4
• /
• pp.843-849
• /
• 2012

Let G = (V, E) be a graph with chromatic number ${\chi}(G)$. dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every ${\chi}$-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by ${\gamma}_{ct}$(G). In this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the chromatic transversal domination number is equal to the connected domination number.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.8 s.185
• /
• pp.89-99
• /
• 2006

In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.