On p-form theories with gauge invariant second order field equations

We explore field theories of a single p-form with equations of motions of order strictly equal to two and gauge invariance. We give a general method for the classification of such theories which are extensions to the p-forms of the Galileon models for scalars. Our classification scheme allows to compute an upper bound on the number of different such theories depending on p and on the space-time dimension. We are also able to build a non trivial Galileon like theory for a 3-form with gauge invariance and an action which is polynomial into the derivatives of the form. This theory has gauge invariant field equations but an action which is not, like a Chern-Simons theory. Hence the recently discovered no-go theorem stating that there are no non trivial gauge invariant vector Galileons (which we are also able here to confirm with our method) does not extend to other odd p cases.Comment: 29 page

Genuine phrase-based statistical machine translation with supervision

This thesis addresses mainly two issues that have not been addressed in Statis-tical Machine Translation. One issue is that even though research has been evolving from word-based approaches to phrase-based ones, because words were consistently found to be inappropriate translation units, the fact is that words are still considered in the composition of phrases, either to determine translation equivalents or to check language fluency. Such consideration might result in the attempt of establishing relations between words within a phrase translation equivalent even when sometimes its phrases should be considered as a whole. Attempts to further partition such phrases would produce incorrect translation units that would introduce unwanted noise in the translation pro-cess. Besides, the internal fluency of an identified multi-word phrase should not require checking. As such, phrases should indeed be considered units, avoiding incorrect translation equivalents that might be identified from their partition, as well as only considering the fluency of a phrase with other phrases and not within the phrase itself. The other issue is that supervision, in the form of trans-lation lexica, is generally overlooked, with SMT research focusing mainly on the identification of translation units without any human intervention and without considering already known translation units. As such, no importance has been attributed to the inclusion of verified lexica, with only some rarely used dic-tionaries to score translation candidates and not really as a source of translation units. Indeed, translation equivalents should be memorized, checked and used as a source of translation units, avoiding the need to keep identifying the same translation units, in particular if those are frequently used. This Thesis presents a truly Phrase-Based approach to SMT, using contiguous and non-contiguous phrases, along with Supervision, in which phrases are not divided and verified lexica is built, kept and used to propose translations of complete sentences

Building Blocks for Mapping Services

Mapping services are ubiquitous on the Internet. These services enjoy a considerable user base. But it is often overlooked that providing a service on a global scale with virtually millions of users has been the playground of an oligopoly of a select few service providers are able to do so. Unfortunately, the literature on these solutions is more than scarce. This thesis adds a number of building blocks to the literature that explain how to design and implement a number of features

Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors

Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= {(),?} called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? ~a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.G. Spencer Brown; boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; C.S. Peirce; existential graphs.

Tensor lattice field theory with applications to the renormalization group and quantum computing

We discuss the successes and limitations of statistical sampling for a sequence of models studied in the context of lattice QCD and emphasize the need for new methods to deal with finite-density and real-time evolution. We show that these lattice models can be reformulated using tensorial methods where the field integrations in the path-integral formalism are replaced by discrete sums. These formulations involve various types of duality and provide exact coarse-graining formulas which can be combined with truncations to obtain practical implementations of the Wilson renormalization group program. Tensor reformulations are naturally discrete and provide manageable transfer matrices. Combining truncations with the time continuum limit, we derive Hamiltonians suitable to perform quantum simulation experiments, for instance using cold atoms, or to be programmed on existing quantum computers. We review recent progress concerning the tensor field theory treatment of non-compact scalar models, supersymmetric models, economical four-dimensional algorithms, noise-robust enforcement of Gauss's law, symmetry preserving truncations and topological considerations. We discuss connections with other tensor network approaches.Comment: Review article, 71 pages, 47 figures, connections to other tensor network approaches and references adde

Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives

Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting, indifferently, the presence or absence of () into a PA formula yields a BA formula. The BA axioms are A1: ()()= (), and A2: “(()) [abbreviated ‘⊥’] may be written or erased at will,” implying (⊥)=(). The repeated application of A1 and A2 simplifies any PA formula to either () or ⊥. The basis for BA is B1: abc=bca (concatenation commutes & associates); B2, ⊥a=a (BA has a lower bound, ⊥); B3, (a)a=() (BA is a complemented lattice); and B4, (ba)a=(b)a (implies that BA is a distributive lattice). BA has two intended models: (1) the Boolean algebra 2 with base set B={(),⊥}, such that () ⇔ 1 [dually 0], (a) ⇔ a′, and ab ⇔ a∪b [a∩b]; and (2) sentential logic, such that () ⇔ true [false], (a) ⇔ ~a, and ab ⇔ a∨b [a∧b]. BA is a self-dual notation, facilitates a calculational style of proof, and simplifies clausal reasoning and Quine’s truth value analysis. BA resembles C.S. Peirce’s graphical logic, the symbolic logics of Leibniz and W.E. Johnson, the 2 notation of Byrne (1946), and the Boolean term schemata of Quine (1982).Boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; G. Spencer-Brown; C.S. Peirce; existential graphs