Chern-Simons vortices and holography

In this paper, based on the AdS(4)/CFT3 duality, we have explored the precise connection between the abelian Chern-Simons (CS) Higgs model in (2 + 1) dimensions to that with its dual gravitational counterpart living in one higher dimension. It has been observed that theU(1) current computed at the boundary of the AdS(4) could be expressed as the local function of the vortex solution that has the remarkable structural similarity to that with the Ginzburg-Landau (GL) type local expression for the current associated with the Maxwell-CS type vortices in (2 + 1) dimensions. In order to explore this duality a bit further we have also computed the coherence length as well as the magnetic penetration depth associated with these vortices. Finally using the knowledge of both the coherence length as well as the magnetic penetration depth we have computed the Ginzburg-Landau coefficient for the Maxwell-CS type vortices in (2 + 1) dimensions.

The physics of ENSO-monsoon connection

The physical mechanism through which Ei-Nino and Southern Oscillation (ENSO) tends to produce deficient precipitation over Indian continent is investigated using both observations as well as a general circulation model. Both analysis of observations and atmospheric general circulation model (AGCM) study show that the planetary scale response associated with ENSO primarily influences the equatorial Indian Ocean region. Through this interaction it tends to favour the equatorial heat source, enhance precipitation over the equatorial Indian Ocean and indirectly cause a decrease in continental precipitation through induced subsidence. This situation is further complicated by the fact the regional tropospheric quasi biennial oscillation (QBO) has a bimodal structure over this region with large amplitude over the Indian continent. While the ENSO response has a quasi-four year periodicity and tends peak during beginning of the calendar year, the QBO mode tends to peak during northern summer. Thus, the QBO mode exerts a stronger influence on the interannual variability of the monsoon. The strength of the Indian monsoon in a given year depends on the combined effect of the ENSO and the QBO mode. Sines the two oscillations have disparate time scales, exact phase information of the two modes during northern summer is important in determining the Indian summer monsoon. The physical mechanism of the interannual variations of the Indian monsoon precipitation associated with ENSO presented here is similar to the physical process that cause intraseasonal 'active', 'break' oscillations of the monsoon.

The connection between Mueller and Jones matrices of polarization optics

A necessary and sufficient condition for the 4 × 4 Mueller matrix to be derivable from the 2 × 2 Jones matrix is obtained. This condition allows one to determine if a given Mueller matrix describes a totally polarized system or a partially polarized (depolarizing) system. The result of Barakat is analysed in the light of this condition. A recently reported experimentally measured Mueller matrix is examined using this condition and is shown to represent a partially polarized system.

Four-dimensional current algebra from Chern-Simons theory

We study an abelian Chern-Simons theory on a five-dimensional manifold with boundary. We find it to be equivalent to a higher-derivative generalization of the abelian Wess-Zumino-Witten model on the boundary. It contains a U(1) current algebra with an operational extension.

Almost quarter-pinched Kähler metrics and Chern numbers

Given n is an element of Z(+) and epsilon > 0, we prove that there exists delta = delta(epsilon, n) > 0 such that the following holds: If (M(n),g) is a compact Kahler n-manifold whose sectional curvatures K satisfy -1 -delta <= K <= -1/4 and c(I)(M), c(J)(M) are any two Chern numbers of M, then |c(I)(M)/c(J)(M) - c(I)(0)/c(J)(0)| < epsilon, where c(I)(0), c(J)(0) are the corresponding characteristic numbers of a complex hyperbolic space form. It follows that the Mostow-Siu surfaces and the threefolds of Deraux do not admit Kahler metrics with pinching close to 1/4.

Rainbow Connection Number and Radius

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r+2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that, for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (K_{1,n} for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. Hitherto, the only reported upper bound on the rainbow connection number of bridgeless graphs is 4n/5 - 1, where n is order of the graph [Caro et al., 2008]

Influence of Phase Connection and Terminal Conditions on Natural Frequencies of Three-Phase Transformer Windings

With the increasing use of extra high-voltage transmission in power system expansion, the manufacturers of power apparatus and the electric utilities are studying the nature of overvoltages in power systems due to lightning and, in particular, switching operations. For such analyses, knowledge of the natural frequencies of the windings of transformers under a wide variety of conditions is important. The work reported by the author in a previous paper is extended and equivalent circuits have been developed to represent several sets of terminal conditions. These equivalent circuits can be used to determine the natural frequencies and transient voltages in the windings. Comparison of the measured and the computed results obtained with a model transformer indicates that they are in good agreement. Hence, this method of analysis provides a satisfactory procedure for the estimation of natural frequencies and transient voltages in transformer windings.

Rainbow Connection Number and Connectivity

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Supersymmetric Chern-Simons theories with vector matter

In this paper we discuss SU(N) Chern-Simons theories at level k with both fermionic and bosonic vector matter. In particular we present an exact calculation of the free energy of the N = 2 supersymmetric model (with one chiral field) for all values of the `t Hooft coupling in the large N limit. This is done by using a generalization of the standard Hubbard-Stratanovich method because the SUSY model contains higher order polynomial interactions.

Supersymmetry of classical solutions in Chern-Simons higher spin supergravity

We construct and study classical solutions in Chern-Simons supergravity based on the superalgebra sl(N vertical bar N = 1). The algebra for the N = 3 case is written down explicitly using the fact that it arises as the global part of the super conformal W-3 superalgebra. For this case we construct new classical solutions and study their supersymmetry. Using the algebra we write down the Killing spinor equations and explicitly construct the Killing spinor for conical defects and black holes in this theory. We show that for the general sl(N|N - 1) theory the condition for the periodicity of the Killing spinor can be written in terms of the products of the odd roots of the super algebra and the eigenvalues of the holonomy matrix of the background. Thus the supersymmetry of a given background can be stated in terms of gauge invariant and well defined physical observables of the Chern-Simons theory. We then show that for N >= 4, the sl(N|N - 1) theory admits smooth supersymmetric conical defects.

A possible connection between antidiabetic and antilipemic properties of psoralea corylifolia seeds and the trace elements present: a LIBS based study

Psoralea corylifolia (PC), a medicinal plant, is used in traditional medicine to treat diabetes. Purpose of the research was to examine the antidiabetic and antilipemic potential of PC and to determine the relationship between its antidiabetic potential and the trace elements present. Wistar rats (150-200 g) with fasting blood glucose (FBG) of 80-110 mg dl(-1)(sub-diabetic) and 150-200 mg dl(-1)(mild diabetic) were selected for the short term antidiabetic studies and severely diabetic rats (FBG > 300 mg dl(-1)) were chosen for the long term antidiabetic and hypolipemic studies of PC seed extract. Laser induced breakdown spectroscopy (LIBS) was used to detect trace elements in the PC extract and the intensity ratios of trace elements were estimated. The dose of 250 mg kg(-1) of PC extract was found to be the most effective in lowering blood glucose level (BGL) of normal, sub, mild and severely diabetic rats during FBG and glucose tolerance test (GTT) studies. Lipid profile studies on severely diabetic rats showed substantial reduction in total cholesterol, triglycerides, very low density lipoprotein, and low density lipoprotein and an increase in the total protein, body weight, high density lipoprotein, and hemoglobin after 28 days of treatment. Significant reduction in urine sugar and protein levels was also observed. LIBS analysis of the PC extract revealed the presence of Mg, Si, Na, K, Ca, Zn and Cl. The study validates the traditional use of PC in the treatment of diabetes and confirms its antilipemic potential. The antidiabetic activity of PC extract may partly be due to the presence of appreciable amounts of insulin potentiating elements like Mg, Ca, and K.

On the Chern number of I-admissible filtrations of ideals

Let I be an m-primary ideal of a Noetherian local ring (R, m) of positive dimension. The coefficient e(1)(I) of the Hilbert polynomial of an I-admissible filtration I is called the Chern number of I. A formula for the Chern number has been derived involving the Euler characteristic of subcomplexes of a Koszul complex. Specific formulas for the Chern number have been given in local rings of dimension at most two. These have been used to provide new and unified proofs of several results about e(1)(I).

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.