Gravity waves and the LHC: Towards high-scale inflation with low-energy SUSY

It has been argued that rather generic features of string-inspired inflationary theories with low-energy supersymmetry (SUSY) make it difficult to achieve inflation with a Hubble scale H > m_{3/2}, where m_{3/2} is the gravitino mass in the SUSY-breaking vacuum state. We present a class of string-inspired supergravity realizations of chaotic inflation where a simple, dynamical mechanism yields hierarchically small scales of post-inflationary supersymmetry breaking. Within these toy models we can easily achieve small ratios between m_{3/2} and the Hubble scale of inflation. This is possible because the expectation value of the superpotential relaxes from large to small values during the course of inflation. However, our toy models do not provide a reasonable fit to cosmological data if one sets the SUSY-breaking scale to m_{3/2} < TeV. Our work is a small step towards relieving the apparent tension between high-scale inflation and low-scale supersymmetry breaking in string compactifications.Comment: 21+1 pages, 5 figures, LaTeX, v2: added references, v3: very minor changes, version to appear in JHE

M2-Branes and Fano 3-folds

A class of supersymmetric gauge theories arising from M2-branes probing Calabi-Yau 4-folds which are cones over smooth toric Fano 3-folds is investigated. For each model, the toric data of the mesonic moduli space is derived using the forward algorithm. The generators of the mesonic moduli space are determined using Hilbert series. The spectrum of scaling dimensions for chiral operators is computed.Comment: 128 pages, 39 figures, 42 table

Online Ramsey Numbers and the Subgraph Query Problem

The $(m,n)$-online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each turn and Painter immediately paints it red or blue. Builder's goal is to force Painter to create either a red $K_m$ or a blue $K_n$ using as few turns as possible. The online Ramsey number $\tilde{r}(m,n)$ is the minimum number of edges Builder needs to guarantee a win in the $(m,n)$-online Ramsey game. By analyzing the special case where Painter plays randomly, we obtain an exponential improvement $$\tilde{r}(n,n) \ge 2^{(2-\sqrt{2})n + O(1)}$$ for the lower bound on the diagonal online Ramsey number, as well as a corresponding improvement $$\tilde{r}(m,n) \ge n^{(2-\sqrt{2})m + O(1)}$$ for the off-diagonal case, where $m\ge 3$ is fixed and $n\rightarrow\infty$. Using a different randomized Painter strategy, we prove that $\tilde{r}(3,n)=\tilde{\Theta}(n^3)$, determining this function up to a polylogarithmic factor. We also improve the upper bound in the off-diagonal case for $m \geq 4$. In connection with the online Ramsey game with a random Painter, we study the problem of finding a copy of a target graph $H$ in a sufficiently large unknown Erd\H{o}s--R\'{e}nyi random graph $G(N,p)$ using as few queries as possible, where each query reveals whether or not a particular pair of vertices are adjacent. We call this problem the Subgraph Query Problem. We determine the order of the number of queries needed for complete graphs up to five vertices and prove general bounds for this problem.Comment: Corrected substantial error in the proof of Theorem

Single-Scale Natural SUSY

We consider the prospects for natural SUSY models consistent with current data. Recent constraints make the standard paradigm unnatural so we consider what could be a minimal extension consistent with what we now know. The most promising such scenarios extend the MSSM with new tree-level Higgs interactions that can lift its mass to at least 125 GeV and also allow for flavor-dependent soft terms so that the third generation squarks are lighter than current bounds on the first and second generation squarks. We argue that a common feature of almost all such models is the need for a new scale near 10 TeV, such as a scale of Higgsing or confinement of a new gauge group. We consider the question whether such a model can naturally derive from a single mass scale associated with supersymmetry breaking. Most such models simply postulate new scales, leaving their proximity to the scale of MSSM soft terms a mystery. This coincidence problem may be thought of as a mild tuning, analogous to the usual mu problem. We find that a single mass scale origin is challenging, but suggest that a more natural origin for such a new dynamical scale is the gravitino mass, m_{3/2}, in theories where the MSSM soft terms are a loop factor below m_{3/2}. As an example, we build a variant of the NMSSM where the singlet S is composite, and the strong dynamics leading to compositeness is triggered by masses of order m_{3/2} for some fields. Our focus is the Higgs sector, but our model is compatible with a light stop (with the other generation squarks heavy, or with R-parity violation or another mechanism to hide them from current searches). All the interesting low-energy mass scales, including linear terms for S playing a key role in EWSB, arise dynamically from the single scale m_{3/2}. However, numerical coefficients from RG effects and wavefunction factors in an extra dimension complicate the otherwise simple story.Comment: 32 pages, 3 figures; version accepted by JHE

What does inflation really predict?

If the inflaton potential has multiple minima, as may be expected in, e.g., the string theory "landscape", inflation predicts a probability distribution for the cosmological parameters describing spatial curvature (Omega_tot), dark energy (rho_Lambda, w, etc.), the primordial density fluctuations (Omega_tot, dark energy (rho_Lambda, w, etc.). We compute this multivariate probability distribution for various classes of single-field slow-roll models, exploring its dependence on the characteristic inflationary energy scales, the shape of the potential V and and the choice of measure underlying the calculation. We find that unless the characteristic scale Delta-phi on which V varies happens to be near the Planck scale, the only aspect of V that matters observationally is the statistical distribution of its peaks and troughs. For all energy scales and plausible measures considered, we obtain the predictions Omega_tot ~ 1+-0.00001, w=-1 and rho_Lambda in the observed ballpark but uncomfortably high. The high energy limit predicts n_s ~ 0.96, dn_s/dlnk ~ -0.0006, r ~ 0.15 and n_t ~ -0.02, consistent with observational data and indistinguishable from eternal phi^2-inflation. The low-energy limit predicts 5 parameters but prefers larger Q and redder n_s than observed. We discuss the coolness problem, the smoothness problem and the pothole paradox, which severely limit the viable class of models and measures. Our findings bode well for detecting an inflationary gravitational wave signature with future CMB polarization experiments, with the arguably best-motivated single-field models favoring the detectable level r ~ 0.03. (Abridged)Comment: Replaced to match accepted JCAP version. Improved discussion, references. 42 pages, 17 fig

Hypergraph Ramsey numbers of cliques versus stars

Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-uniform hypergraph on $n+1$ vertices consisting of all $\binom{n}{2}$ edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow either at most polynomially or at least exponentially, we show that the off-diagonal Ramsey number $r(K_{4}^{(3)},S_n^{(3)})$ exhibits an unusual intermediate growth rate, namely, $$2^{c \log^2 n} \le r(K_{4}^{(3)},S_n^{(3)}) \le 2^{c' n^{2/3}\log n}$$ for some positive constants $c$ and $c'$. The proof of these bounds brings in a novel Ramsey problem on grid graphs which may be of independent interest: what is the minimum $N$ such that any $2$-edge-coloring of the Cartesian product $K_N \square K_N$ contains either a red rectangle or a blue $K_n$?Comment: 13 page

Big line or big convex polygon

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$, $$(3\ell - 1) \cdot 2^{n-5} < ES_{\ell}(n) < \ell^2 \cdot 2^{n+ C\sqrt{n\log n}}.$$ A similar extension of the well-known Erd\H os--Szekeres cups-caps theorem is also proved

On off-diagonal hypergraph Ramsey numbers

A fundamental problem in Ramsey theory is to determine the growth rate in terms of $n$ of the Ramsey number $r(H, K_n^{(3)})$ of a fixed $3$-uniform hypergraph $H$ versus the complete $3$-uniform hypergraph with $n$ vertices. We study this problem, proving two main results. First, we show that for a broad class of $H$, including links of odd cycles and tight cycles of length not divisible by three, $r(H, K_n^{(3)}) \ge 2^{\Omega_H(n \log n)}$. This significantly generalizes and simplifies an earlier construction of Fox and He which handled the case of links of odd cycles and is sharp both in this case and for all but finitely many tight cycles of length not divisible by three. Second, disproving a folklore conjecture in the area, we show that there exists a linear hypergraph $H$ for which $r(H, K_n^{(3)})$ is superpolynomial in $n$. This provides the first example of a separation between $r(H,K_n^{(3)})$ and $r(H,K_{n,n,n}^{(3)})$, since the latter is known to be polynomial in $n$ when $H$ is linear.Comment: 22 page

Online Ramsey Numbers and the Subgraph Query Problem

The (m,n)-online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each turn and Painter immediately paints it red or blue. Builder's goal is to force Painter to create either a red K_m or a blue K_n using as few turns as possible. The online Ramsey number [equation; see abstract in PDF for details] is the minimum number of edges Builder needs to guarantee a win in the (m,n)-online Ramsey game. By analyzing the special case where Painter plays randomly, we obtain an exponential improvement [equation; see abstract in PDF for details] for the lower bound on the diagonal online Ramsey number, as well as a corresponding improvement [equation; see abstract in PDF for details] for the off-diagonal case, where m ≥ 3 is fixed and n → ∞. Using a different randomized Painter strategy, we prove that [equation; see abstract in PDF for details], determining this function up to a polylogarithmic factor. We also improve the upper bound in the off-diagonal case for m ≥ 4. In connection with the online Ramsey game with a random Painter, we study the problem of finding a copy of a target graph H in a sufficiently large unknown Erdős-Rényi random graph G(N,p) using as few queries as possible, where each query reveals whether or not a particular pair of vertices are adjacent. We call this problem the Subgraph Query Problem. We determine the order of the number of queries needed for complete graphs up to five vertices and prove general bounds for this problem