Resolution of Singularities for a Class of Hilbert Modules

Let M be the completion of the polynomial ring C(z) under bar] with respect to some inner product, and for any ideal I subset of C (z) under bar], let I] be the closure of I in M. For a homogeneous ideal I, the joint kernel of the submodule I] subset of M is shown, after imposing some mild conditions on M, to be the linear span of the set of vectors {p(i)(partial derivative/partial derivative(w) over bar (1),...,partial derivative/partial derivative(w) over bar (m)) K-I] (., w)vertical bar(w=0), 1 <= i <= t}, where K-I] is the reproducing kernel for the submodule 2] and p(1),..., p(t) is some minimal ``canonical set of generators'' for the ideal I. The proof includes an algorithm for constructing this canonical set of generators, which is determined uniquely modulo linear relations, for homogeneous ideals. A short proof of the ``Rigidity Theorem'' using the sheaf model for Hilbert modules over polynomial rings is given. We describe, via the monoidal transformation, the construction of a Hermitian holomorphic line bundle for a large class of Hilbert modules of the form I]. We show that the curvature, or even its restriction to the exceptional set, of this line bundle is an invariant for the unitary equivalence class of I]. Several examples are given to illustrate the explicit computation of these invariants.

Matrix-Assisted Refolding, Purification and Activity Assessment Using a `Form Invariant' Assay for Matrix Metalloproteinase 2 (MMP2)

Matrix metalloproteinases expression is used as biomarker for various cancers and associated malignancies. Since these proteinases can cleave many intracellular proteins, overexpression tends to be toxic; hence, a challenge to purify them. To overcome these limitations, we designed a protocol where full length pro-MMP2 enzyme was overexpressed in E. coli as inclusion bodies and purified using 6xHis affinity chromatography under denaturing conditions. In one step, the enzyme was purified and refolded directly on the affinity matrix under redox conditions to obtain a bioactive protein. The pro-MMP2 protein was characterized by mass spectrometry, CD spectroscopy, zymography and activity analysis using a simple in-house developed `form invariant' assay, which reports the total MMP2 activity independent of its various forms. The methodology yielded higher yields of bioactive protein compared to other strategies reported till date, and we anticipate that using the protocol, other toxic proteins can also be overexpressed and purified from E. coli and subsequently refolded into active form using a one step renaturation protocol.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

A measurement of the proton elastic form factors for 1 ≤ Q^2 ≤ 3 (GeV/c)^2

We report measurements of the proton form factors, G^p_E and G^p_M, extracted from elastic electron scattering in the range 1 ≤ Q^2 ≤ 3 (GeV/c)^2 with uncertainties of <15% in G^p_E and <3% in G^p_M. The results for G^p_E are somewhat larger than indicated by most theoretical parameterizations. The ratio of Pauli and Dirac form factors, Q^2(F^p_2/F^p_1), is lower in value and demonstrates less Q^2 dependence than these parameterizations have indicated. Comparisons are made to theoretical models, including those based on perturbative QCD, vector-meson dominance, QCD sum rules, and diquark constituents to the proton. A global extraction of the form factors, including previous elastic scattering measurements, is also presented.

Matrices whose hermitian part is positive definite

We are concerned with the class ∏_n of nxn complex matrices A for which the Hermitian part H(A) = A+A*/2 is positive definite.

Various connections are established with other classes such as the stable, D-stable and dominant diagonal matrices. For instance it is proved that if there exist positive diagonal matrices D, E such that DAE is either row dominant or column dominant and has positive diagonal entries, then there is a positive diagonal F such that FA ϵ ∏_n.

Powers are investigated and it is found that the only matrices A for which A^m ϵ ∏_n for all integers m are the Hermitian elements of ∏_n. Products and sums are considered and criteria are developed for AB to be in ∏_n.

Since ∏_n n is closed under inversion, relations between H(A)^-1 and H(A^-1) are studied and a dichotomy observed between the real and complex cases. In the real case more can be said and the initial result is that for A ϵ ∏_n, the difference H(adjA) - adjH(A) ≥ 0 always and is ˃ 0 if and only if S(A) = A-A*/2 has more than one pair of conjugate non-zero characteristic roots. This is refined to characterize real c for which cH(A^-1) - H(A)^-1 is positive definite.

The cramped (characteristic roots on an arc of less than 180°) unitary matrices are linked to ∏_n and characterized in several ways via products of the form A ^-1A*.

Classical inequalities for Hermitian positive definite matrices are studied in ∏_n and for Hadamard's inequality two types of generalizations are given. In the first a large subclass of ∏_n in which the precise statement of Hadamardis inequality holds is isolated while in another large subclass its reverse is shown to hold. In the second Hadamard's inequality is weakened in such a way that it holds throughout ∏_n. Both approaches contain the original Hadamard inequality as a special case.

Recueil de pièces originales, copies et gravures, formé par GAIGNIÈRES sur les duels et les combats. I Gravures allemandes représentant des duels (fol. 6), tournois et combats, signées « L. C. 1506 » [Lucas de Cranach] (fol. 8), « L. C. 1509 » (fol. 44 et suiv.) en triple exemplaire, et 71). [Cf. Bartsch, Le peintre-graveur, nos 124, 125, 126.] — Gravure de [Jacques Androuet-Ducerceau], avec légende, représentant Le chien de Montargis ou « Le combat d'un chien contre un gentilhomme qui avoit tué son maistre » (fol. 10).

Cartel, en italien, de Cagnino di Gonzaga à Cesare Fregoso. Bozolo,31 juillet 1539 (fol. 112), orig. imprimé, avec le sceau de Gonzaga. — Extraits des Mémoires de Sully (fol. 14). — Duels de Jean de Harcourt et Guillaume III de Tancarville, 1286 (fol. 20), — Raymond du Marcadil de Penne en Agenois et Étienne Donnadieu, 1330 (fol. 24), — M. de Sauvebeuf et Peyrot de Rastinhac, 1587 (fol. 26), — baron de Conros et Carbonat (fol. 29), — Louis de Loudierche, de Grizol et de Cheyladet, 1612 (fol 31, 59), — MM. de Candale et de Schomberg (fol. 36), — combat de la Barrière, 1605 (fol. 37). — Édit de Henri IV défendant les duels (fol. 39). — Accords faits par le connétable, les maréchaux de France et les lieutenants généraux des provinces entre MM. de Clermont et de S. Gery d'Avignon (fol. 50), — de Reilhac et de Drageac (fol. 53), — le duc de Nevers et M. de Montpensier, 1580 (fol. 55), — de Brezolles et de Carluz de Calvimond, 1610 (fol. 57), — de Naves et de Montaignac, 1613 (fol. 61), — le comte de Sault et M. de Brissac, 1638 (fol. 62). — Extraits du « stylus antiquus Parlamenti Parisiensis Caroli Molinoei », éd. 1558 (fol. 66, 72, 74, 156), — du « Coustumier de Normendie », éd. 1539 (fol. 76). — Duels de Jacques Le Gris et Jean de Carouges, 1387 (fol. 84) et autres duels extraits de Froissart (fol. 99 et suiv.). — Lettre orig. de Gaucher de Dinteville à Mgr le Dauphin [Henri II], Venise, 20 décembre 1538 (fol. 142). — « Les Cartelz, reponces et procès-verbaux du different d'entre le sieur de Vassé et le comte Guillaume de Furstenberg, 1540 (fol. 144).

Group-invariant solutions of semilinear Schrodinger equations in multi-dimensions

Symmetry group methods are applied to obtain all explicit group-invariant radial solutions to a class of semilinear Schr¨odinger equations in dimensions n = 1. Both focusing and defocusing cases of a power nonlinearity are considered, including the special case of the pseudo-conformal power p = 4/n relevant for critical dynamics. The methods involve, first, reduction of the Schr¨odinger equations to group-invariant semilinear complex 2nd order ordinary differential equations (ODEs) with respect to an optimal set of one-dimensional point symmetry groups, and second, use of inherited symmetries, hidden symmetries, and conditional symmetries to solve each ODE by quadratures. Through Noether’s theorem, all conservation laws arising from these point symmetry groups are listed. Some group-invariant solutions are found to exist for values of n other than just positive integers, and in such cases an alternative two-dimensional form of the Schr¨odinger equations involving an extra modulation term with a parameter m = 2−n = 0 is discussed.

Form-invariant bivariate weighted models

In this paper the class of continuous bivariate distributions that has form-invariant weighted distribution with weight function w(x1, x2) ¼ xa1 1 xa2 2 is identified. It is shown that the class includes some well known bivariate models. Bayesian inference on the parameters of the class is considered and it is shown that there exist natural conjugate priors for the parameters

The four major N- and C-terminal splice variants of the excitatory amino acid transporter GLT-1 form cell surface homomeric and heteromeric assemblies

The L-glutamate transporter GLT-1 is an abundant CNS membrane protein of the excitatory amino acid transporter (EAAT) family which controls extracellular L-glutamate levels and is important in limiting excitotoxic neuronal death. Using RT-PCR, we have determined that four mRNAs encoding GLT-1 exist in mouse brain, with the potential to encode four GLT-1 isoforms that differ in their N- and C-termini. We expressed all four isoforms (termed MAST-KREK, MPK-KREK, MAST-DIETCI and MPK-DIETCI according to amino acid sequence) in a range of cell lines and primary astrocytes and show that each isoform can reach the cell surface. In transfected HEK-293 or COS-7 cells, all four isoforms support high-affinity sodium-dependent L-glutamate uptake with identical pharmacological and kinetic properties. Inserting a viral epitope (V5, HA or FLAG) into the second extracellular domain of each isoform allowed co-immunoprecipitation and tr-FRET studies using transfected HEK-293 cells. Here we show for the first time that each of the four isoforms are able to combine to form homomeric and heteromeric assemblies, each of which are expressed at the cell surface of primary astrocytes. After activation of protein kinase C by phorbol ester, V5-tagged GLT-1 is rapidly removed from the cell surface of HEK-293 cells and degraded. This study provides direct biochemical evidence for oligomeric assembly of GLT-1 and reports the development of novel tools to provide insight into the trafficking of GLT-1.

Tridiagonal canonical matrices of bilinear or sesquilinear forms and of pairs of symmetric, skew-symmetric, or Hermitian forms

Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field of characteristic different from 2. (C) 2008 Elsevier Inc. All rights reserved.

An algebraic q-deformed form for shape-invariant systems

A quantum deformed theory applicable to all shape-invariant bound-state systems is introduced by defining q-deformed ladder operators. We show that these new ladder operators satisfy new q-deformed commutation relations. In this context we construct an alternative q-deformed model that preserves the shape-invariance property presented by the primary system. q-deformed generalizations of Morse, Scarf and Coulomb potentials are given as examples.

Conformally and gauge invariant spin-2 field equations

Using an approach based on the Casimir operators of the de Sitter group, conformally invariant equations for a fundamental spin-2 field are obtained, and their consistency is discussed. It is shown that only when the spin-2 field is interpreted as a 1-form assuming values in the Lie algebra of the translation group, rather than a symmetric second-rank tensor, the field equation is both conformally and gauge invariant. © 2013 Pleiades Publishing, Ltd.

Characterization of the phosphatidylinositol-specific phospholipase C-released form of rat osseous plate alkaline phosphatase and its possible significance on endochondral ossification

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)