We report on transport properties of the super-honeycomb lattice, the band structure of which possesses a flat band and Dirac cones, according to the tight-binding approximation. This super-honeycomb model combines the honeycomb lattice and the Lieb lattice and displays the properties of both. The super-honeycomb lattice also represents a hybrid fermionic and bosonic system, which is rarely seen in nature. By choosing the phases of input beams properly, the flat-band mode of the super-honeycomb will be excited and the input beams will exhibit strong localization during propagation. On the other hand, if the modes of Dirac cones of the super-honeycomb lattice are excited, one will observe conical diffraction. Furthermore, if the input beam is properly chosen to excite a sublattice of the super-honeycomb lattice and the modes of Dirac cones with different pseudospins, e.g., the three-beam interference pattern, the pseudospin-mediated vortices will be observed.

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.

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 observe vortex generation by selective excitation of two honeycomb sublattices at the vicinity of Dirac points. Such vortices arise from graphene “pseudospin”, suggesting that “pseudospin” could be observable and possess real angular momentum.

We propose a new nonmonotone filter method to promote global and fast local convergence for sequential quadratic programming algorithms. Our method uses two filters: a standard, global g-filter for global convergence, and a local nonmonotone l-filter that allows us to establish fast local convergence. We show how to switch between the two filters efficiently, and we prove global and superlinear local convergence. A special feature of the proposed method is that it does not require second-order correction steps. We present preliminary numerical results comparing our implementation with a classical filter SQP method.