相关论文: Dynamically broken Topcolor at Large-N
The Colour Refinement procedure and its generalisation to higher dimensions, the Weisfeiler-Leman algorithm, are central subroutines in approaches to the graph isomorphism problem. In an iterative fashion, Colour Refinement computes a…
Supersymmetry is one of the most plausible and theoretically motivated frameworks for extending the Standard Model. However, any supersymmetry in Nature must be a broken symmetry. Dynamical supersymmetry breaking (DSB) is an attractive idea…
We consider vertex coloring of an acyclic digraph $\Gdag$ in such a way that two vertices which have a common ancestor in $\Gdag$ receive distinct colors. Such colorings arise in a natural way when bounding space for various genetic data…
We study the statistical mechanics of a model describing the coevolution of species interacting in a random way. We find that at high competition replica symmetry is broken. We solve the model in the approximation of one step replica…
We consider soft gluon evolution in the colour flow basis. We give explicit expressions for the colour structure of the (one-loop) soft anomalous dimension matrix for an arbitrary number of partons, and show how the successive…
The phase diagram for quark matter is investigated within a simple Nambu-Jona-Lasinio model without vector correlations. It is found that the phase structure in the temperature-density plane depends sensitively on the parametrization of the…
In this work the spontaneous symmetry breaking in certain nonlinear theories with second-class constraints is explored. Using the Dirac's method we perform an analysis of the constraints and the counting of the degrees of freedom. The…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We show a method how to convert any graph into the binary number and vice versa. We derive upper bound for maximum number of graphs, that, have fixed number of vertices and can be colored with n colors (n is any given number). Proof for the…
We review mechanisms of dynamical supersymmetry breaking. Several observations that narrow the search for possible models of dynamical supersymmetry breaking are summarized. These observations include the necessary and sufficient conditions…
The investigation of the Hamiltonian dynamical counterpart of phase transitions, combined with the Riemannian geometrization of Hamiltonian dynamics, has led to a preliminary formulation of a differential-topological theory of phase…
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…
In this work we investigate symmetry breaking in the presence of a turbulent environment. The transition from a symmetric state to a symmetry-breaking state is demonstrated using two examples: (i) the transition of a two-dimensional flow to…
A simple two-species asymmetric exclusion model in one dimension with bulk and boundary exchanges of particles is investigated for the existence of spontaneous symmetry breaking. The model is a generalization of the bridge model for which…
If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,k} such that sigma(v) is different from pi_{u,v}(sigma(u))…
We investigate reinforced non-linear urns with interacting types, and show that where there are three interacting types there are phenomena which do not occur with two types. In a model with three types where the interactions between the…
Dynamical symmetries are of considerable importance in elucidating the complex behaviour of strongly interacting systems with many degrees of freedom. Paradigmatic examples are cooperative phenomena as they arise in phase transitions, where…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
A collection of the physical observables, related to the electromagnetic properties of a nucleon, to investigate the non--perturbative quantum fluctuations in the strong interaction vacuum state under the influence of at least one close by…
In this work we discuss the phase structure of a deformed supersymmetric nonlinear sigma model in a three-dimensional space-time. The deformation is introduced by a term that breaks supersymmetry explicitly, through imposing a slightly…