• Journal of the Korean Statistical Society
• /
• v.10
• /
• pp.97-104
• /
• 1981

It is shown that a lattice distribution defined on a set of n lattice points $L(n,\delta) = {\delta,\delta+1,...,\delta+n-1}$ is a distribution induced from the distribution of convolution of independently and identically distributed (i.i.d.) uniform [0,1] random variables. Also the m-th moment of the lattice distribution is obtained in a quite different approach from Park and Chung (1978). It is verified that the distribution of the sum of n i.i.d. uniform [0,1] random variables is completely determined by the lattice distribution on $L(n,\delta)$ and the uniform distribution on [0,1]. The factorial mement generating function, factorial moments, and moments are also obtained.

• Journal of the Korean Mathematical Society
• /
• v.15 no.1
• /
• pp.59-61
• /
• 1978

Let $X_1$, $X_2$, ${\cdots}$, $X_n$ be i.i.d. uniform (0,1) random variables. Let $f_n(x)$ denote the probability density function (p.d.f.) of $T_n={\sum}^n_{i=1}X_i$. Consider a set S(x ; ${\delta}$) of lattice points defined by S(x ; ${\delta}$) = $x{\mid}x={\delta}+j$, j=0, 1, ${\cdots}$, n-1, $0{\leq}{\delta}{\leq}1$} The lattice distribution induced by the p.d.f. of $T_n$ is defined as follow: (1) $f_n^{(\delta)}(x)=\{f_n(x)\;if\;x{\in}S(x;{\delta})\\0\;otherwise.$. In this paper we show that $f_n{^{(\delta)}}(x)$ is a probability function thus we obtain a family of lattice distributions {$f_n{^{(\delta)}}(x)$ : $0{\leq}{\delta}{\leq}1$}, that the mean and variance of the lattice distributions are independent of ${\delta}$.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.11-21
• /
• 2004

We discuss the n-fold implicative/fantastic filters in lattice implication algebras, which are extended notions of implicative/fantastic filters. Characterizations of n-fold implicative/fantastic filters are given. Conditions for a filter to be n-fold implicative are provided. Extension property for an n-fold fantastic filter is established.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.449-467
• /
• 2018

In this paper we introduce and study the lattice paths for which the horizontal step is allowed at height $h{\geq}0$, $h{\in}{\mathbb{Z}}$. By doing so these paths generalize the heavily studied weighted lattice paths that consist of horizontal steps allowed at height zero only. Six q-series identities of Rogers-Ramanujan type are studied combinatorially using these generalized lattice paths. The results are further extended by using (n + t)-color overpartitions. Finally, we will establish that there are certain equinumerous families of (n + t)-color overpartitions and the generalized lattice paths.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.47-57
• /
• 2004

The Goldreich-Goldwasser-Halevi(GGH)'s signature scheme from Crypto '97 is cryptanalyzed, which is based on the well-blown lattice problem. We mount a chosen message attack on the signature scheme, and show the signature scheme is vulnerable to the attack. We collects n lattice points that are linearly independent each other, and constructs a new basis that generates a sub-lattice of the original lattice. The sub-lattice is shown to be sufficient to generate a valid signature. Empirical results are presented to show the effectiveness of the attack Finally, we show that the cube-like parameter used for the private-key generation is harmful to the security of the scheme.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.153-163
• /
• 2003

The fuzzification of a positive implicative filter is considered, and some of properties are investigated. The relation among fussy filter, fuzzy n-fold implicative filter, and fuzzy n-fold positive implication filter is discussed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.

• Journal of the Korean Ceramic Society
• /
• v.28 no.4
• /
• pp.269-278
• /
• 1991

Fine AlN powder was synthesized by carbothermal reduction and nitridation of alumimun hydroxide prepared from Al-isopropoxide. AlN ceramics with Y2O3 and CaO were prepared by hot-pressing under the pressure of 30 MPa at 180$0^{\circ}C$ for 1 h in N2 atmosphere. Grain boundary behavior and purification mechanism of AlN lattice were examined by heat treatment of AlN ceramics at 185$0^{\circ}C$ for 1-6 h in N2 atmosphere. AlN ceramics without sintering additives showed poor sinterability. However, Y2O3-doped and CaO-doped AlN ceramics were fully densified nearly to theoretical density. As the heat treatment time increased, c-axis lattice parameter increased. This is attributed to the removal of Al2O3 in AlN lattice. This purification effect of AlN attice depended upon the quantity of secondary oxide phase in the inintial stage of heat treatment and the heat treatment time.

• Journal of the Korean Physical Society
• /
• v.73 no.12
• /
• pp.1808-1813
• /
• 2018

I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

• Journal for History of Mathematics
• /
• v.23 no.2
• /
• pp.101-121
• /
• 2010

This article includes an introduction, a history of Pick's theorem on lattice polyhedron and its proof, Reeve's theorem on 3-dimensional lattice polyhedrons extended from the Pick's theorem and Ehrhart polynomial generalized as an n-dimensional lattice polyhedron, and then shows the relationship between the volume of 3-dimensional polyhedron and the number of its lattice points by means of Reeve's theorem. It is aimed to apply the relationship to the visualization of sums in sequences.