相关论文: Dynamically broken Topcolor at Large-N
We present a picture of phase transitions of the system with colored multiplicative noise. Considering the noise amplitude as the power-law dependence of the stochastic variable $x^a$ we show the way to phase transitions disorder-order and…
An \emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A \emph{cyclic interval $t$-coloring}…
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must…
We point out that the flavor problem in theories with dynamical electroweak symmetry breaking can be effectively decoupled if the physics above the TeV scale is strongly conformal, and the electroweak order parameter has a scaling dimension…
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
We present nonlinear (NL) and higher twist (HT) corrections to the color dipole model (CDM) bounds at low values of $x$ and $Q^{2}$ using the parameterization method. Consistency between the bounds at this region describe that a transition…
A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a cyclic interval $t$-coloring if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…
Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…
Topology plays a cardinal role in explaining phases and quantum phase transitions beyond the Landau-Ginzburg-Wilson paradigm. In this study, we formulate a set of models of Dirac fermions in 2+1 dimensions with…
We critically reconsider the argument based on 't Hooft anomaly matching that aims at proving chiral symmetry breaking in confining four-dimensional QCD-like theories with $N_c>2$ colors and $N_f$ flavors. The main line of reasoning relies…
Topological phases of matter are ubiquitous in crystals, but less is known about their existence in amorphous systems, that lack long-range order. In this perspective, we review the recent progress made on theoretically defining amorphous…
We study the classical color radiation from very high energy collisions that produce colored particles. In the extreme high energy limit, the classical color fields are confined to a light-shell expanding at $c$ and are associated with a…
We study the probability distribution of a current flowing through a diffusive system connected to a pair of reservoirs at its two ends. Sufficient conditions for the occurrence of a host of possible phase transitions both in and out of…
In this paper, we present improved algorithms for the $(\Delta+1)$ (vertex) coloring problem in the Congested-Clique model of distributed computing. In this model, the input is a graph on $n$ nodes, initially each node knows only its…
In the framework of a recently proposed topological approach to phase transitions, some sufficient conditions ensuring the presence of the spontaneous breaking of a Z_2 symmetry and of a symmetry-breaking phase transition are introduced and…
We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…
We study simple models of intermittency, involving switching between two states, within the dynamical large-deviation formalism. Singularities appear in the formalism when switching is cooperative, or when its basic timescale diverges. In…
In the colour string model the impact of string percolation on multiplicities, their long-range correlations and average transverse momentum is studied. The multiplicities are shown to be damped by a simple factor which follows from the…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
We study a Tur\'an-type problem on edge-colored complete graphs. We show that for any $r$ and $t$, any sufficiently large $r$-edge-colored complete graph on $n$ vertices with $\Omega(n^{2-1/tr^r})$ edges in each color contains a member from…