Myung S. Chung

Learn More
BACKGROUND A common approach to the protein folding problem involves computer simulation of folding using lattice models of amino acid sequences. Key factors for good performance in such models are the correct choice of the temperature and the average interaction energy between residues. In order to push the lattice approach to its limit it is important to(More)
Let ex (D; H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is nite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex (D; H) = O(D 2 ex (D; P m)). Constructively, ex (D; qP m) = (qD 2 ex (D; P m)) if q > 1 and m > 2 (((qD 2) if m = 2). For H =(More)
A graph is H-free if it has no induced subgraph isomorphic to H. Let F(D; H) be the family of H-free connected graphs with maximum degree at most D. Let ex∗(D; H) = max{|E(G)| : G ∈ F(D; H)}; this is finite only when H is a disjoint union of paths. In that case, ex∗(D; H) ∈ O(D2 ex∗(D; Pm)), where Pm is the longest path in H. For m ≥ 6, we determine ex∗(D;(More)
Analytic solutions of the optical Bloch equations for a two-level atom interacting with a strong polychromatic field whose frequencies are symmetrically positioned with respect to the atomic frequency are used to obtain the polarization spectrum of the atom. The spectrum is found to consist of a series of discrete peaks or dips superimposed on the(More)
  • 1