The Glue Around Quarks and the Interquark Potential

The quarks of quark models cannot be identified with the quarks of the QCD Lagrangian. We review the restrictions that gauge field theories place on any description of physical (colour) charges. A method to construct charged particles is presented. The solutions are applied to a variety of applications. Their Green's functions are shown to be free of infra-red divergences to all orders in perturbation theory. The interquark potential is analysed and it is shown that the interaction responsible for anti-screening results from the force between two separately gauge invariant constituent quarks. A fundamental limit on the applicability of quark models is identified.Comment: 4 pages, LaTeX, talk given at Montpellier meeting QCD9

Electrons and Photons: Fact not Fiction

The particle Fock space of the matter fields in QED can be constructed using the free creation and annihilation operators. However, these particle operators are not, even at asymptotically large times, the modes of the matter fields that enter the QED Lagrangian. In this letter we construct the fields which do recover such particle modes at large times. We are thus able to demonstrate for the first time that, contrary to statements found in the literature, a relativistic description of charged particles in QED exists.Comment: 8 pages, LaTe

Entanglement assisted alignment of reference frames using a dense covariant coding

We present a procedure inspired by dense coding, which enables a highly efficient transmission of information of a continuous nature. The procedure requires the sender and the recipient to share a maximally entangled state. We deal with the concrete problem of aligning reference frames or trihedra by means of a quantum system. We find the optimal covariant measurement and compute the corresponding average error, which has a remarkably simple close form. The connection of this procedure with that of estimating unitary transformations on qubits is briefly discussed.Comment: 4 pages, RevTeX, Version to appear in PR

Charges from Dressed Matter: Physics and Renormalisation

Gauge theories are characterised by long range interactions. Neglecting these interactions at large times, and identifying the Lagrangian matter fields with the asymptotic physical fields, leads to the infra-red problem. In this paper we study the perturbative applications of a construction of physical charges in QED, where the matter fields are combined with the associated electromagnetic clouds. This has been formally shown, in a companion paper, to include these asymptotic interactions. It is explicitly demonstrated that the on-shell Green's functions and S-matrix elements describing these charged fields have, to all orders in the coupling, the pole structure associated with particle propagation and scattering. We show in detail that the renormalisation procedure may be carried out straightforwardly. It is shown that standard infra-red finite predictions of QED are not altered and it is speculated that the good infra-red properties of our construction may open the way to the calculation of previously uncalculable properties. Finally extensions of this approach to QCD are briefly discussed.Comment: 34 pages, LaTeX, uses FeynMF, 17 figures, very minor wording change, version to appear in Annals of Physic

Compressed Representations of Conjunctive Query Results

Relational queries, and in particular join queries, often generate large output results when executed over a huge dataset. In such cases, it is often infeasible to store the whole materialized output if we plan to reuse it further down a data processing pipeline. Motivated by this problem, we study the construction of space-efficient compressed representations of the output of conjunctive queries, with the goal of supporting the efficient access of the intermediate compressed result for a given access pattern. In particular, we initiate the study of an important tradeoff: minimizing the space necessary to store the compressed result, versus minimizing the answer time and delay for an access request over the result. Our main contribution is a novel parameterized data structure, which can be tuned to trade off space for answer time. The tradeoff allows us to control the space requirement of the data structure precisely, and depends both on the structure of the query and the access pattern. We show how we can use the data structure in conjunction with query decomposition techniques, in order to efficiently represent the outputs for several classes of conjunctive queries.Comment: To appear in PODS'18; 35 pages; comments welcom

Asymptotic Dynamics in Quantum Field Theory

A crucial element of scattering theory and the LSZ reduction formula is the assumption that the coupling vanishes at large times. This is known not to hold for the theories of the Standard Model and in general such asymptotic dynamics is not well understood. We give a description of asymptotic dynamics in field theories which incorporates the important features of weak convergence and physical boundary conditions. Applications to theories with three and four point interactions are presented and the results are shown to be completely consistent with the results of perturbation theory.Comment: 18 pages, 3 figure

Probing Light Sbottoms with B Decays

We discuss recently reported experimental hints for a bottom squark with mass around 3.5 GeV decaying as sbottom -> charm + lepton + anti-sneutrino. We correlate the sbottom lifetime with the decay rates for bottom -> sbottom + neutrino + anti-sneutrino and bottom -> sbottom + anti-neutrino + sneutrino in the framework of a minimal supersymmetric model extended by right-handed (s)neutrinos. Confronting our results with the well-measured semileptonic branching ratio of B mesons we conclude that the light sbottom interpretation of the experimental anomalies is ruled out, unless m_bottom < m_sbottom + m_sneutrino.Comment: 10 pages, 2 figure

A Trichotomy for Regular Simple Path Queries on Graphs

Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents multiple traversals of the same nodes. Those regular simple path queries (RSPQs) find several applications in practice, yet they quickly become intractable, even for basic languages such as (aa)* or a*ba*. In this paper, we establish a comprehensive classification of regular languages with respect to the complexity of the corresponding regular simple path query problem. More precisely, we identify the fragment that is maximal in the following sense: regular simple path queries can be evaluated in polynomial time for every regular language L that belongs to this fragment and evaluation is NP-complete for languages outside this fragment. We thus fully characterize the frontier between tractability and intractability for RSPQs, and we refine our results to show the following trichotomy: Evaluations of RSPQs is either AC0, NL-complete or NP-complete in data complexity, depending on the regular language L. The fragment identified also admits a simple characterization in terms of regular expressions. Finally, we also discuss the complexity of the following decision problem: decide, given a language L, whether finding a regular simple path for L is tractable. We consider several alternative representations of L: DFAs, NFAs or regular expressions, and prove that this problem is NL-complete for the first representation and PSPACE-complete for the other two. As a conclusion we extend our results from edge-labeled graphs to vertex-labeled graphs and vertex-edge labeled graphs.Comment: 15 pages, conference submissio