Superconformal Ward Identities and their Solution

Superconformal Ward identities are derived for the the four point functions of chiral primary BPS operators for $\N=2,4$ superconformal symmetry in four dimensions. Manipulations of arbitrary tensorial fields are simplified by introducing a null vector so that the four point functions depend on two internal $R$-symmetry invariants as well as two conformal invariants. The solutions of these identities are interpreted in terms of the operator product expansion and are shown to accommodate long supermultiplets with free scale dimensions and also short and semi-short multiplets with protected dimensions. The decomposition into $R$-symmetry representations is achieved by an expansion in terms of two variable harmonic polynomials which can be expressed also in terms of Legendre polynomials. Crossing symmetry conditions on the four point functions are also discussed.Comment: 73 pages, plain Tex, uses harvmac, version 2, extra reference

Automated Verification of Design Patterns with LePUS3

Specification and [visual] modelling languages are expected to combine strong abstraction mechanisms with rigour, scalability, and parsimony. LePUS3 is a visual, object-oriented design description language axiomatized in a decidable subset of the first-order predicate logic. We demonstrate how LePUS3 is used to formally specify a structural design pattern and prove (‗verify‘) whether any JavaTM 1.4 program satisfies that specification. We also show how LePUS3 specifications (charts) are composed and how they are verified fully automatically in the Two-Tier Programming Toolkit

Unstable particle's wave-function renormalization prescription

We strictly define two set Wave-function Renormalization Constants (WRC) under the LSZ reduction formula for unstable particles at the first time. Then by introducing antiparticle's WRC and the CPT conservation law we obtain a new wave-function renormalization condition which can be used to totally determine the two set WRC. We calculate two physical processes to manifest the consistence of the present wave-function renormalization prescription with the gauge theory in standard model. We also prove that the conventional wave-function renormalization prescription which discards the imaginary part of unstable particle's WRC leads to physical amplitude gauge dependent.Comment: 10 pages, 3 figure

Superconformal Symmetry, Correlation Functions and the Operator Product Expansion

Superconformal transformations are derived for the $\N=2,4 supermultiplets corresponding to the simplest chiral primary operators. These are applied to two, three and four point correlation functions. When$\N=4$, results are obtained for the three point function of various descendant operators, including the energy momentum tensor and SU(4) current. For both$\N=2$ or 4 superconformal identities are derived for the functions of the two conformal invariants appearing in the four point function for the chiral primary operator. These are solved in terms of a single arbitrary function of the two conformal invariants and one or three single variable functions. The results are applied to the operator product expansion using the exact formula for the contribution of an operator in the operator product expansion in four dimensions to a scalar four point function. Explicit expressions representing exactly the contribution of both long and possible short supermultiplets to the chiral primary four point function are obtained. These are applied to give the leading perturbative and large N corrections to the scale dimensions of long supermultiplets.Comment: 75 pages, plain TeX file using harvmac; revised version, minor corrections and extra referenc

Constructing Gravity Amplitudes from Real Soft and Collinear Factorisation

Soft and collinear factorisations can be used to construct expressions for amplitudes in theories of gravity. We generalise the "half-soft" functions used previously to "soft-lifting" functions and use these to generate tree and one-loop amplitudes. In particular we construct expressions for MHV tree amplitudes and the rational terms in one-loop amplitudes in the specific context of N=4 supergravity. To completely determine the rational terms collinear factorisation must also be used. The rational terms for N=4 have a remarkable diagrammatic interpretation as arising from algebraic link diagrams.Comment: 18 pages, axodraw, Proof of eq. 4.3 adde

Risk Management Of Shanghai Enterprises With Financial Derivatives

Using a survey, this paper examines the practices of risk management using financial derivatives by enterprises in Shanghai. It is found that the use of financial derivatives by Shanghai enterprises is still at its infancy stage. Many enterprises focus on only one or two types of derivatives for managing their business risks. This may be attributed both to the government regulations against speculation and the underdevelopment of the derivative markets in China.

Experiments to investigate particulate materials in reduced gravity fields

Study investigates agglomeration and macroscopic behavior in reduced gravity fields of particles of known properties by measuring and correlating thermal and acoustical properties of particulate materials. Experiment evaluations provide a basis for a particle behavior theory and measure bulk properties of particulate materials in reduced gravity

On Approximating the Number of kk-cliques in Sublinear Time

We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let $n$ denote the number of vertices in the graph, $m$ the number of edges, and $C_k$ the number of $k$-cliques. We design an algorithm that outputs a $(1+\varepsilon)$-approximation (with high probability) for $C_k$, whose expected query complexity and running time are O\left(\frac{n}{C_k^{1/k}}+\frac{m^{k/2}}{C_k}\right)\poly(\log n,1/\varepsilon,k). Hence, the complexity of the algorithm is sublinear in the size of the graph for $C_k = \omega(m^{k/2-1})$. Furthermore, we prove a lower bound showing that the query complexity of our algorithm is essentially optimal (up to the dependence on $\log n$, $1/\varepsilon$ and $k$). The previous results in this vein are by Feige (SICOMP 06) and by Goldreich and Ron (RSA 08) for edge counting ($k=2$) and by Eden et al. (FOCS 2015) for triangle counting ($k=3$). Our result matches the complexities of these results. The previous result by Eden et al. hinges on a certain amortization technique that works only for triangle counting, and does not generalize for larger cliques. We obtain a general algorithm that works for any $k\geq 3$ by designing a procedure that samples each $k$-clique incident to a given set $S$ of vertices with approximately equal probability. The primary difficulty is in finding cliques incident to purely high-degree vertices, since random sampling within neighbors has a low success probability. This is achieved by an algorithm that samples uniform random high degree vertices and a careful tradeoff between estimating cliques incident purely to high-degree vertices and those that include a low-degree vertex