Sum of squares lower bounds for refuting any CSP

Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen literals. Provided the constraint density satisfies $\Delta \gg 1$, such an instance is unsatisfiable with high probability. The \emph{refutation} problem is to efficiently find a proof of unsatisfiability. We show that whenever the predicate $P$ supports a $t$-\emph{wise uniform} probability distribution on its satisfying assignments, the sum of squares (SOS) algorithm of degree $d = \Theta(\frac{n}{\Delta^{2/(t-1)} \log \Delta})$ (which runs in time $n^{O(d)}$) \emph{cannot} refute a random instance of $\mathrm{CSP}(P)$. In particular, the polynomial-time SOS algorithm requires $\widetilde{\Omega}(n^{(t+1)/2})$ constraints to refute random instances of CSP$(P)$ when $P$ supports a $t$-wise uniform distribution on its satisfying assignments. Together with recent work of Lee et al. [LRS15], our result also implies that \emph{any} polynomial-size semidefinite programming relaxation for refutation requires at least $\widetilde{\Omega}(n^{(t+1)/2})$ constraints. Our results (which also extend with no change to CSPs over larger alphabets) subsume all previously known lower bounds for semialgebraic refutation of random CSPs. For every constraint predicate~$P$, they give a three-way hardness tradeoff between the density of constraints, the SOS degree (hence running time), and the strength of the refutation. By recent algorithmic results of Allen et al. [AOW15] and Raghavendra et al. [RRS16], this full three-way tradeoff is \emph{tight}, up to lower-order factors.Comment: 39 pages, 1 figur

Systematics of collective correlation energies from self-consistent mean-field calculations

The collective ground-state correlations stemming from low-lying quadrupole excitations are computed microscopically. To that end, the self-consistent mean-field model is employed on the basis of the Skyrme-Hartre-Fock (SHF) functional augmented by BCS pairing. The microscopic-macroscopic mapping is achieved by quadrupole-constrained mean-field calculations which are processed further in the generator-coordinate method (GCM) at the level of the Gaussian overlap approximation (GOA). We study the correlation effects on energy, charge radii, and surface thickness for a great variety of semi-magic nuclei. A key issue is to work out the influence of variations of the SHF functional. We find that collective ground-state correlations (GSC) are robust under change of nuclear bulk properties (e.g., effective mass, symmetry energy) or of spin-orbit coupling. Some dependence on the pairing strength is observed. This, however, does not change the general conclusion that collective GSC obey a general pattern and that their magnitudes are rather independent of the actual SHF parameters.Comment: 13 pages, 13 figure

Luftverunreinigungen durch photochemische Oxidantien und reaktive Kohlenwasserstoffe im Grossstadtbereich und in Waldgebieten

Available from TIB Hannover: RN 8908(93-106) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEBundesministerium des Innern, Bonn (Germany)DEGerman

Intruder bands in 113^{113}Sn

The level structure of $^{113}$Sn has been investigated. The data were obtained by in-beam $\gamma$-ray spectroscopy using the reaction at 70 MeV performed at the OSIRIS gamma array in the Institut für Kernphysik FN Tandem accelerator. We report in this short note the observation of two intruder type rotational bands in this nucleus