Semi‐classical formulation of time‐dependent discrete variable representation method

In this article, we apply a novel time‐dependent discrete variable representation (TDDVR) method proposed by Barkakaty and Adhikari to investigate tunneling through an Eckart barrier. This semi‐classical method is theoretically rigorous and straightforward to implement. Among the TDDVR formulations, this report presents the first derivation of a rigorous form of quantum force (QF) for the present perspective. The validity of this semi‐classical approach is demanded based on the excellent agreement of the tunneling probability with the corresponding quantum results. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004     

Differentiation identities for hypergeometric functions

It is well-known that differentiation of hypergeometric function multiplied by a certain power function yields another hypergeometric function with a different set of parameters. Such differentiation identities for hypergeometric functions have been used widely in various fields of applied mathematics and natural sciences. In this expository note, we provide a simple proof of the differentiation identities, which is based only on the definition of the coefficients for the power series expansion of the hypergeometric functions.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

The strong coupling constant: Its theoretical derivation from a geometric approach to hadron structure

Since more than a decade, abi-scale, unified approach to strong and gravitational interactions has been proposed, that uses the geometrical methods of general relativity, and yielded results similar to strong gravity theory's. We fix our attention, in this note, on hadron structure, and show that also the strong interaction strength _S, ordinarily called the (perturbative) coupling-constant square, can be evaluated within our theory, and found to decrease (increase) as the distancer decreases (increases). This yields both the confinement of the hadron constituents (for large values ofr) and their asymptotic freedom (for small values ofr inside the hadron): in qualitative agreement with the experimental evidence. In other words, our approach leads us, on a purely theoretical ground, to a dependence of _S onr which had been previously found only on phenomenological and heuristic grounds. We expect the above agreement to be also quantitative, on the basis of a few checks performed in this paper, and of further work of ours on calculating meson mass spectra.     

Fermionic solution of the Andrews-Baxter-Forrester model. II. Proof of Melzer's polynomial identities

We compute the one-dimensional configuration sums of the ABF model using the fermionic technique introduced in part I of this paper. Combined with the results of Andrews, Baxter, and Forrester, we prove polynomial identities for finitizations of the Virasoro characters as conjectured by Melzer. In the thermodynamic limit these identities reproduce Rogers-Ramanujan-type identities for the unitary minimal Virasoro characters conjectured by the Stony Brook group. We also present a list of additional Virasoro character identities which follow from our proof of Melzer's identities and application of Bailey's lemma.Dedicated to the memory of Piet Kasteleyn.     

Density computations for real quadratic units

In order to study the density of the set of positive integers for which the negative Pell equation is solvable in integers, we compute the norm of the fundamental unit in certain well-chosen families of real quadratic orders. A fast algorithm that computes 2-class groups rather than units is used. It is random polynomial-time in as the factorization of is a natural part of the input for the values of we encounter. The data obtained provide convincing numerical evidence for the density heuristics for the negative Pell equation proposed by the second author. In particular, an irrational proportion of the real quadratic fields without discriminantal prime divisors congruent to 3 mod 4 should have a fundamental unit of norm .

     

Series representation for semistable laws and their domains of semistable attraction

If the centered and normalized partial sums of an i.i.d. sequence of random variables converge in distribution to a nondegenerate limit then we say that this sequence belongs to the domain of attraction of the necessarily stable limit. If we consider only the partial sums which terminate atk _n wherek _n+1 ck _n then the sequence belongs to the domain of semistable attraction of the necessarily semistable limit. In this paper, we consider the case where the limiting distribution is nonnormal. We obtain a series representation for the partial sums which converges almost surely. This representation is based on the order statistics, and utilizes the Poisson process. Almost sure convergence is a useful technical device, as we illustrate with a number of applications.This research was supported by a research scholarship from the Deutsche Forschungsgemeinschaft (DFG).     

On quadratic forms of height two and a theorem of Wadsworth

Let and be anisotropic quadratic forms over a field of characteristic not . Their function fields and are said to be equivalent (over ) if and are isotropic. We consider the case where and is divisible by an -fold Pfister form. We determine those forms for which becomes isotropic over if , and provide partial results for . These results imply that if and are equivalent and , then is similar to over . This together with already known results yields that if is of height and degree or , and if , then and are equivalent iff and are isomorphic over .

     

Primal-dual interior point approach for computingl 1-solutions andl ∞-solutions of overdetermined linear systems

This paper concerns solving an overdetermined linear systemA ^T x=b in the leastl ₁-norm orl -norm sense, whereA ^m×n ,m<n. We show that the primal-dual interior point approach for linear programming can be applied, in an effective manner, to linear programming versions of thel ₁ andl -problems. The resulting algorithms are simple to implement and can attain quadratic or superlinear convergence rate. At each iteration, the algorithms must solve a linear system with anm×m positive-definite coefficient matrix of the formADA ^T , whereD is a positive diagonal matrix. The preliminary numerical results indicate that the proposed algorithms offer considerable promise.This research was supported in part by Grants NSF DMS-91-02761 and DOE DE-FG05-91-ER25100.     

Interior-point algorithm for quadratically constrained entropy minimization problems

In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints.