The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

A New Cohomology Theory of Orbifold

Based on the orbifold string theory model in physics, we construct a new cohomology ring for any almost complex orbifold. The key theorem is the associativity of this new ring. Some examples are computed.Both authors partially supported by the National Science Foundation     

Steady-state analytical solutions for the lattice boltzmann equation

A general class of analytical solutions of the lattice Boltzmann equation is derived for two-dimensional, steady-state unidirectional flows. A subset of the solutions that verifies the corresponding Navier-Stokes equations is given. It is pointed out that this class includes, e.g., the Couette and the Poiseuille flow but not, e.g., the basic Kolmogorov flow. For steady-state non-unidirectional flows, first and second order solutions of the lattice Boltzmann equation are derived. Practical consequences of the analysis are mentioned. Differences between the technique applied here and those used in some earlier works are emphasized.     

On two theorems for flat,affine group schemes over a discrete valuation ring

We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation ring, in a slightly more general context.     

Groups in which every non-abelian subgroup is permutable

A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated. This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di Matematica e Applicazioni” for its financial support.     

The elastic theory of a single DNA molecule

We study the elastic responses of double-(ds) and single-stranded (ss) DNA at external force fields. A double-strand-polymer elastic model is constructed and solved by path integral methods and Monte Carlo simulations to understand the entropic elasticity, cooperative extensibility, and supercoiling property of dsDNA. The good agreement with experiments indicates that short-ranged base-pair stacking interaction is crucial for the stability and the high deformability of dsDNA. Hairpin-coil transition in ssDNA is studied with generating function method. A threshold force is needed to pull the ssDNA hairpin patterns, stabilized by base pairing and base-pair stacking, into random coils. This phase transition is predicted to be of first order for stacking potential higher than some critical level, in accordance with experimental observations.     

Improved search for $B_{s}^{0} - \overline{B}_{s}^{0}$ oscillations

An improved search for B _s ⁰ oscillations is performed in the ALEPH data sample collected during the first phase of LEP, and reprocessed in 1998. Three analyses based on complementary event selections are presented. First, decays of B _s ⁰ mesons into hadronic flavour eigenstates are fully reconstructed. This selection yields a small sample of candidates with excellent decay length and momentum resolution and hi gh average B _s ⁰ purity. Semileptonic decays with a reconstructed D _s ^- meson provide a second sample with larger statistics, high average B _s ⁰ purity, but a poorer momentum and decay length resolution due to the partial decay reconstruction. Finally, semileptonic b-hadron decays are inclusively selected and yield the data sample with the highest sensitivity to B _s ⁰ oscillations, as the much higher statistics compensate for the low average B _s ⁰ purity and poorer time resolution. A lower limit is set atps^-1 at 95% C.L., significantly lower than the expected limit of 15.2 ps^-1. Received: 21 February 2003 / Published online: 11 June 2003     

Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.