Phenomenology of A Supersymmetric Model for Fermion Mass Hierarchy

Some phenomenological aspects of a supersymmetric model for fermion mass hierarchy proposed previously are discussed. It is required that the lepton universality violation is near to its current experimental bound. The lepton number violation decay modes $\tau \to 2e\mu$ and $3\mu$ maybe observable in the near future. The Majorana mass of electron-neutrino is predicted to be about 0.1 eV. The fine-tuning problem is discussed.Comment: 13 pages, latex, two figures, substantially revise

Supersymmetry for Flavors

An understanding of the lepton masses within the framework of SUSY is presented. A family symmetry is introduced. Sneutrino VEV breaks this symmetry. The tau mass is due to the Higgs VEV, and muon mass purely from the sneutrino VEV. A viable model is constructed, which predicts (1-10) MeV tau-neutrino.Comment: 5 pages, latex, no figure. Talk at the workshop on Frontier of Theoretical Physics, Beijing, Nov., 199

Packing Topological Minors Half-Integrally

The packing problem and the covering problem are two of the most general questions in graph theory. The Erd\H{o}s-P\'{o}sa property characterizes the cases when the optimal solutions of these two problems are bounded by functions of each other. Robertson and Seymour proved that when packing and covering $H$-minors for any fixed graph $H$, the planarity of $H$ is equivalent with the Erd\H{o}s-P\'{o}sa property. Thomas conjectured that the planarity is no longer required if the solution of the packing problem is allowed to be half-integral. In this paper, we prove that this half-integral version of Erd\H{o}s-P\'{o}sa property holds with respect to the topological minor containment, which easily implies Thomas' conjecture. Indeed, we prove an even stronger statement in which those subdivisions are rooted at any choice of prescribed subsets of vertices. Precisely, we prove that for every graph $H$, there exists a function $f$ such that for every graph $G$, every sequence $(R_v: v \in V(H))$ of subsets of $V(G)$ and every integer $k$, either there exist $k$ subgraphs $G_1,G_2,...,G_k$ of $G$ such that every vertex of $G$ belongs to at most two of $G_1,...,G_k$ and each $G_i$ is isomorphic to a subdivision of $H$ whose branch vertex corresponding to $v$ belongs to $R_v$ for each $v \in V(H)$, or there exists a set $Z \subseteq V(G)$ with size at most $f(k)$ intersecting all subgraphs of $G$ isomorphic to a subdivision of $H$ whose branch vertex corresponding to $v$ belongs to $R_v$ for each $v \in V(H)$. Applications of this theorem include generalizations of algorithmic meta-theorems and structure theorems for $H$-topological minor free (or $H$-minor free) graphs to graphs that do not half-integrally pack many $H$-topological minors (or $H$-minors)