Non-perturbative approach to high-index-contrast variations in electromagnetic systems

We present a method that formally calculates exact frequency shifts of an electromagnetic field for arbitrary changes in the refractive index. The possible refractive index changes include both anisotropic changes and boundary shifts. Degenerate eigenmode frequencies pose no problems in the presented method. The approach relies on operator algebra to derive an equation for the frequency shifts, which eventually turn out in a simple and physically sound form. Numerically the equations are well-behaved, easy implementable, and can be solved very fast. Like in perturbation theory a reference system is first considered, which then subsequently is used to solve another related, but different system. For our method precision is only limited by the reference system basis functions and the error induced in frequency is of second order for first-order basis set error. As an example we apply our method to the problem of variations in the air-hole diameter in a photonic crystal fiber.     

Slow-light enhanced optical detection in liquid-infiltrated photonic crystals

Slow-light enhanced optical detection in liquid-infiltrated photonic crystals is theoretically studied. Using a scattering-matrix approach and the Wigner–Smith delay time concept, we show that optical absorbance benefits both from slow-light phenomena as well as a high filling factor of the energy residing in the liquid. Utilizing strongly dispersive photonic crystal structures, we numerically demonstrate how liquid-infiltrated photonic crystals facilitate enhanced light–matter interactions, by potentially up to an order of magnitude. The proposed concept provides strong opportunities for improving existing miniaturized absorbance cells for optical detection in lab-on-a-chip systems.     

A remark on the moduli field of a curve

We give a purely algebro-geometric proof of the fact that every nonsingular projective curve can be defined over a finite extension of its moduli field. This extends a result byWolfart [7] to curves over fields of arbitrary characteristic. Received: 30 November 2001     

Preperfect graphs

We say that a vertexx of a graph is predominant if there exists another vertexy ofG such that either every maximum clique ofG containingy containsx or every maximum stable set containingx containsy. A graph is then called preperfect if every induced subgraph has a predominant vertex. We show that preperfect graphs are perfect, and that several well-known classes of perfect graphs are preperfect. We also derive a new characterization of perfect graphs.