Results 1  10
of
11,771
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 715 (33 self)
 Add to MetaCart
, and the hierarchy reflects the small scale of chiral symmetry breaking in the dual gauge theory.
Breaking an Abelian gauge symmetry near a black hole horizon
, 2008
"... I argue that coupling the Abelian Higgs model to gravity plus a negative cosmological constant leads to black holes which spontaneously break the gauge invariance via a charged scalar condensate slightly outside their horizon. This suggests that black holes can superconduct. ..."
Abstract

Cited by 274 (8 self)
 Add to MetaCart
I argue that coupling the Abelian Higgs model to gravity plus a negative cosmological constant leads to black holes which spontaneously break the gauge invariance via a charged scalar condensate slightly outside their horizon. This suggests that black holes can superconduct.
SymmetryBreaking Predicates for Search Problems
, 1996
"... Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates to the the ..."
Abstract

Cited by 198 (1 self)
 Add to MetaCart
Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates
Symmetry Breaking in Graphs
 Electronic Journal of Combinatorics
, 1996
"... A labeling of the vertices of a graph G, OE : V (G) ! f1; : : : ; rg, is said to be rdistinguishing provided no automorphism of the graph preserves all of the vertex labels. The distinguishing number of a graph G, denoted by D(G), is the minimum r such that G has an rdistinguishing labeling. T ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
A labeling of the vertices of a graph G, OE : V (G) ! f1; : : : ; rg, is said to be rdistinguishing provided no automorphism of the graph preserves all of the vertex labels. The distinguishing number of a graph G, denoted by D(G), is the minimum r such that G has an rdistinguishing labeling
Symmetry Breaking
, 2001
"... Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome ..."
Abstract

Cited by 93 (5 self)
 Add to MetaCart
Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome
Radiative Corrections as the Origin of Spontaneous Symmetry Breaking, Phys. Rev. D7
 A. Linde, Phase Transitions in Gauge Theories
, 1973
"... Using a functional formalism, we investigate the effect of radiative corrections on the possibility of spontaneous symmetry breaking. We find that in some models, in particular, massless gauge theories with scalar mesons, the radiative corrections can induce spontaneous symmetry breaking, even thoug ..."
Abstract

Cited by 182 (0 self)
 Add to MetaCart
Using a functional formalism, we investigate the effect of radiative corrections on the possibility of spontaneous symmetry breaking. We find that in some models, in particular, massless gauge theories with scalar mesons, the radiative corrections can induce spontaneous symmetry breaking, even
Symmetry Breaking in Anonymous Networks: Characterizations
, 1996
"... We characterize exactly the cases in which it is possible to elect a leader in an anonymous network of processors by a deterministic algorithm, and we show that for every network there is a weak election algorithm (i.e., if election is impossible all processors detect this fact in a distributed way) ..."
Abstract

Cited by 46 (10 self)
 Add to MetaCart
). 1 Introduction We consider the problem of electing a leader in an anonymous network of processors. More precisely our model is that of a directed graph, with vertices corresponding to processors, and arcs to communication links (we freely interchange symmetric digraphs and undirected graphs). We
The Power of Orientation in SymmetryBreaking
"... Abstract—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets, and the like. Deterministic algorithms for symmetry breaking that run in a polylogarithmic number of rounds are ..."
Abstract
 Add to MetaCart
(log ∆ + log n) bits of communication. In this paper we further demonstrate the power of orientation on edges in symmetrybreaking. We present efficient algorithms to construct fractional independent sets in constant degree graphs using very low order communication between the vertices. For instance, we show
An introduction to SYMMETRY BREAKING IN GRAPHS
"... This is intended to be a short summary of results that will appear elsewhere, with the goal being to reach the list of open problems at the end. Our motivation is the following: Professor X has a key ring with n seemingly identical keys (that open different doors). We put colored labels on the keys ..."
Abstract
 Add to MetaCart
to distinguish them. What is the minimum number of colors needed? This first appeared in [3], and was brought to our attention by S. Wagon [2]. It translates to the following graph labeling problem: What is the minimum number of colors needed to label the vertices of Cn so that no automorphism of Cn preserves
An introduction to SYMMETRY BREAKING IN GRAPHS
"... This is intended to be a short summary of results that will appear elsewhere, with the goal being to reach the list of open problems at the end. Our motivation is the following: Professor X has a key ring with n seemingly identical keys (that open dierent doors). We put colored labels on the keys t ..."
Abstract
 Add to MetaCart
to distinguish them. What is the minimum number of colors needed? This rst appeared in [3], and was brought to our attention by S. Wagon [2]. It translates to the following graph labeling problem: What is the minimum number of colors needed to label the vertices of C n so that no automorphism of C n
Results 1  10
of
11,771