arXiv subjects
Publications and source records attributed to BongJu Kim.
We introduce a scheme for the membership verification, a scheme for a secret ballot, a scheme for the unanimity rule which can hide the number of voter using some partition number identities.
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional analysis, linear algebra and probability theory. The knowledge of the mathematical formulation of QM is enough quantum mechanical knowledge for approaching to quantum algorithm and it might be efficient way for mathematicians that starting with mathematical formulations of QM. We explain the mathematical formulations of quantum mechanics briefly, quantum bits, quantum gates, quantum discrete Fourier transformation, Deutsch's algorithm and Shor's algorithm.
Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a restriction $α$ of the number of equal parts. Although there are many way of the expression, we prove that there exists a expression form such that this expression form is true for all possible set $B$. This identities comes from the partition numbers of natural numbers into $\{1,α,α^2,α^3,\cdots\}$. Furthermore, we prove that there exist inverse forms of the expression forms. And we prove other similar identities. The proofs in this paper are constructive.