Introduction to Flavour Physics and CP Violation

These lecture notes provide an introduction to the theoretical concepts of flavour physics and CP violation, based on a series of lectures given at the ESHEP 2016 summer school. In the first lecture we review the basics of flavour and CP violation in the Standard Model. The second lecture is dedicated to the phenomenology of K and B meson decays, where we focus on a few representative observables. In the third lecture we give an introduction to flavour physics beyond the Standard Model, both within the framework of Minimal Flavour Violation and beyond.Comment: 30 pages, 10 figures. v2: Few references added. Lectures given at the ESHEP 2016 summer school in Skeikampen, Norway, 15-28 June 2016. To be published as CERN Yellow Repor

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing

Inferring Concept Hierarchies from Text Corpora via Hyperbolic Embeddings

We consider the task of inferring is-a relationships from large text corpora. For this purpose, we propose a new method combining hyperbolic embeddings and Hearst patterns. This approach allows us to set appropriate constraints for inferring concept hierarchies from distributional contexts while also being able to predict missing is-a relationships and to correct wrong extractions. Moreover -- and in contrast with other methods -- the hierarchical nature of hyperbolic space allows us to learn highly efficient representations and to improve the taxonomic consistency of the inferred hierarchies. Experimentally, we show that our approach achieves state-of-the-art performance on several commonly-used benchmarks

Coordinated Robot Navigation via Hierarchical Clustering

We introduce the use of hierarchical clustering for relaxed, deterministic coordination and control of multiple robots. Traditionally an unsupervised learning method, hierarchical clustering offers a formalism for identifying and representing spatially cohesive and segregated robot groups at different resolutions by relating the continuous space of configurations to the combinatorial space of trees. We formalize and exploit this relation, developing computationally effective reactive algorithms for navigating through the combinatorial space in concert with geometric realizations for a particular choice of hierarchical clustering method. These constructions yield computationally effective vector field planners for both hierarchically invariant as well as transitional navigation in the configuration space. We apply these methods to the centralized coordination and control of $n$ perfectly sensed and actuated Euclidean spheres in a $d$-dimensional ambient space (for arbitrary $n$ and $d$). Given a desired configuration supporting a desired hierarchy, we construct a hybrid controller which is quadratic in $n$ and algebraic in $d$ and prove that its execution brings all but a measure zero set of initial configurations to the desired goal with the guarantee of no collisions along the way.Comment: 29 pages, 13 figures, 8 tables, extended version of a paper in preparation for submission to a journa

Modified Dynamical Supergravity Breaking and Off-Diagonal Super-Higgs Effects

We argue that generic off-diagonal vacuum and nonvacuum solutions for Einstein manifolds mimic physical effects in modified gravity theories (MGTs) and encode certain models of the $f(R,T,...)$, Ho\v{r}ava type with dynamical Lorentz symmetry breaking, induced effective mass for the graviton etc. Our main goal is to investigate the dynamical breaking of local supersymmetry determined by off-diagonal solutions in MGTs and encoded as effective Einstein spaces. This includes the Deser-Zumino super-Higgs effect, for instance, for a one-loop potential in a (simple but representative) model of $\mathcal{N}=1, D=4$ supergravity. We develop and apply new geometrical techniques which allows us to decouple the gravitational field equations and integrate them in a very general form with the metric and vielbein fields depending on all the spacetime coordinates via means of various generating and integration functions and parameters. We study how solutions in MGTs may be related to the dynamical generation of a gravitino mass and supersymmetry breaking.Comment: latex2e, 33 pages, with table of content; v3 accepted to Class. Quant. Gravit

Automaták, fák és logika = Automata, trees and logic

Elemi idejű exponenciális algoritmus adtunk meg reguláris szavak ekvivalenciájának eldönthetőségére. Általánosítottuk Kleene tételét végtelen szavakat is felismerő súlyozott automatákra. Kifejlesztettünk egy algebrai módszert, amellyel a CTL logika számos szegmense estén eldönthető, hogy egy reguláris fanyelv definiálható-e a szegmensben. Vizsgáltuk a faautomaták algebrai tulajdonságait, megadtuk a felismerhetőség egy algebrai jellemzését. Definiáltunk a multi-leszálló fatranszformátort és megmutattuk, hogy ekvivalens a determinisztikus reguláris szűkítésű felszálló fatranszformátorral. Meghatároztuk a lineáris multi-leszálló osztály számítási erejét. Megmutattuk, hogy az alakmegőrző leszálló fatranszformátorok ekvivalensek az átcímkézőkkel és bebizonyítottuk, hogy az alakmegőrző tulajdonság eldönthető. Megadtuk a kavics makró fatranszformációk egy felbontását és megmutattuk, hogy a különböző cirkularitási tulajdonságok eldönthetők. Ugyancsak megadtuk a felbontást erős kavics kezelés estén is. Általánosítottuk J. Engelfriet hiararchia tételét súlyozott fatranszformátorokra. Súlyozott faautomatákra definiáltuk a termátíró szemantikát és megmutattuk, hogy ekvivalens az algebari szenmatikával. Algoritmust adtunk annak eldöntésére, hogy egy polinomiálisan súlyozott faautomata véges költségű-e. Vizsgáltuk a súlyozott faautomata különböző változatait: fuzzy faautomata, multioperátor monoid feletti faautomata, Ez utóbbi esetre általánosítottuk a Kleene tételt. | We gave an elementary algorithm for deciding the equivalence of regular words. We generalized Kleene's theorem to weighted automata processing infinite words. We developed an algebraic method that, for several segments of the CTL logic, can be applied to decide if a regular tree language can be defined in that segment. We examined algebraic properties of tree automata, and gave an algebraic characterization of recognizability. We defined multi bottom-up tree transducers and showed that they are equivalent to top-down tree transducers with regular look-ahead. We determined the computation power of the linear subclass. We showed that shape preserving bottom-up tree transducers are equivalent to relabelings. We proved that the shape preserving property is decidable. We gave a decomposition for pebble macro tree transducers and showed that certain circularity properties are decidable. We also gave a decomposition for the strong pebble handling. We have generalized the hierarchy theorem of J. Engelfriet to weighted tree transducers. We defined the term rewrite semantics of weighted tree transducers and showed that it is equivalent to the algebraic semantics. We gave a decision algorithm for the finite cost property of a polynomially weighted tree automata. We defined different versions of weighted tree automata: fuzzy tree automata, weighted tree automata over a multioperator monoid. For the latter we generalized Kleene's theorem

The LMA Solution from Bimaximal Lepton Mixing at the GUT Scale by Renormalization Group Running

We show that in see-saw models with bimaximal lepton mixing at the GUT scale and with zero CP phases, the solar mixing angle theta_{12} generically evolves towards sizably smaller values due to Renormalization Group effects, whereas the evolution of theta_{13} and theta_{23} is comparatively small. The currently favored LMA solution of the solar neutrino problem can thus be obtained in a natural way from bimaximal mixing at the GUT scale. We present numerical examples for the evolution of the leptonic mixing angles in the Standard Model and the MSSM, in which the current best-fit values of the LMA mixing angles are produced. These include a case where the mass eigenstates corresponding to the solar mass squared difference have opposite CP parity.Comment: 14 pages, 10 figures; references and a subsection containing an example with odd CP parities added; results and conclusions unchange

The uses of qualitative data in multimethodology:Developing causal loop diagrams during the coding process

In this research note we describe a method for exploring the creation of causal loop diagrams (CLDs) from the coding trees developed through a grounded theory approach and using computer aided qualitative data analysis software (CAQDAS). The theoretical background to the approach is multimethodology, in line with Minger’s description of paradigm crossing and is appropriately situated within the Appreciate and Analyse phases of PSM intervention. The practical use of this method has been explored and three case studies are presented from the domains of organisational change and entrepreneurial studies. The value of this method is twofold; (i) it has the potential to improve dynamic sensibility in the process of qualitative data analysis, and (ii) it can provide a more rigorous approach to developing CLDs in the formation stage of system dynamics modelling. We propose that the further development of this method requires its implementation within CAQDAS packages so that CLD creation, as a precursor to full system dynamics modelling, is contemporaneous with coding and consistent with a bridging strategy of paradigm crossing