Arithmetically Cohen-Macaulay bundles on complete intersection varieties of sufficiently high multidegree

Recently it has been proved that any arithmetically Cohen-Macaulay (ACM) bundle of rank two on a general, smooth hypersurface of degree at least three and dimension at least four is a sum of line bundles. When the dimension of the hypersurface is three, a similar result is true provided the degree of the hypersurface is at least six. We extend these results to complete intersection subvarieties by proving that any ACM bundle of rank two on a general, smooth complete intersection subvariety of sufficiently high multi-degree and dimension at least four splits. We also obtain partial results in the case of threefolds.

Computing complete test graphs for hierarchical systems

Conformance testing focuses on checking whether an implementation. under test (IUT) behaves according to its specification. Typically, testers are interested it? performing targeted tests that exercise certain features of the IUT This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed. or deviated front the test purpose. In [8] Jeron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper; we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Complete Pick positivity and unitary invariance

The characteristic function for a contraction is a classical complete unitary invariant devised by Sz.-Nagy and Foias. Just as a contraction is related to the Szego kernel k(S) (z, w) = (1 - z (w) over tilde)(-1) for |z|, |w| < 1, by means of (1/k(S))(T,T*) >= 0, we consider an arbitrary open connected domain Omega in C-n, a complete Pick kernel k on Omega and a tuple T = (T-1, ..., T-n) of commuting bounded operators on a complex separable Hilbert space H such that (1/k)(T,T*) >= 0. For a complete Pick kernel the 1/k functional calculus makes sense in a beautiful way. It turns out that the model theory works very well and a characteristic function can be associated with T. Moreover, the characteristic function is then a complete unitary invariant for a suitable class of tuples T.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

The complete primary structure of a unique mannose/glucose-specific lectin from field bean (Dolichos lab lab)

The complete amino acid sequence of two non identical subunits of the glucose/mannose-specific lectin from Dolichos lab lab (field bean) has been determined by sequential Edman analyses of the intact subunits and peptides derived by enzymatic and chemical cleavage. Peptides were purified by reverse phase high performance liquid chromatography and ion pair chromatography. The D. lab lab lectin is a glycoprotein having two polypeptide chains of 132 and 105 amino acid residues. The amino acid sequence of the D. Lab lab lectin is compared with the various lectins of the family Leguminosae. The D. lab lab lectin is the only species of the tribe Phaseoleae that contains two nonidentical subunits of almost equal size and that shows a specificity to glucose/ mannose. The lectin shows a greater homology to the glucose/mannose specific lectins, especially concanavalin A. The unique subunit architecture of the D. lab lab lectin indicates the presence of new post translational cleavage sites.

The existence of homeomorphic subgraphs in chordal graphs

We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to K-n (n greater than or equal to 3), K-m,K-n (m,n greater than or equal to 2), and wheels W-r (r greater than or equal to 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some special classes of pattern graphs.

Synthetic studies directed towards the potent cytotoxic natural product ottelione A: stereoselective construction of the complete framework

A stereoselective strategy for the rapid acquisition of the complete framework (dideoxyottelione A) of the promising cytotoxic agent ottelione A, with four contiguous stereogenic centres on a hydrindane skeleton and a sensitive 4-methylenecyclohex-2-enone functionality, from the readily available Diels-Alder adduct of 1,2,3,4-tetrachloro-5,5-dimethoxycyclopentadiene and norbornadiene, is delineated.

Synthetic studies towards novel terpenic natural products kelsoene and poduran: Construction of the complete 4-5-5-fused tricarbocyclic core

A common synthetic approach to the recently reported sesquiterpene kelsoene 1 and the tetraterpene poduran 5, bearing a novel tricyclo[6.2.0.0(2,6)]decane framework, from commercially available 1,5-COD and leading to the first construction of the carbocyclic core present in these natural products is delineated.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

Complete 'melting' of charge order in hydrothermally grown Pr0.57Ca0.41Ba0.02MnO3 nanowires

Nanowires of Pr0.57Ca0.41Ba0.02MnO3 (PCBM) (diameter similar to 80-90 nm and length similar to 3.5 mu m) were synthesized by a low reaction temperature hydrothermal method. Single-phase nature of the sample was confirmed by XRD experiments. Scanning electron microscopy (SEM) and transmission electron microscopy (TEM) were used to characterize the morphology and microstructures of the nanowires. While the bulk PCBM is known to exhibit charge order (CO) below 230 K along with a ferromagnetic transition at 110 K, SQUID measurements on the nanowires of PCBM show that the charge order is completely absent and a ferromagnetic transition occurs at 115 K. However, the magnetization in the nanowires is observed to be less compared to that in the bulk. This observation of the complete 'melting' of the charge order in the PCBM nanowires is particularly significant in view of the observation of only a weakening of the CO in the nanowires of Pr0.5Ca0.5MnO3. Electron paramagnetic resonance experiments were also carried out on the PCBM nanowires using an X-band EPR spectrometer. Characteristic differences were observed in the line width of nanowires when compared with that of the bulk.

Selective double quantum resolved correlation experiment for the complete separation of entire proton NMR spectra of enantiomers

The present study reports a two dimensional NMR experiment which separates single quantum spectra of enantiomers from that of a racemic mixture. This is a blend of selective double quantum refocusing, for resolving couplings and chemical shift interactions along two dimensions followed by correlation of the selectively excited protons to the entire coupled spin network. The concept is solely based on the presence of distinct intra methyl dipolar couplings of different enantiomers when dissolved in chiral orienting media. The analysis of single enantiomer spectrum obtained from respective F-2 cross sections yield all the spectral information. (C) 2011 Elsevier Inc. All rights reserved.

A Unique Modification of the Eukaryotic Initiation Factor 5A Shows the Presence of the Complete Hypusine Pathway in Leishmania donovani

Deoxyhypusine hydroxylase (DOHH) catalyzes the final step in the post-translational synthesis of an unusual amino acid hypusine (N-(sic)-(4-amino-2-hydroxybutyl) lysine), which is present on only one cellular protein, eukaryotic initiation factor 5A (eIF5A). We present here the molecular and structural basis of the function of DOHH from the protozoan parasite, Leishmania donovani, which causes visceral leishmaniasis. The L. donovani DOHH gene is 981 bp and encodes a putative polypeptide of 326 amino acids. DOHH is a HEAT-repeat protein with eight tandem repeats of alpha-helical pairs. Four conserved histidine-glutamate sequences have been identified that may act as metal coordination sites. A similar to 42 kDa recombinant protein with a His-tag was obtained by heterologous expression of DOHH in Escherichia coli. Purified recombinant DOHH effectively catalyzed the hydroxylation of the intermediate, eIF5A-deoxyhypusine (eIF5A-Dhp), in vitro. L. donovani DOHH (LdDOHH) showed similar to 40.6% sequence identity with its human homolog. The alignment of L. donovani DOHH with the human homolog shows that there are two significant insertions in the former, corresponding to the alignment positions 159-162 (four amino acid residues) and 174-183 (ten amino acid residues) which are present in the variable loop connecting the N- and C-terminal halves of the protein, the latter being present near the substrate binding site. Deletion of the ten-amino-acid-long insertion decreased LdDOHH activity to 14% of the wild type recombinant LdDOHH. Metal chelators like ciclopirox olamine (CPX) and mimosine significantly inhibited the growth of L. donovani and DOHH activity in vitro. These inhibitors were more effective against the parasite enzyme than the human enzyme. This report, for the first time, confirms the presence of a complete hypusine pathway in a kinetoplastid unlike eubacteria and archaea. The structural differences between the L. donovani DOHH and the human homolog may be exploited for structure based design of selective inhibitors against the parasite.

Border basis detection is NP-complete

Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.