On orthogonal trajectories and optimization

This note discusses a generalization of the trapezoidal method for numerical integration of the differential equations of the orthogonal trajectories of a function as a means of finding maximum or minimum values of the function. Connections between the choice of a parameter in the integration scheme and various modifications of Newton's method are indicated.     

弱拉回平坦序S-系对序幺半群的刻画

设S是序幺半群,借助环模理论以及半群S-系理论方法,在序S-系范畴中研究了弱拉回平坦性质。刻画了弱拉回平坦序S-系关于直积封闭的序幺半群类以及弱拉回平坦性质与其他性质一致的序幺半群类,讨论了循环序S-系具有拉回平坦覆盖的条件,进而推广了S-系的一些重要结果。     

Coupling constants in the direct configuration interaction method

A general algorithm of evaluation of the coefficients of molecular integrals (coupling constants) appearing in the direct configuration interaction method is derived. The configurations are assumed to be spin-adapted antisymmetrized products of orthonormal orbitals. No limitation is imposed either upon the reference state (the number of the singly occupied orbitals may be arbitrary) or upon the excitation multiplicity.     

Quantum dots-based reverse phase protein microarray

CdSe nanocrystals, also called quantum dots (Qdots) are a novel class of fluorophores, which have a diameter of a few nanometers and possess high quantum yield, tunable emission wavelength and photostability. They are an attractive alternative to conventional fluorescent dyes. Quantum dots can be silanized to be soluble in aqueous solution under biological conditions, and thus be used in bio-detection. In this study, we established a novel Qdot-based technology platform that can perform accurate and reproducible quantification of protein concentration in a crude cell lysate background. Protein lysates have been spiked with a target protein, and a dilution series of the cell lysate with a dynamic range of three orders of magnitude has been used for this proof-of-concept study. The dilution series has been spotted in microarray format, and protein detection has been achieved with a sensitivity that is at least comparable to standard commercial assays, which are based on horseradish peroxidase (HRP)-catalyzed diaminobenzidine (DAB) chromogenesis. The data obtained through the Qdot method has shown a close linear correlation between relative fluorescence unit and relative protein concentration. The Qdot results are in almost complete agreement with data we obtained with the well-established HRP-DAB colorimetric array (R² = 0.986). This suggests that Qdots can be used for protein quantification in microarray format, using the platform presented here.     

A polynomial algorithm for finding (<Emphasis Type="Italic">g,f</Emphasis>)-colorings orthogonal to stars in bipartite graphs

Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two nonnegative integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). A (g, f)-coloring of G is a generalized edge-coloring in which each color appears at each vertex x at least g(x) and at most f(x) times. In this paper a polynomial algorithm to find a (g, f)-coloring of a bipartite graph with some constraints using the minimum number of colors is given. Furthermore, we show that the results in this paper are best possible.     

Decomposability of graph -algebras

We give conditions on an arbitrary directed graph for the associated Cuntz-Krieger algebra to be decomposable as a direct sum. We describe the direct summands as certain graph algebras.

     

Threefolds with vanishing Hodge cohomology

We consider algebraic manifolds of dimension 3 over with for all and 0$">. Let be a smooth completion of with , an effective divisor on with normal crossings. If the -dimension of is not zero, then is a fibre space over a smooth affine curve (i.e., we have a surjective morphism from to such that the general fibre is smooth and irreducible) such that every fibre satisfies the same vanishing condition. If an irreducible smooth fibre is not affine, then the Kodaira dimension of is and the -dimension of is 1. We also discuss sufficient conditions from the behavior of fibres or higher direct images to guarantee the global vanishing of Hodge cohomology and the affineness of .

     

Difference Equations and Discriminants for Discrete Orthogonal Polynomials

We prove that any set of polynomials orthogonal with respect to a discrete measure supported on equidistant points contained in a half line satisfy a second order difference equation. We also give a discrete analogue of the discriminant and give a general formula for the discrete discriminant of a discrete orthogonal polynomial. As an application we give explicit evaluations of the discrete discriminants of the Meixner and the Hahn polynomials. A difference analogue of the Bethe Ansatz equations is also mentioned.Research partially supported by NSF grant DMS 99-70865     

Implications of the Choice of Quadrature Nodes for Picard Integral Deferred Corrections Methods for Ordinary Differential Equations

This paper concerns a class of deferred correction methods recently developed for initial value ordinary differential equations; such methods are based on a Picard integral form of the correction equation. These methods divide a given timestep [t_n,t_n+1] into substeps, and use function values computed at these substeps to approximate the Picard integral by means of a numerical quadrature. The main purpose of this paper is to present a detailed analysis of the implications of the location of quadrature nodes on the accuracy and stability of the overall method. Comparisons between Gauss-Legendre, Gauss-Lobatto, Gauss-Radau, and uniformly spaced points are presented. Also, for a given set of quadrature nodes, quadrature rules may be formulated that include or exclude function values computed at the left-hand endpoint t_n. Quadrature rules that do not depend on the left-hand endpoint (which are referred to as right-hand quadrature rules) are shown to lead to L(α)-stable implicit methods with α≈π/2. The semi-implicit analog of this property is also discussed. Numerical results suggest that the use of uniform quadrature nodes, as opposed to nodes based on Gaussian quadratures, does not significantly affect the stability or accuracy of these methods for orders less than ten. In contrast, a study of the reduction of order for stiff equations shows that when uniform quadrature nodes are used in conjunction with a right-hand quadrature rule, the form and extent of order-reduction changes considerably. Specifically, a reduction of order to is observed for uniform nodes as opposed to for non-uniform nodes, where Δt denotes the time step and ε a stiffness parameter such that ε→0 corresponds to the problem becoming increasingly stiff. AMS subject classification (2000) 65B05