• The Pure and Applied Mathematics
• /
• v.26 no.3
• /
• pp.209-214
• /
• 2019

We investigate all kinds of the Hilbert function of the Artinian quotient of the coordinate ring of a linear star configuration in ${\mathbb{P}}^n$ of type (n+1) (or (n+1)-general points in ${\mathbb{P}}^n$), which generalizes the result [7, Theorem 3.1].

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.4
• /
• pp.375-386
• /
• 2007

Let p be a prime and $f(z)=\Sigma_{n}a(n)q^n$ be a weakly holomorphic modular function for ${\Gamma}^*_0(p)$ with a(0) = 0. We use Bruinier and Funke's work to find the generating series of modular traces of f(z) as Jacobi forms.

• Kyungpook Mathematical Journal
• /
• v.52 no.2
• /
• pp.137-147
• /
• 2012

In this paper we introduce some new double sequence spaces via ideal convergence and an Orlicz function in $n$-normed spaces and examine some properties of the resulting spaces.

• East Asian mathematical journal
• /
• v.16 no.2
• /
• pp.233-237
• /
• 2000

Since the time of Euler, there have been many proofs giving the value of $\zeta(2n)$. We also give an evaluation of $\zeta(2n)$ by analyzing the generating function of Bernoulli numbers.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.239-252
• /
• 2002

A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2021-2026
• /
• 2013

Let G = (V,E) be a graph. A function $f:V{\rightarrow}\{-1,+1\}$ defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, ${\gamma}^s_t(G)$, is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen graphs P(n, 2) and prove that for any integer $n{\geq}6$, ${\gamma}^s_t(P(n,2))=2[\frac{n}{3}]+2t$, where $t{\equiv}n(mod\;3)$ and $0 {\leq}t{\leq}2$.

• The Pure and Applied Mathematics
• /
• v.30 no.1
• /
• pp.43-65
• /
• 2023

In this paper, by using the difference analogue of Nevanlinna's theory, the authors study the shared-value problem concerning two higher order difference operators of a transcendental entire function with finite order. The following conclusion is proved: Let f(z) be a finite order transcendental entire function such that λ(f - a(z)) < ρ(f), where a(z)(∈ S(f)) is an entire function and satisfies ρ(a(z)) < 1, and let 𝜂(∈ ℂ) be a constant such that ∆_𝜂ⁿ⁺¹ f(z) ≢ 0. If ∆_𝜂ⁿ⁺¹ f(z) and ∆_𝜂ⁿ f(z) share ∆_𝜂ⁿ a(z) CM, where ∆_𝜂ⁿ a(z) ∈ S ∆_𝜂ⁿ⁺¹ f(z), then f(z) has a specific expression f(z) = a(z) + Be^Az, where A and B are two non-zero constants and a(z) reduces to a constant.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.1-9
• /
• 2010

Feistel and SPN are the two main structures in a block cipher. Feistel is a symmetric structure which has the same structure in encryption and decryption, but SPN is not a symmetric structure. In this paper, we propose a SPN which has a symmetric structure in encryption and decryption. The whole operations of proposed algorithm are composed of the even numbers of N rounds where the first half of them, 1 to N/2 round, applies a right function and the last half of them, (N+1)/2 to N round, employs an inverse function. And a symmetry layer is located in between the right function layer and the inverse function layer. In this paper, AES encryption and decryption function are selected for the right function and the inverse function, respectively. The symmetric layer is composed with simple matrix and round key addition. Due to the simplicity of the symmetric SPN structure in hardware implementation, the proposed modified AES is believed to construct a safe and efficient cipher in Smart Card and RFID environments where electronic chips are built in.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8C
• /
• pp.754-761
• /
• 2005

We derive and analyze a bit error rate(BER) expression of a Gray coded rectangular QAM(R-QAM) signal with maximal ratio combining diversity(MRC) reception over Nakagami-n(Rician) fading channels. The derived result is provided in terms of the Whittaker function and the confluent hypergeometric function. In addition, by performance comparison with M-PSK, we see the Nakagami-n fading channel characteristics. Because the derived expression is general, it can readily allow numerical e·valuation for various cases of practical interest such as line-of-sight (LOS) or satellite communication channel analysis.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.851-864
• /
• 2015

In this paper, we study the generalized Littlewood-Paley operators. It is shown that the generalized g-function, Lusin area function and $g^*_{\lambda}$-function on any BMO function are either infinite everywhere, or finite almost everywhere, respectively; and in the latter case, such operators are bounded from BMO($\mathbb{R}^n$) to BLO($\mathbb{R}^n$), which improve and generalize some previous results.