A truncated determinant algorithm is used to study the physical effects of the quark eigenmodes associated with eigenvalues below 420 MeV. This initial high statistics study focuses on coarse (6) lattices (with O(a) improved gauge action), light internal quark masses and large physical volumes. Three features of full QCD are examined: topological charge distributions, string breaking as observe...

An algorithm suitable for numerical solution of linear eigenmode problems in resistive magnetohydrodynamics MHD and two-fluid MHD models without prior approximations is presented. For these plasma models, sets of equations suitable for numerical solution are derived and the details of the algorithm of this solution are given. The algorithm is general and is suitable for solution of boundary eig...

We study proper rational maps from the unit disk to balls in higher dimensions. After gathering some known results, we study the moduli space of unitary equivalence classes of polynomial proper maps from the disk to a ball, and we establish a normal form for these equivalence classes. We also prove that all rational proper maps from the disk to a ball are homotopic in target dimension at least ...

The infrared (IR) spectrum of solid C60 exhibits many weak vibrational modes. Symmetry breaking due to C isotopes provides a possible route for optically activating IR-silent vibrational modes. Experimental spectra and a semi-empirical theory on natural abundance and C-enriched single crystals of C60 are presented. By comparing the experimental results with the theoretical results, we exclude t...

Fast ions in tokamaks are known to have a significant influence on global plasma instabilities. In normal mode analyses for tokamaks, the perturbed electric and magnetic fields have been evaluated at the position of the particle’s guiding center. The effect of spatial variation of the perturbed fields within the gyroradius for resistive internal magnetohydrodynamic ~MHD! modes is considered in ...

We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size exactly k. It was known that for k ≥ 3, Linear k-SAT is NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and that they do...