Results 1 to 10 of about 887,155 (25)
On the Regularization of Extremal Three-point Functions Involving Giant Gravitons [PDF]
, 2015 In the AdS_5/CFT_4 set-up, extremal three-point functions involving two giant 1/2 BPS gravitons and one point-like 1/2 BPS graviton, when calculated using semi-classical string theory methods, match the corresponding three-point functions obtained in the
Kristjansen, Charlotte +2 more
core +4 more sources
Chiral fermions and gauge-fixing in five-dimensional theories [PDF]
, 2001 We study in detail the issue of gauge-fixing in theories with one universal extra dimension, i.e. theories where both bosons and fermions display Kaluza-Klein (KK) excitations.
Papavassiliou, Joannis +1 more
core +3 more sources
, 2008 A \emph{tree-partition} of a graph $G$ is a proper partition of its vertex set into `bags', such that identifying the vertices in each bag produces a forest.
Wood, David R.
core +2 more sources
Explicitly nonstandard uniserial modules [PDF]
, 1993 A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory.
Eklof, Paul C., Shelah, Saharon
core +2 more sources
String field theory and brane superpotentials [PDF]
, 2001 I discuss tree-level amplitudes in cubic topological string field theory, showing that a certain family of gauge conditions leads to an A-infty algebra of tree-level string products which define a potential describing the dynamics of physical states ...
Lazaroiu, C. I.
core +3 more sources
Proof of the MHV vertex expansion for all tree amplitudes in N=4 SYM theory
, 2008 We prove the MHV vertex expansion for all tree amplitudes of N=4 SYM theory. The proof uses a shift acting on all external momenta, and we show that every N^kMHV tree amplitude falls off as 1/z^k, or faster, for large z under this shift.
A. Brandhuber +36 more
core +2 more sources
A characterization of trees with equal 2-domination and 2-independence numbers
, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Brause, Christoph +2 more
core +1 more source
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source
On Low Rank Classical Groups in String Theory, Gauge Theory and Matrix Models [PDF]
, 2003 We consider N=1 supersymmetric U(N), SO(N), and Sp(N) gauge theories, with two-index tensor matter and added tree-level superpotential, for general breaking patterns of the gauge group.
Abbaspur +61 more
core +1 more source
Dynamical percolation on general trees
, 2007 H\"aggstr\"om, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$.
A.S. Besicovitch +22 more
core +1 more source