Standard quantum key distribution protocols are provably secure against eavesdropping attacks, if quantum theory is correct. It is theoretically interesting to know if we need to assume the validity of quantum theory to prove the security of quantum key distribution, or whether its security can be based on other physical principles. The question would also be of practical interest if quantum me...

the aim of this paper is to extend results established by h. onoand t. kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. the main theorem states that a residuatedlattice a is directly indecomposable if and only if its boolean center b(a)is {0, 1}. we also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...

The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...

the vertex arboricity $rho(g)$ of a graph $g$ is the minimum number of subsets into which the vertex set $v(g)$ can be partitioned so that each subset induces an acyclic graph‎. ‎a graph $g$ is called list vertex $k$-arborable if for any set $l(v)$ of cardinality at least $k$ at each vertex $v$ of $g$‎, ‎one can choose a color for each $v$ from its list $l(v)$ so that the subgraph induced by ev...

in this paper we study the concept of ph-biatness ofa banach algebra a, where ph is a continuous homomorphism on a.we prove that if ph is a continuous epimorphism on a and a hasa bounded approximate identity and a is ph- biat, then a is ph-amenable. in the case where ph is an isomorphism on a we showthat the ph- amenability of a implies its ph-biatness.

Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other errors are quite common. To detect the “early” errors in a document, one must attempt to prove certain simple theorems. This paper gives some examples of such theorems.