Higgs diphoton rate enhancement from supersymmetric physics beyond the MSSM

We show that supersymmetric "new physics" beyond the MSSM can naturally accommodate a Higgs mass near 126 GeV and enhance the signal rate in the Higgs to diphoton channel, while the signal rates in all the other Higgs decay channels coincide with Standard Model expectations, except possibly the Higgs to Z-photon channel. The "new physics" that corrects the relevant Higgs couplings can be captured by two supersymmetric effective operators. We provide a simple example of an underlying model in which these operators are simultaneously generated. The scale of "new physics" that generates these operators can be around 5 TeV or larger, and outside the reach of the LHC.Comment: 24 pages, 4 figure

Proof-Pattern Recognition and Lemma Discovery in ACL2

We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new proofs by analogy with already seen examples. This paper presents the implementation of ACL2(ml) alongside theoretical descriptions of the proof-pattern recognition and lemma discovery methods involved in it

Growth Histories in Bimetric Massive Gravity

We perform cosmological perturbation theory in Hassan-Rosen bimetric gravity for general homogeneous and isotropic backgrounds. In the de Sitter approximation, we obtain decoupled sets of massless and massive scalar gravitational fluctuations. Matter perturbations then evolve like in Einstein gravity. We perturb the future de Sitter regime by the ratio of matter to dark energy, producing quasi-de Sitter space. In this more general setting the massive and massless fluctuations mix. We argue that in the quasi-de Sitter regime, the growth of structure in bimetric gravity differs from that of Einstein gravity.Comment: 28 pages + appendix, 11 figure

Hipster: Integrating Theory Exploration in a Proof Assistant

This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabelle/HOL. Theory exploration is a technique for automatically discovering new interesting lemmas in a given theory development. Hipster can be used in two main modes. The first is exploratory mode, used for automatically generating basic lemmas about a given set of datatypes and functions in a new theory development. The second is proof mode, used in a particular proof attempt, trying to discover the missing lemmas which would allow the current goal to be proved. Hipster's proof mode complements and boosts existing proof automation techniques that rely on automatically selecting existing lemmas, by inventing new lemmas that need induction to be proved. We show example uses of both modes

On elliptic solutions of the quintic complex one-dimensional Ginzburg-Landau equation

The Conte-Musette method has been modified for the search of only elliptic solutions to systems of differential equations. A key idea of this a priory restriction is to simplify calculations by means of the use of a few Laurent series solutions instead of one and the use of the residue theorem. The application of our approach to the quintic complex one-dimensional Ginzburg-Landau equation (CGLE5) allows to find elliptic solutions in the wave form. We also find restrictions on coefficients, which are necessary conditions for the existence of elliptic solutions for the CGLE5. Using the investigation of the CGLE5 as an example, we demonstrate that to find elliptic solutions the analysis of a system of differential equations is more preferable than the analysis of the equivalent single differential equation.Comment: LaTeX, 21 page

A CDCL-style calculus for solving non-linear constraints

In this paper we propose a novel approach for checking satisfiability of non-linear constraints over the reals, called ksmt. The procedure is based on conflict resolution in CDCL style calculus, using a composition of symbolical and numerical methods. To deal with the non-linear components in case of conflicts we use numerically constructed restricted linearisations. This approach covers a large number of computable non-linear real functions such as polynomials, rational or trigonometrical functions and beyond. A prototypical implementation has been evaluated on several non-linear SMT-LIB examples and the results have been compared with state-of-the-art SMT solvers.Comment: 17 pages, 3 figures; accepted at FroCoS 2019; software available at <http://informatik.uni-trier.de/~brausse/ksmt/

Triangle-generation in topological D-brane categories

Tachyon condensation in topological Landau-Ginzburg models can generally be studied using methods of commutative algebra and properties of triangulated categories. The efficiency of this approach is demonstrated by explicitly proving that every D-brane system in all minimal models of type ADE can be generated from only one or two fundamental branes.Comment: 34 page

Automated Generation of User Guidance by Combining Computation and Deduction

Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". This has been implemented in a prototype, which has been proved useful in educational practice and has gained academic relevance with an emerging generation of educational mathematics assistants (EMA) based on Computer Theorem Proving (CTP). Automated Theorem Proving (ATP), i.e. deduction, is the most reliable technology used to check user input. However ATP is inherently weak in automatically generating solutions for arbitrary problems in applied mathematics. This weakness is crucial for EMAs: when ATP checks user input as incorrect and the learner gets stuck then the system should be able to suggest possible next steps. The key idea of Lucas Interpretation is to compute the steps of a calculation following a program written in a novel CTP-based programming language, i.e. computation provides the next steps. User guidance is generated by combining deduction and computation: the latter is performed by a specific language interpreter, which works like a debugger and hands over control to the learner at breakpoints, i.e. tactics generating the steps of calculation. The interpreter also builds up logical contexts providing ATP with the data required for checking user input, thus combining computation and deduction. The paper describes the concepts underlying Lucas Interpretation so that open questions can adequately be addressed, and prerequisites for further work are provided.Comment: In Proceedings THedu'11, arXiv:1202.453

Need Polynomial Systems Be Doubly-Exponential?

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of zeros of a zero-dimensional system is singly-exponential in the number of variables. How should this contradiction be reconciled? We first note that [Mayr and Ritscher, 2013] shows that the doubly exponential nature of Gr\"{o}bner bases is with respect to the dimension of the ideal, not the number of variables. This inspires us to consider what can be done for Cylindrical Algebraic Decomposition which produces a doubly-exponential number of polynomials of doubly-exponential degree. We review work from ISSAC 2015 which showed the number of polynomials could be restricted to doubly-exponential in the (complex) dimension using McCallum's theory of reduced projection in the presence of equational constraints. We then discuss preliminary results showing the same for the degree of those polynomials. The results are under primitivity assumptions whose importance we illustrate.Comment: Extended Abstract for ICMS 2016 Presentation. arXiv admin note: text overlap with arXiv:1605.0249

BAT3 Guides Misfolded Glycoproteins Out of the Endoplasmic Reticulum

Secretory and membrane proteins that fail to acquire their native conformation within the lumen of the Endoplasmic Reticulum (ER) are usually targeted for ubiquitin-dependent degradation by the proteasome. How partially folded polypeptides are kept from aggregation once ejected from the ER into the cytosol is not known. We show that BAT3, a cytosolic chaperone, is recruited to the site of dislocation through its interaction with Derlin2. Furthermore, we observe cytoplasmic BAT3 in a complex with a polypeptide that originates in the ER as a glycoprotein, an interaction that depends on the cytosolic disposition of both, visualized even in the absence of proteasomal inhibition. Cells depleted of BAT3 fail to degrade an established dislocation substrate. We thus implicate a cytosolic chaperone as an active participant in the dislocation of ER glycoproteins.United States. National Institutes of HealthBoehringer Ingelheim Fond