Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems

We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that certain overrelaxation parameters form a divergent series. We combine our methods with a very general class of deterministic control sequences where, roughly speaking, we require that sooner or later we encounter a violated constraint if one exists. This requirement is satisfied, in particular, by the cyclic, repetitive and remotest set controls. Moreover, it is almost surely satisfied for random controls.

     

Weak convergence of nonparametric estimators of the multidimensional and multidimensional-multivariate renewal functions on Skorohod topology spaces

Statistical Inference for Stochastic Processes - This paper deals with the weak convergence of nonparametric estimators of the multidimensional and multidimensional-multivariate renewal functions...     

Positive Lyapunov exponents for a class of deterministic potentials

LetV() be a smooth, non-constant function on the torus and letT be a hyperbolic toral automorphism. Consider a discrete one dimensional Schrödinger operatorH, whose potential at sitej is given bygV _j =gV(T ^j ). We prove that wheng0 is small andg ^1/2 |E|2–g ^1/2 , the Lyapunov exponent for the cocycle generated byH-E is proportional tog ². The proof relies on a formula of Pastur and Figotin and on symbolic dynamics.     

Generalized hypergeometric functions and rational curves on Calabi-Yau complete intersections in toric varieties

We formulate general conjectures about the relationship between the A-model connection on the cohomology of ad-dimensional Calabi-Yau complete intersectionV ofr hypersurfacesV ₁ ,...,V _r in a toric varietyP and the system of differential operators annihilating the special generalized hypergeometric series ⁰ constructed from the fan . Using this generalized hypergeometric series, we propose conjectural mirrorsV ofV and the canonicalq-coordinates on the moduli spaces of Calabi-Yau manifolds.In the second part of the paper we consider some examples of Calabi-Yau 3-folds having Picard number >1 in products of projective spaces. For conjectural mirrors, using the recurrent relation among coefficients of the restriction of the hypergeometric function ⁰ on a special line in the moduli space, we determine the Picard-Fuchs equation satisfied by periods of this special one-parameter subfamily. This allows to obtain some sequences of integers which can be conjecturally interpreted in terms of Gromov-Witten invariants. Using standard techniques from enumerative geometry, first terms of these sequence of integers are checked to coincide with numbers of rational curves on Calabi-Yau 3-folds.     

Design considerations and computer modeling related to the development of molecular scaffolds and peptide mimetics for combinatorial chemistry

Summary A critical issue in drug discovery utilizing combinatorial chemistry as part of the discovery process is the choice of scaffolds to be used for a proper presentation, in a three-dimensional space, of the critical elements of structure necessary for molecular recognition (binding) and information transfer (agonist/ antagonist). In the case of polypeptide ligands, considerations related to the properties of various backbone structures (-helix, -sheets, etc.; , space) and those related to three-dimensional presentation of side-chain moieties (topography; (chi) space) must be addressed, although they often present quite different elements in the molecular recognition puzzle. We have addressed aspects of this problem by examining the three-dimensional structures of chemically different scaffolds at various distances from the scaffold to evaluate their putative diversity. We find that chemically diverse scaffolds can readily become topographically similar. We suggest a topographical approach involving design in chi space to deal with these problems.     

Constructing nonresidues in finite fields and the extended Riemann hypothesis

We present a new deterministic algorithm for the problem of constructing th power nonresidues in finite fields , where is prime and is a prime divisor of . We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for fixed and , our algorithm runs in polynomial time. Unlike other deterministic algorithms for this problem, this polynomial-time bound holds even if is exponentially large. More generally, assuming the ERH, in time we can construct a set of elements that generates the multiplicative group . An extended abstract of this paper appeared in Proc. 23rd Ann. ACM Symp. on Theory of Computing, 1991.

     

On a problem of H. N. Gupta

It is shown that the axiom For any points x, y, z such that y is between x and z, there is a right triangle having x and z as endpoints of the hypotenuse and y as foot of the altitude to the hypotenuse, when added to three-dimensional Euclidean geometry over arbitrary ordered fields, is weaker than the axiom Every line which passes through the interior of a sphere intersects that sphere.