Nonlinear dynamics of wave packets in parity-time-symmetric optical lattices near the phase-transition point is analytically studied. A nonlinear Klein–Gordon equation is derived for the envelope of these wave packets. A variety of phenomena known to exist in this envelope equation are shown to also exist in the full equation, including wave blowup, periodic bound states, and solitary wave solutions.

We study Schrdinger operators on an infinite quantum graph of a chain form which consists of identical rings connected at the touching points by -couplings with a parameter\alpha\in {\bb R}. If the graph is' straight', ie periodic with respect to ring shifts, its Hamiltonian has a band spectrum with all the gaps open whenever 0. We consider a'bending'deformation of the chain consisting of changing one position at a single ring and show that it gives rise to eigenvalues in the open spectral gaps. We analyze dependence of these eigenvalues on the coupling and the'bending angle'as well as resonances of the system coming from the bending. We also discuss the behaviour of the eigenvalues and resonances at the edges of the spectral bands.

The problem is concerned about how large (e.g. the Hausdorff dimension) is Whitney's critical set contained in a given fractal. For this, we prove that the Moran arc, an arc containing a Moran set, is a Whitney's critical set. The excellent open set condition is defined, when the condition holds, the associated self-similar set contains a Whitney's critical subset of full dimension. As its application, the Sierpinski gasket and Koch curve have Whitney's critical subset of full dimension. Finally, we provide a self-similar tree which never contains any Whitney's critical set.

In this paper, we present a new algorithm, such that, for the small integer solution (SIS) problem, if the solution is bounded ( by an integer \beta in l_\infty norm, which we call a bounded SIS (BSIS) problem, {\it and if the difference between the row dimension n and the column dimension m of the corresponding matrix is relatively small with respect the row dimension m}, we can solve it easily with a complexity of polynomial in m.

No abstract uploaded!