No abstract uploaded!

We investigate mirror symmetry for toric Calabi-Yau manifolds from the perspective of the SYZ conjecture. Starting with a non-toric special Lagrangian torus fibration on a toric Calabi-Yau manifold $X$, we construct a complex manifold $\check{X}$ using T-duality modified by quantum corrections. These corrections are encoded by Fourier transforms of generating functions of certain open Gromov-Witten invariants. We conjecture that this complex manifold $\check{X}$, which belongs to the Hori-Iqbal-Vafa mirror family, is inherently written in canonical flat coordinates. In particular, we obtain an enumerative meaning for the (inverse) mirror maps, and this gives a geometric reason for why their Taylor series expansions in terms of the K\"ahler parameters of $X$ have integral coefficients. Applying the results in \cite{Chan10} and \cite{LLW10}, we compute the open Gromov-Witten invariants in terms of local BPS invariants and give evidences of our conjecture for several 3-dimensional examples including $K_{\proj^2}$ and $K_{\proj^1\times\proj^1}$.

No abstract uploaded!

No abstract uploaded!

The standard Yee's scheme for the Maxwell eigenvalue problems places the discrete electric field variable at the midpoints of the edges of the grid cells. It performs well when the permittivity is a scalar field. However, when the permittivity is a Hermitian full tensor filed it would generate un-physical complex eigenvalues or frequencies. In this paper, we propose a finite element method which can be interpreted as a modified Yee's scheme to overcome this difficulty. This interpretation enables us to create a fast FFT eigensolver that can compute very effectively the band structure of the anisotropic photonic crystal with SC and FCC lattices. Furthermore, we overcome the usual large null space associated with the Maxwell eigenvalue problem by deriving a null-space free discrete eigenvalue problem which involves a crucial Hermitian positive definite linear system to be solved in each of the iteration steps. It is demonstrated that the CG method without preconditioning converges in 37 iterations even when the dimension of the matrix is as large as $5,184,000$.