Superconformal transformations of theN = 2,D = 4, SSYM

We obtain the superconformal transformation laws for theN=2,D=4 SSYM. The transformations involve Yang-Mills fields and the corresponding field strength tensor is not constrained to be self antidual. We explicitly demonstrate the closure of the superconformal algebra.

Embedding Of Non-Simple Lie-Groups, Coupling-Constant Relations And Non-Uniqueness Of Models Of Unification

A general derivation of the coupling constant relations which result on embedding a non-simple group like SU L (2) @ U(1) in a larger simple group (or graded Lie group) is given. It is shown that such relations depend only on the requirement (i) that the multiplet of vector fields form an irreducible representation of the unifying algebra and (ii) the transformation properties of the fermions under SU L (2). This point is illustrated in two ways, one by constructing two different unification groups containing the same fermions and therefore have same Weinberg angle; the other by putting different SU L (2) structures on the same fermions and consequently have different Weinberg angles. In particular the value sin~0=3/8 is characteristic of the sequential doublet models or models which invoke a large number of additional leptons like E 6, while addition of extra charged fermion singlets can reduce the value of sin ~ 0 to 1/4. We point out that at the present time the models of grand unification are far from unique.

Functional programming systems revisited

Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic and nondeterministic programs can be verified essentially within the system. It is shown that the algebra of NFP programs has simpler laws in comparison with the algebra of FP programs. "Regular" forms are introduced to put forward a disciplined way of reasoning about programs. Finally, an alternative definition of "linear" forms is proposed for reasoning about recursively defined programs. This definition, when used to test the linearity of forms, results in simpler verification conditions than those generated by the original definition of linear forms.

Spinorial relativistic rotator: The transformation from quasi-Newtonian to Minkowski coordinates

There exists a remarkably close relationship between the operator algebra of the Dirac equation and the corresponding operators of the spinorial relativistic rotator (an indecomposable object lying on a mass-spin Regge trajectory). The analog of the Foldy-Wouthuysen transformation (more generally, the transformation between quasi-Newtonian and Minkowski coordinates) is constructed and explicit results are discussed for the spin and position operators. Zitterbewegung is shown to exist for a system having only positive energies.

Geometrical interpretation of Inönü-Wigner contractions

The Inönü-Wigner contractions which interrelate the Lie algebras of the isometry groups of metric spaces are discussed with reference to deformations of the absolutes of the spaces. A general formula is derived for the Lie algebra commutation relations of the isometry group for anyN-dimensional metric space. These ideas are illustrated by a discussion of important particular cases, which interrelate the four-dimensional de Sitter, Poincaré, and Galilean groups.

Use of Multiblade Coordinates for Helicopter Flap-Lag Stability with Dynamic Inflow

Rotor flap-lag stability in forward flight is studied with and without dynamic inflow feedback via a multiblade coordinate transformation (MCT). The algebra of MCT is found to be so involved that it requires checking the final equations by independent means. Accordingly, an assessment of three derivation methods is given. Numerical results are presented for three- and four-bladed rotors up to an advance ratio of 0.5. While the constant-coefficient approximation under trimmed conditions is satisfactory for low-frequency modes, it is not satisfactory for high-frequency modes or for untrimmed conditions. The advantages of multiblade coordinates are pronounced when the blades are coupled by dynamic inflow.

Multipliers of Sobolev spaces

Let Wm,p denote the Sobolev space of functions on Image n whose distributional derivatives of order up to m lie in Lp(Image n) for 1 less-than-or-equals, slant p less-than-or-equals, slant ∞. When 1 < p < ∞, it is known that the multipliers on Wm,p are the same as those on Lp. This result is true for p = 1 only if n = 1. For, we prove that the integrable distributions of order less-than-or-equals, slant1 whose first order derivatives are also integrable of order less-than-or-equals, slant1, belong to the class of multipliers on Wm,1 and there are such distributions which are not bounded measures. These distributions are also multipliers on Lp, for 1 < p < ∞. Moreover, they form exactly the multiplier space of a certain Segal algebra. We have also proved that the multipliers on Wm,l are necessarily integrable distributions of order less-than-or-equals, slant1 or less-than-or-equals, slant2 accordingly as m is odd or even. We have obtained the multipliers from L1(Image n) into Wm,p, 1 less-than-or-equals, slant p less-than-or-equals, slant ∞, and the multiplier space of Wm,1 is realised as a dual space of certain continuous functions on Image n which vanish at infinity.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Generalised quaternion methods in conformal geometry

A new approach to Penrose's twistor algebra is given. It is based on the use of a generalised quaternion algebra for the translation of statements in projective five-space into equivalent statements in twistor (conformal spinor) space. The formalism leads toSO(4, 2)-covariant formulations of the Pauli-Kofink and Fierz relations among Dirac bilinears, and generalisations of these relations.

Evolution of Social Behavior Through Interpopulation Selection

Under certain special conditions natural selection can be effective at the level of local populations, or demes. Such interpopulation selection will favor genotypes that reduce the probability of extinction of their parent population even at the cost of a lowered inclusive fitness. Such genotypes may be characterized by altruistic traits only in a viscous population, i.e., in a population in which neighbors tend to be closely related. In a non-viscous population the interpopulation selection will instead favor spiteful traits when the populations are susceptible to extinction through the overutilization of the habitat, and cooperative traits when it is the newly established populations that are in the greatest danger of extinction.

Construction of inverses with prescribed zero minors and applications to decentralized stabilization

We examine the following question: Suppose R is a principal ideal domain, and that F is an n × m matrix with elements in R, with n>m. When does there exist an m × n matrix G such that GF = Im, and such that certain prescribed minors of G equal zero? We show that there is a simple necessary condition for the existence of such a G, but that this condition is not sufficient in general. However, if the set of minors of G that are required to be zero has a certain pattern, then the condition is necessary as well as sufficient. We then show that the pattern mentioned above arises naturally in connection with the question of the existence of decentralized stabilizing controllers for a given plant. Hence our result allows us to derive an extremely simple proof of the fact that a necessary and sufficient condition for the existence of decentralized stabilizing controllers is the absence of unstable decentralized fixed modes, as well as to derive a very clean expression for these fixed modes. In addition to the application to decentralized stabilization, we believe that the result is of independent interest.

The Noether-Lefschetz theorem for the divisor class group

Let X be a normal projective threefold over a field of characteristic zero and vertical bar L vertical bar be a base-point free, ample linear system on X. Under suitable hypotheses on (X, vertical bar L vertical bar), we prove that for a very general member Y is an element of vertical bar L vertical bar, the restriction map on divisor class groups Cl(X) -> Cl(Y) is an isomorphism. In particular, we are able to recover the classical Noether-Lefschetz theorem, that a very general hypersurface X subset of P-C(3) of degree >= 4 has Pic(X) congruent to Z.

Algebraic Cryptanalysis of CTRU Cryptosystem

CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$ . It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU. In this paper we presents a polynomial-time algorithm that breaks CTRU for all recommended parameter choices that were derived to make CTRU secure against popov normal form attack. The paper shows if we ascertain the constraints for perfect decryption then either plaintext or private key can be achieved by polynomial time linear algebra attack.

Boson-fermion duality in SU(m vertical bar n) supersymmetric Haldane-Shastry spin chain

By using the Y(gl(m|n)) super Yangian symmetry of the SU(m|n) supersymmetric Haldane-Shastry spin chain, we show that the partition function of this model satisfies a duality relation under the exchange of bosonic and fermionic spin degrees of freedom. As a byproduct of this study of the duality relation, we find a novel combinatorial formula for the super Schur polynomials associated with some irreducible representations of the Y(gl(m|n)) Yangian algebra. Finally, we reveal an intimate connection between the global SU(m|n) symmetry of a spin chain and the boson-fermion duality relation. (C) 2007 Elsevier B.V. All rights reserved.

Giant magnons in the D1-D5 system

We study giant magnons in the the D1-D5 system from both the boundary CFT and as classical solutions of the string sigma model in AdS(3) x S-3 x T-4. Re-examining earlier studies of the symmetric product conformal field theory we argue that giant magnons in the symmetric product are BPS states in a centrally extended SU(1 vertical bar 1) x SU(1 vertical bar 1) superalgebra with two more additional central charges. The magnons carry these additional central charges locally but globally they vanish. Using a spin chain description of these magnons and the extended superalgebra we show that these magnons obey a dispersion relation which is periodic in momentum. We then identify these states on the string theory side and show that here too they are BPS in the same centrally extended algebra and obey the same dispersion relation which is periodic in momentum. This dispersion relation arises as the BPS condition for the extended algebra and is similar to that of magnons in N = 4 Yang-Mills Yang-Mills.