• Korean Journal of Mathematics
• /
• v.19 no.4
• /
• pp.367-379
• /
• 2011

In this paper, we find the maximum exponent of primitive simple graphs G under the restriction $deg(v){\geq}3$ for all vertex $v$ of G. Our result is also an answer of a Klee and Quaife type problem on exponent to find minimum number of vertices of graphs which have fixed even exponent and the degree of whose vertices are always at least 3.

• Honam Mathematical Journal
• /
• v.46 no.1
• /
• pp.136-145
• /
• 2024

In this paper we obtained several properties that the characteristic polynomial of the unit-primitive matrix satisfies. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In fact, Xin and Zhong ([4]) showed it earlier. However, we provide a simpler method here.

• Journal of Acupuncture Research
• /
• v.23 no.4
• /
• pp.91-100
• /
• 2006

Objectives : The Comparative Study Of The Eight Extra Meridians And The Primitive Meridians Will Improve The Understanding Of The Relationship Between Meridians And The Eight Extra Meridians, Which Ultimately Will illuminate The Origins Of Meridians. Methods Books From The Pre-Han And Han Dynasty, As Well As Publications Concerning Meridians And The Eight Extra Meridians Were Utilized. Results : Pathways Of The Eight Extra Meridians And The Primitive Meridians Travel Independently Without Connection With Other Meridians, And Have No Obvious Link With The Five Vital Organs And The Six Viscera. Additionally, The Terminology Of Both Meridians Is Similar, And Travel From Bottom To Top. Conclusion : The Eight Extra Meridians Have Several Similarities With The Primitive Meridians. Therefore, The Eight Extra Meridians May Be An Important Area To Investigate In The Future.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.63-70
• /
• 1997

This paper proposes a new algorithm for recognizing polyhedral objects using a single 2-D image. It is base don a new representation scheme having two level hierarchey. In the lower level, geometrical features of each primitive surface are represented using their signatures and the variation of signature due to rotation is represented suing the rotation map. In the higher level, topological features are represented in the inter-surface description table(SDT). Based on the proposed representaton scheme, loer level database searched to find a matching primitive surface. The srotation map determines the degree of rotation as well as the matchness. If all surfaces in a test object find their matching primitive surfaces, its structural information is compared with the SDTs of object models. If primitive surfaces of a test object equal to tha tof certain model and satisfy inter-surfaces relationship in SDT, a test object is recognized as the model.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.627-641
• /
• 2008

A two-colored digraph D is primitive if there exist nonnegative integers hand k with h + k > 0 such that for each pair (i, j) of vertices there exists an (h, k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is the minimum value of h + k taken over all such hand k. In this paper, we give the tight upper bound on the exponents of a class of primitive two-colored digraphs with (s + 1) n-cycles and one (n - 1)-cycle, and the characterizations of the extremal two-colored digraphs.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.55-62
• /
• 2013

In [5], Johnson introduced the primitivity of subgroups and proved that a finite group G is supersolvable if every primitive subgroup of G has a prime power index in G. In that paper, he also posed an interesting problem: what a group looks like if all of its primitive subgroups are maximal. In this note, we give the detail structure of such groups in solvable case. Finally, we use the primitivity of some subgroups to characterize T-group and the solvable $PST_0$-groups.

• Asia-Pacific Journal of Business
• /
• v.9 no.2
• /
• pp.1-13
• /
• 2018

Physics simulation is an important part of many interactive 2D applications and collision detection and response is key component of this simulation. While methods for reducing the number of collision tests that need to be performed has been well researched, methods for performing the final checks with collision primitives have seen little recent development. This paper presents a new collision primitive, the n-arc, constructed from piecewise circular curves or biarcs. An algorithm for performing a collision check between these primitives is presented and compared to a convex polygon primitive. The n-arc is shown to exhibit similar, though slightly slower, performance to a polygon when no collision occurs, but is considerably faster when a collision does occur. The goodness of fit of the new primitive is also compared to a polygon. While the n-arc often gives a looser fit in terms of area, the continuous tangents of the n-arcs makes them a good choice for organic, soft or curved surfaces.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.1-10
• /
• 1998

The first thing in designing application-specific instruction set processor is having instruction set closely matching hardware characteristics. This instruction set design problem can be more complicated when cobined with implementation method selection problem of each instruction. Our processor model supports two kinds of instructions-primitive or special instructions. Primitive instructions are implemented using common multifunctional hardware such as ALU. Special instructions require a set of dedicated hardware, which actually functions as a coprocessor to the main processor. In this case, special instructions and primitive instructions can be executed independently. In this paper, we present novel algorithm for genrating special instructions for given application. Parallelism between special instructions and primitive instructions is also considered during the performance estimation stage of generated special instructions.

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.463-471
• /
• 2013

Let R be a ring with identity 1, $I(R){\neq}\{0\}$ be the set of all nonunit idempotents in R, and M(R) be the set of all primitive idempotents and 0 of R. We say that I(R) is additive if for all e, $f{\in}I(R)$ ($e{\neq}f$), $e+f{\in}I(R)$. In this paper, the following are shown: (1) I(R) is a finite additive set if and only if $M(R){\backslash}\{0\}$ is a complete set of primitive central idempotents, char(R) = 2 and every nonzero idempotent of R can be expressed as a sum of orthogonal primitive idempotents of R; (2) for a regular ring R such that I(R) is a finite additive set, if the multiplicative group of all units of R is abelian (resp. cyclic), then R is a commutative ring (resp. R is a finite direct product of finite field).

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.25-43
• /
• 2005

Let F be a finite field of prime power order q(odd) and the multiplicative order of q modulo $2^{n}\;(n>1)\;be\; {\phi}(2^{n})/2$. If n > 3, then q is odd number(prime or prime power) of the form $8m{\pm}3$. If q = 8m - 3, then the ring $R_{2^n} = F[x]/ < x^{2^n}-1 >$ has 2n primitive idempotents. The explicit expressions for these primitive idempotents are obtained and the minimal QR cyclic codes of length $2^{n}$ generated by these idempotents are completely described. If q = 8m + 3 then the expressions for the 2n - 1 primitive idempotents of $R_{2^n}$ are obtained. The generating polynomials and the upper bounds of the minimum distance of minimal QR cyclic codes generated by these 2n-1 idempotents are also obtained. The case n = 2,3 is dealt separately.