Dynamical Study of Polydisperse Hard-Sphere System

We study the interplay between the fluid-crystal transition and the glass transition of elastic sphere system with polydispersity using nonequilibrium molecular dynamics simulations. It is found that the end point of the crystal-fluid transition line, which corresponds to the critical polydispersity above which the crystal state is unstable, is on the glass transition line. This means that crystal and fluid states at the melting point becomes less distinguishable as polydispersity increases and finally they become identical state, i.e., marginal glass state, at critical polydispersity.Comment: 5 pages, 5 figure

Positional Order and Diffusion Processes in Particle Systems

Nonequilibrium behaviors of positional order are discussed based on diffusion processes in particle systems. With the cumulant expansion method up to the second order, we obtain a relation between the positional order parameter $\Psi$ and the mean square displacement $M$ to be $\Psi \sim \exp(- {\bf K}^2 M /2d)$ with a reciprocal vector ${\bf K}$ and the dimension of the system $d$. On the basis of the relation, the behavior of positional order is predicted to be $\Psi \sim \exp(-{\bf K}^2Dt)$ when the system involves normal diffusion with a diffusion constant $D$. We also find that a diffusion process with swapping positions of particles contributes to higher orders of the cumulants. The swapping diffusion allows particle to diffuse without destroying the positional order while the normal diffusion destroys it.Comment: 4 pages, 4 figures. Submitted to Phys. Rev.

Generating facets for the cut polytope of a graph by triangular elimination

The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to prove certain inequalities are facet inducing for the cut polytope. In this paper we introduce a lifting operation, named triangular elimination, applicable to the cut polytope of a wide range of graphs. Triangular elimination is a specific combination of zero-lifting and Fourier-Motzkin elimination using the triangle inequality. We prove sufficient conditions for the triangular elimination of facet inducing inequalities to be facet inducing. The proof is based on a variation of the lifting lemma adapted to general graphs. The result can be used to derive facet inducing inequalities of the cut polytope of various graphs from those of the complete graph. We also investigate the symmetry of facet inducing inequalities of the cut polytope of the complete bipartite graph derived by triangular elimination.Comment: 19 pages, 1 figure; filled details of the proof of Theorem 4, made many other small change