Superized Troesch complexes and cohomology for strict polynomial superfunctors

We adapt a construction due to Troesch to the category of strict polynomial superfunctors in order to construct complexes of injective objects whose cohomology is isomorphic to Frobenius twists of the (super)symmetric power functors. We apply these complexes to construct injective resolutions of the even and odd Frobenius twist functors, to investigate the structure of the Yoneda algebra of the Frobenius twist functor, and to compute other extension groups between strict polynomial superfunctors. By an equivalence of categories, this also provides cohomology calculations in the category of left modules over Schur superalgebras.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).     

Trigonometric wavelets for Hermite interpolation

The aim of this paper is to investigate a multiresolution analysis of nested subspaces of trigonometric polynomials. The pair of scaling functions which span the sample spaces are fundamental functions for Hermite interpolation on a dyadic partition of nodes on the interval . Two wavelet functions that generate the corresponding orthogonal complementary subspaces are constructed so as to possess the same fundamental interpolatory properties as the scaling functions. Together with the corresponding dual functions, these interpolatory properties of the scaling functions and wavelets are used to formulate the specific decomposition and reconstruction sequences. Consequently, this trigonometric multiresolution analysis allows a completely explicit algorithmic treatment.

     

On two--block--factor sequences and one--dependence

The distributions of two--block--factors arising from i.i.d. sequences are observed to coincide with the distributions of the superdiagonals of jointly exchangeable and dissociated arrays . An inequality for superdiagonal probabilities of the arrays is presented. It provides, together with the observation, a simple proof of the fact that a special one--dependent Markov sequence of Aaronson, Gilat and Keane (1992) is not a two--block factor.

     

On the convergence of the exponential multiplier method for convex programming

In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171.     

Direct Identification of the Carbon Skeleton of Organic Compounds using Double Quantum Coherence 13C-NMR Spectroscopy. The INADEQUATE Pulse Sequence

NMR spectroscopy plays an important part in the determination of the structures of organic compounds. The parameters of importance here are the chemical shifts of the ¹H and ¹³C nuclei and the spin-spin interactions both between ¹H nuclei and between ¹H and ¹³C nuclei. Couplings between ¹³C nuclei were almost completely neglected until a few years ago, since they were extremely difficult to observe because of the low natural abundance of ¹³C. However, it is these couplings which afford information directly on the carbon-carbon connectivities in the molecule. It is now possible to use a special NMR pulse sequence to make these couplings more readily visible: the result of using this sequence is a ¹³C-NMR spectrum from which the carbon skeleton concerned can be directly read off. Two-dimensional spectra in particular are very easy to evaluate. The pulse sequence involved, which bears the somewhat puzzling name INADEQUATE, produces double-quantum coherences from which the NMR signals of the coupled carbon nuclei can be obtained. In this article the principle of double-quantum coherence is described and a number of examples for the application of the INADEQUATE pulse sequences to problems in synthetic organic chemistry, biosynthesis and natural products chemistry are presented; in addition, the possibility of applying the INADEQUATE method to other nuclei is considered.     

RATE OF INTRA-MOLECULAR CONTACT FORMATION IN SHORT TWO-DIMENSIONAL COMPACT POLYMERS CHAINS

It is important to know the rate of intra-molecular contact formation in proteins in order to understand how proteins fold clearly. Here we investigate the rate of intra-molecular contact formation in short two-dimensional compact polymer chains by calculating the probability distribution p(r) of end-to-end distance r using the enumeration calculation method and HP model on two-dimensional square lattice. The probability distribution of end-to-end distance p(r) of short two-dimensional compact polymers chains may consist of two parts, i.e. p(r) = p1(r) p2(r), where p1(r) and p2(r) are different for small r. The rate of contact formation decreases monotonically with the number of bonds N, and the rate approximately conforms to the scaling relation of k(N) ∝ N-α. Here the value of α increases with the contact radius a and it also depends on the percentage of H (hydrophobic) residues in the sequences of compact chains and the energy parameters of εHH, εHP and εPP . Some comparisons of theoretical predictions with experimental results are also made. This investigation may help us to understand the protein folding.     

Rare numbers

Suppose thatX ₁,X ₂,... is a sequence of iid random variables taking values inZ ⁺. Consider the random sequenceA(X)(X ₁,X ₂,...). LetY _n be the number of integers which appear exactly once in the firstn terms ofA(X). We investigate the limit behavior ofn ^–(1–) Y _n for [0, 1].     

CertainC*-algebras with real rank zero and their corona and multiplier algebras: II

We first determine the homotopy classes of nontrivial projections in a purely infinite simpleC*-algebraA, in the associated multiplier algebraM(A) and the corona algebraM A/A in terms ofK _*(A). Then we describe the generalized Fredholm indices as the group of homotopy classes of non-trivial projections ofA; consequently, we determine theK _*-groups of all hereditaryC*-subalgebras of certain corona algebras. Secondly, we consider a group structure of *-isomorphism classes of hereditaryC*-subalgebras of purely infinite simpleC*-algebras. In addition, we prove that ifA is aC*-algebra of real rank zero, then each unitary ofA, in caseA it unital, each unitary ofM(A) and ofM(A)/A, in caseA is nonunital but -unital, can be factored into a product of a unitary homotopic to the identity and a unitary matrix whose entries are all partial isometries (with respect to a decomposition of the identity).Partially supported by a grant from the National Science Foundation.     

Higher-order necessary conditions for infinite and semi-infinite optimization

In this paper, we present a unified theory of first-order and higher-order necessary optimality conditions for abstract vector optimization problems in normed linear spaces. We prove general multiplier rules, from which nearly all known first-order, second-order, and higher-order necessary conditions can be derived. In the last section, we prove higher-order necessary conditions for semi-infinite programming problems.This work was developed within the Forschungsschwerpunkt Dynamische Systeme, Universität Bremen, Bremen, West Germany.The author wishes to thank Prof. Dr. D. Hinrichsen for his helpful remarks and discussions during the preparation of this work.