相关论文: Dynamically broken Topcolor at Large-N
The origin of the non commutativity of the limits $t \to \infty$ and $N \to \infty$ in the dynamics of first order transitions is investigated. In the large-N model, i.e. $N \to \infty$ taken first, the low temperature phase is…
We classify the gapped phases of Z_N parafermions in one dimension and construct a representative of each phase. Even in the absence of additional symmetries besides parafermionic parity, parafermions may be realized in a variety of phases,…
Let $G(n,m)$ be the random graph on $n$ vertices with $m$ edges. Let $d=2m/n$ be its average degree. We prove that $G(n,m)$ fails to be $k$-colorable with high probability if $d>2k\ln k-\ln k-1+o_k(1)$. This matches a conjecture put forward…
We consider random matrix models for the thermodynamic competition between chiral symmetry breaking and diquark condensation in QCD at finite temperature and finite baryon density. The models produce mean field phase diagrams whose topology…
The relation between thermodynamic phase transitions in classical systems and topology changes in their configuration space is discussed for a one-dimensional, analytically tractable solid-on-solid model. The topology of a certain family of…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…
We explore a scenarios where topcolor-like dynamics operates in the presence of fourth generation matter fields. Using the Minimal Walking Technicolor as a concrete basis for model building, we construct explicit models and confront them…
In order to investigate the evolutionary process of many deterministic Dynamical systems with unfixed parameter, a set of dynamical models with parameter changing continuously and the accumulation of this change might be large is introduced…
Given an $n$-vertex graph $G$ and two positive integers $d,k \in \mathbb{N}$, the ($d,kn$)-differential coloring problem asks for a coloring of the vertices of $G$ (if one exists) with distinct numbers from 1 to $kn$ (treated as…
Many real world networks have groups of similar nodes which are vulnerable to the same failure or adversary. Nodes can be colored in such a way that colors encode the shared vulnerabilities. Using multiple paths to avoid these…
Many systems in nature and the synthetic world involve ordered arrangements of units on two-dimensional surfaces. We review here the fundamental role payed by both the topology of the underlying surface and its detailed curvature. Topology…
It has been known for years how random height variations of a repeated nano-scale structure can give rise to smooth angular color variations instead of the well-known diffraction pattern experienced if no randomization is present. However,…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…
We consider the discrepancy problem of coloring $n$ intervals with $k$ colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. Somewhat surprisingly, a coloring with…
In this talk we review the physics of top-quark mass generation in models of dynamical electroweak symmetry breaking and the constraints on this physics arising from limits on the deviation of the weak interaction $\rho$-parameter from one.…
A system of interacting multiclass finite-state jump processes is analyzed. The model under consideration consists of a block-structured network with dynamically changing multi-colors nodes. The interaction is local and described through…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
We consider a class of theories involving an extension of the Standard Model gauge group to an {\it a priori} arbitrary number of colors, $N_c$, and derive constraints on $N_c$. One motivation for this is the string theory landscape. For…
We review the theoretical formalism for hard exclusive processes in a nuclear medium. Theory suggests that these processes will show the very interesting phenomena of color transparency and nuclear filtering. The survival probability in…
We construct a complete, realistic, and natural UV completion of minimal conformal technicolor that explains the origin of quark and lepton masses and mixing angles. As in "bosonic technicolor", we embed conformal technicolor in a…