We investigate the nature of transition rates for the hadronization process of qq̄ → πππ as opposed to the transition rates for qq̄ → ππ, within the Nambu–Jona-Lasinio model that has manifest chiral symmetry. Feynman diagrams appropriate to this process can be classified according to the expansion in the inverse number of colors 1/Nc. Two of these types of graphs are seen to be either “s-like” or...

Abstract An extension is proposed to the internal symmetry transformations associated with mass, entropy and other Clebsch-related conservation in geophysical fluid dynamics. Those were previously parameterized an arbitrary function  of materi...

In this paper we show how tools from group theory can be used to find invariants for time-changing illumination changes. In the first part of the paper we give a brief overview over the theory of one-parameter groups and their invariants. In the second part we describe how the chromaticity coordinates of time-changing illumination spectra can be described by one-parameter curves. Examples for b...

Techniques were developed by which an Algol-like program, given together with its specifications, may be documented automatically. This documentation expresses invariant relationships that hold between program variables at intermediate points in the program, and explains the actual workings of the program regardless of whether the program is correct. These techniques, formulated as deduction ru...

The Generic Diamond Lemma of the author is applied to the problem of classifying all graph invariants satisfying a contract–delete recursion (like that of the chromatic polynomial). As expected, the recursion for the Tutte polynomial is found, along with some more degenerate invariants. The purpose of this exercise is to demonstrate techniques for applying the diamond lemma to diagrammatic calc...

In this note we formalize a multithreaded Java-like programming language with unchecked exceptions, try-catch blocks, and synchronized blocks, as well as method contracts, object invariants, block invariants, thread-local objects, and parallel execution statements. We further formalize our verification condition generation-based modular static verification approach that verifies that the progra...

Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes of some equational theory. For instance, a sorted list is a particular representative wrt commutativity. Theories like associativity, neutral element, idempotence, etc. are also very common. Now, when one wants to comb...

Geometry and in particular projective geometry (and its corresponding invariant theory) deals a lot with structural properties of geometric objects and their interrelations. This papers describes how concepts of tensor calculus can be used to express geometric invariants and how, in particular, diagrammatic notations can be used to deal with invariants in a highly intuitive way. In particular w...

By using finite support iteration of Suslin c.c.c forcing notions we construct several models which satisfy some ♦-like principles while other cardinal invariants are

We suggest a construction of Tanaka-Thomas's Vafa-Witten invariants for étale gerbes over smooth projective surface using the moduli space μr-gerbe twisted sheaves and Higgs sheaves. Twisted their are naturally used to study period-index theorem corresponding in Brauer group surface. Deformation obstruction theory behave like general define virtual fundamental class localization Behrend functio...