• Journal of Energy Engineering
• /
• v.17 no.4
• /
• pp.233-240
• /
• 2008

Conventionally, the second-order self-adjoint neutron transport equations have been studied using the even parity and the odd parity equations. Recently, however, the SAAF(self-adjoint angular flux) form of neutron transport equation has been introduced as a new option for the second-order self-adjoint equations. In this paper we validated the SAAF equation mathematically and clarified how it relates with the existing even and odd parity equations. We also developed a second-order SAAF differencing formula including DSA(diffusion synthetic acceleration) from the first-order difference equations. Numerical result is attached to show that the proposed methods increases accuracy with effective computational effort.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.1017-1024
• /
• 2023

A celebrated result in the study of integer partitions is the identity due to Lehmer whereby the number of partitions of n with an even number of even parts minus the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct odd parts. Inspired by Lehmer's identity, we prove explicit formulas for evaluating generating functions for sequences that enumerate integer partitions of fixed width with an even/odd number of even parts. We introduce a technique for decomposing the even entries of a partition in such a way so as to evaluate, using a finite sum over q-binomial coefficients, the generating function for the sequence of partitions with an even number of even parts of fixed, odd width, and similarly for the other families of fixed-width partitions that we introduce.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2002.10a
• /
• pp.51.1-51
• /
• 2002

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.08a
• /
• pp.56-56
• /
• 2010

Using first-principles density-functional theory calculations, we find dramatically different electronic states in the C chains generated on the H-terminated C(111) surface, depending on their length and parity. The infinitely long chain has $\pi$ electrons completely delocalized over the chain, yielding an equal C-C bond length. As the chain length becomes finite, such delocalized $\pi$ electrons are transformed into localized ones. As a result, even-numbered chains exhibit a strong charge-lattice coupling, leading to a bond-alternated structure, while odd-numbered chains show a ferrimagnetic spin ordering with a solitonlike structure. These geometric and electronic features of infinitely and finitely long chains are analogous to those of the closed (benzene) and open (polyacetylene) chains of hydrocarbons, respectively.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.213-221
• /
• 2012

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to ${\mid}V(G){\mid}$. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to $2^n$ when n($n{\geq}3$) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to $2^n-1$ when n($n{\geq}2$) and k have the different parity.

• Journal of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.493-511
• /
• 2009

Let $q\;{\geq}\;3$ be an odd integer and a be an integer coprime to q. Denote by N(a, q) the number of pairs of integers b, c with $bc\;{\equiv}\;a$ (mod q), $1\;{\leq}\;b$, $c\;{\leq}\;{\frac{q-1}{2}}$ and with b, c having different parity. The main purpose of this paper is to study the sum ${\sum}^{'q}_{a=1}\;\(N(a,\;q)\;-\;\frac{{\phi}(q)}{8}\)^2$ and obtain a sharp asymptotic formula.

• Communications of Mathematical Education
• /
• v.6
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.35-43
• /
• 2015

Let q > 1 be an odd integer and c be a fixed integer with (c, q) = 1. For each integer a with $1{\leq}a{\leq}q-1$, it is clear that the exists one and only one b with $0{\leq}b{\leq}q-1$ such that $ab{\equiv}c$ (mod q). Let N(c, q) denote the number of all solutions of the congruence equation $ab{\equiv}c$ (mod q) for $1{\leq}a$, $b{\leq}q-1$ in which a and $\bar{b}$ are of opposite parity, where $\bar{b}$ is defined by the congruence equation $b\bar{b}{\equiv}1$ (modq). The main purpose of this paper is using the mean value theorem of Dirichlet L-functions to study the mean value properties of a summation involving $(N(c,q)-\frac{1}{2}{\phi}(q))$ and Kloosterman sums, and give a sharper asymptotic formula for it.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.971-997
• /
• 2018

The parity of cyclotomic numbers of order 2, 4 and 6 associated with 4-cyclotomic cosets modulo an odd prime p are obtained. Hence the explicit expressions of primitive idempotents of minimal cyclic codes of length $p^n$, $n{\geq}1$ over the quaternary field $F_4$ are obtained. These codes are observed to be subcodes of Q codes of length $p^n$. Some orthogonal properties of these subcodes are discussed. The minimal cyclic codes of length 17 and 43 are also discussed and it is observed that the minimal cyclic codes of length 17 are two weight codes. Further, it is shown that a Q code of prime length is always cyclotomic like a binary duadic code and it seems that there are infinitely many prime lengths for which cyclotomic Q codes of order 6 exist.