Quantum Dialogue with Authentication Based on Bell States

We propose an authenticated quantum dialogue protocol, which is based on a shared private quantum entangled channel. In this protocol, the EPR pairs are randomly prepared in one of the four Bell states for communication. By performing four Pauli operations on the shared EPR pairs to encode their shared authentication key and secret message, two legitimate users can implement mutual identity authentication and quantum dialogue without the help from the third party authenticator. Furthermore, due to the EPR pairs which are used for secure communication are utilized to implement authentication and the whole authentication process is included in the direct secure communication process, it does not require additional particles to realize authentication in this protocol. The updated authentication key provides the counterparts with a new authentication key for the next authentication and direct communication. Compared with other secure communication with authentication protocols, this one is more secure and efficient owing to the combination of authentication and direct communication. Security analysis shows that it is secure against the eavesdropping attack, the impersonation attack and the man-in-the-middle (MITM) attack.     

Zero modes for the boundary giant magnons

We study the fermion zero-mode dynamics for open strings ending on the giant graviton branes. For the open string ending on the Z=0$Z=0$ brane, the quantization of the fermion zero-modes of boundary giant magnons reproduces the 256 states of the boundary degrees with the precise realization of the SU(2|2)×SU(2|2)$\mathit{SU}(2|2)\times \mathit{SU}(2|2)$ symmetry algebra. Also for the open string ending on the Y=0$Y=0$ brane, we reproduce the unique vacuum state from the fermion zero-modes.     

New optimal constructions of conflict-avoiding codes of odd length and weight 3

Conflict-avoiding codes (CACs) have played an important role in multiple-access collision channel without feedback. The size of a CAC is the number of codewords which equals the number of potential users that can be supported in the system. A CAC with maximal code size is said to be optimal. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the maximal sizes of both equidifference and non equidifference CACs of odd prime length and weight 3 are obtained. Meanwhile, the optimal constructions of both equidifference and non equidifference CACs are presented. The numbers of equidifference and non equidifference codewords in an optimal code are also obtained. Furthermore, a new modified recursive construction of CACs for any odd length is shown. Non equidifference codes can be constructed in this method.     

On a Continued Fraction Formula of Wall

We study the combinatorics of a continued fraction formula due to Wall. We also derive the orthogonality of little q-Jacobi polynomials from this formula, as Wall did for little q-Laguerre polynomials.     

A bijective proof of Kadell's conjecture on plane partitions

We give a weight-preserving bijection from _{r, µ} ^m to, where _{r, µ} ^m is the set of all plane partitions whose entries are m and whose entries below ther-th row form a column strict plane partition of type, and _µ ^m the set of all column strict plane partitions of type whose entries are m, and the set of all plane partitions with at mostr rows, whose entries are m. This confirms a conjecture of Kadell.     

A Note on Partitions into Distinct Parts and Odd Parts

Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijection implies the above statement.