• Title/Summary/Keyword: Proofs

Search Result 343, Processing Time 0.021 seconds

A Central Limit Theorem for Linearly Positive Quadrant Dependent Random Fields

  • Hyun-Chull Kim
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.350-357
    • /
    • 1995
  • In this note, we obtain the central limit theorem for linearly positive quadrant dependent random fields satisfying some assumptions on the covariances and the moment condition $supE\mid X_i\mid^3\;<{\infty}$ The proofs are similar to those of a central limit theorem for associated random field of Cox and Grimmett.

  • PDF

A PROOF OF THE LEGENDRE DUPLICATION FORMULA FOR THE GAMMA FUNCTION

  • Park, In-Hyok;Seo, Tae-Young
    • East Asian mathematical journal
    • /
    • v.14 no.2
    • /
    • pp.321-327
    • /
    • 1998
  • There have been various proofs of the Legendre duplication formula for the Gamma function. Another proof of the formula is given here and a brief history of the Gamma function is also provided.

  • PDF

EVALUATIONS OF $\zeta(2n)$

  • Choi, June-Sang
    • 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.

  • PDF

A VERTEX PROPERTY OF REAL FUNCTION ALGEBRAS

  • Hwang, Sun-Wook
    • The Pure and Applied Mathematics
    • /
    • v.5 no.1
    • /
    • pp.65-72
    • /
    • 1998
  • We investigate a chain of properties of real function algebras along the analogous proofs of the complex cases such as the fact that any real function algebra which is both maximal and essential is pervasive. And some properties of real function algebras with a vertex property will be discussed.

  • PDF

A Fast and Secure Method to Preserve Anonymity in Electronic Voting (전자투표에서 익명성 보장을 위한 빠르고 안전한 방식)

  • Yang, Hyung-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.245-251
    • /
    • 2014
  • Mix network plays a key role in electronic voting to preserve anonymity and lots of mixnet schemes have been proposed so far. However, they requires complex and costly zero-knowledge proofs to provide their correct mixing operations. In 2010, Seb$\acute{e}$ et al. proposed an efficient and lightweight mixnet scheme based on a cryptographic secure hash function instead of zero-knowledge proofs. In this paper, we present a more efficient and faster mixnet scheme than Seb$\acute{e}$ et al.'s scheme under the same assumption. Also, our scheme is secure.