SUSY-Yukawa Sum Rule at the LHC

We propose the "supersymmetric (SUSY) Yukawa sum rule", a relationship between physical masses and mixing angles of the third-generation quarks and squarks. The sum rule follows directly from a relation between quark and squark couplings to the Higgs, enforced by SUSY. It is exactly this relation that ensures the cancellation of the one-loop quadratic divergence in the Higgs mass from the top sector. Testing the sum rule experimentally would thus provide a powerful consistency check on SUSY as the solution to the gauge hierarchy problem. While such a test will most likely have to await a future next-generation lepton collider, the LHC experiments may be able to make significant progress towards this goal. If some of the terms entering the sum rule are measured at the LHC, the sum rule can be used (within SUSY framework) to put interesting constraints on the other terms, such as the mixing angles among third-generation squarks. We outline how the required mass measurements could be performed, and estimate the accuracy that can be achieved at the LHC.Comment: 6 pages, 3 figures (final version accepted for publication in PRD; extended discussion of Upsilon and Upsilon_prime

Automatic Generation of CHR Constraint Solvers

In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous works where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.Comment: to be published in Theory and Practice of Logic Programming, 16 pages, 2 figure

Composite Higgs Sketch

The coupling of a composite Higgs to the standard model fields can deviate substantially from the standard model values. In this case perturbative unitarity might break down before the scale of compositeness is reached, which would suggest that additional composites should lie well below this scale. In this paper we account for the presence of an additional spin 1 custodial triplet of rhos. We examine the implications of requiring perturbative unitarity up to the compositeness scale and find that one has to be close to saturating certain unitarity sum rules involving the Higgs and the rho couplings. Given these restrictions on the parameter space we investigate the main phenomenological consequences of the spin 1 triplet. We find that they can substantially enhance the Higgs di-photon rate at the LHC even with a reduced Higgs coupling to gauge bosons. The main existing LHC bounds arise from di-boson searches, especially in the experimentally clean channel where the charged rhos decay to a W-boson and a Z, which then decay leptonically. We find that a large range of interesting parameter space with 700 GeV < m(rho) < 2 TeV is currently experimentally viable.Comment: 37 pages, 12 figures; v4: sum rule corrected, conclusions unchange

Improvising Linguistic Style: Social and Affective Bases for Agent Personality

This paper introduces Linguistic Style Improvisation, a theory and set of algorithms for improvisation of spoken utterances by artificial agents, with applications to interactive story and dialogue systems. We argue that linguistic style is a key aspect of character, and show how speech act representations common in AI can provide abstract representations from which computer characters can improvise. We show that the mechanisms proposed introduce the possibility of socially oriented agents, meet the requirements that lifelike characters be believable, and satisfy particular criteria for improvisation proposed by Hayes-Roth.Comment: 10 pages, uses aaai.sty, lingmacros.sty, psfig.st

Classes of Terminating Logic Programs

Termination of logic programs depends critically on the selection rule, i.e. the rule that determines which atom is selected in each resolution step. In this article, we classify programs (and queries) according to the selection rules for which they terminate. This is a survey and unified view on different approaches in the literature. For each class, we present a sufficient, for most classes even necessary, criterion for determining that a program is in that class. We study six classes: a program strongly terminates if it terminates for all selection rules; a program input terminates if it terminates for selection rules which only select atoms that are sufficiently instantiated in their input positions, so that these arguments do not get instantiated any further by the unification; a program local delay terminates if it terminates for local selection rules which only select atoms that are bounded w.r.t. an appropriate level mapping; a program left-terminates if it terminates for the usual left-to-right selection rule; a program exists-terminates if there exists a selection rule for which it terminates; finally, a program has bounded nondeterminism if it only has finitely many refutations. We propose a semantics-preserving transformation from programs with bounded nondeterminism into strongly terminating programs. Moreover, by unifying different formalisms and making appropriate assumptions, we are able to establish a formal hierarchy between the different classes.Comment: 50 pages. The following mistake was corrected: In figure 5, the first clause for insert was insert([],X,[X]

Notes on Connes' Construction of the Standard Model

The mathematical apparatus of non commutative geometry and operator algebras which Connes has brought to bear to construct a rational scheme for the internal symmetries of the standard model is presented from the physicist's point of view. Gauge symmetry, anomaly freedom, conservation of electric charge, parity violation and charge conjugation all play a vital role. When put together with a relatively simple set of algebraic algorithms they deliver many of the features of the standard model which otherwise seem rather ad hoc.Comment: 25 pages, Latex, no figure

Answer-Type Modification without Tears: Prompt-Passing Style Translation for Typed Delimited-Control Operators

The salient feature of delimited-control operators is their ability to modify answer types during computation. The feature, answer-type modification (ATM for short), allows one to express various interesting programs such as typed printf compactly and nicely, while it makes it difficult to embed these operators in standard functional languages. In this paper, we present a typed translation of delimited-control operators shift and reset with ATM into a familiar language with multi-prompt shift and reset without ATM, which lets us use ATM in standard languages without modifying the type system. Our translation generalizes Kiselyov's direct-style implementation of typed printf, which uses two prompts to emulate the modification of answer types, and passes them during computation. We prove that our translation preserves typing. As the naive prompt-passing style translation generates and passes many prompts even for pure terms, we show an optimized translation that generate prompts only when needed, which is also type-preserving. Finally, we give an implementation in the tagless-final style which respects typing by construction.Comment: In Proceedings WoC 2015, arXiv:1606.0583