We introduce a recursive bosonic quantization technique for generating classical parity-time (PT ) photonic structures that possess hidden symmetries and higher-order exceptional points. We study light transport in these geometries and we demonstrate that perfect state transfer is possible only for certain initial conditions. Moreover, we show that for the same propagation direction, left and r...

The transfer of chemical vapor deposition (CVD)-grown graphene is the prerequisite for many applications. Herein, we introduce a simple and eco-friendly electrochemical technique to transfer graphene using agarose gel as the solid electrolyte and a mechanical support layer for graphene sheets. This transfer technique will be a perfect candidate for the industrial applications of graphene.

The frequency behavior of the tunnel injection quantum dot vertical cavitysurface emitting laser (TIQD-VCSEL) is investigated by using an analyticalnumericalmethod on the modulation transfer function. The function is based on therate equations and is decomposed into components related to different energy levelsinside the quantum dot and injection well. In this way, the effect of the tunnelingpr...

We study the enantiospecific state transfer for gaseous symmetric-top chiral molecules by constructing a four-level model. This model is formed coupling electric dipole transitions among four appropriate rovibrational states with three electromagnetic fields. It includes two cyclic three-level substructures, where overall phases of strengths differ $\ensuremath{\pi}$ enantiomers and reflect chi...

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(Kn) ≥ n∗φ(n) 2 and for m and n which are odd and co-prime to each other, c(Kmn) ≥ 2 ∗ c(Km) ∗ c(Kn). In this note, we establish that both these results are equivalent in the sense that they both give rise to the same lower bound.

V. Chv atal proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most + ! 1 which meets every !-clique and every -stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's Strong Perfect Graph Conjecture for a very large class of graphs, although ...

This paper examines how the fertility of enslaved women was affected by the promise of freedom. Exploiting geographic variation in the effect of the Fugitive Slave Law of 1850, I demonstrate a negative correlation between fertility and the distance to freedom. This negative correlation is stronger on larger plantations but weaker when the slaveholder is a woman. A similar correlation is not pre...

In order to prove the Strong Perfect Graph Conjecture, the existence of a ”simple” property P holding for any minimal non-quasi-parity Berge graph G would really reduce the difficulty of the problem. We prove here that this property cannot be of type ”G is F-free”, where F is any fixed family of Berge graphs.