An additive problem on Piatetski-Shapiro primes

In this paper, we will prove for 0.9993 γ 1 that there are infinitely primes p of the form [n~(1/γ)] with p + 2 having at most four prime factors.     

Diophantine inequalities over Piatetski-Shapiro primes

Let c>1 and : We study the solubility of the Diophantine inequality in Piatetski-Shapiro primes p₁,p₂, .., p_s of the form p_j=[m^{\gamma }] for some m\in \mathbb{N}, and improve the previous results in the cases s = 2, 3, 4.     

Patterns of quadratic residues and nonresidues for infinitely many primes

If S is a nonempty, finite subset of the positive integers, we address the question of when the elements of S consist of various mixtures of quadratic residues and nonresidues for infinitely many primes. We are concerned in particular with the problem of characterizing those subsets of integers that consist entirely of either (1) quadratic residues or (2) quadratic nonresidues for such a set of primes. We solve problem (1) and we show that problem (2) is equivalent to a purely combinatorial problem concerning families of subsets of a finite set. For sets S of (essentially) small cardinality, we solve problem (2). Related results and some associated enumerative combinatorics are also discussed.     

Quadratic residues and the combinatorics of sign multiplication

If S is a nonempty finite set of positive integers, we find a criterion both necessary and sufficient for S to satisfy the following condition: if q is a fixed nonnegative integer, then there exists infinitely many primes p such that S contains exactly q quadratic residues of p. This result simultaneously generalizes two previous results of the author, and the criterion used is expressed by means of a purely combinatorial condition on the prime factors of the elements of S of odd multiplicity.     

On thek dimensional Piatetski-Shapiro prime number theorem

Thek-dimensional Piatetski-Shapiro prime number problem fork⩾3 is studied. Let π(x ₁ c ₁,⋯,c _k ) denote the number of primesp withp⩽x, , where 1<c ₁<⋯<c _k are fixed constants. It is proved that π(x;c ₁,⋯,c _k ) has an asymptotic formula ifc ₁ ⁻¹ +⋯+c _k ⁻¹ >k−k/(4k ²+2). Project supported by the National Natural Science Foundation of China (Grant No. 19801021) and the Natural Science Foundation of Shandong Province (Grant No.Q98A02110).     

Quadratic forms that represent almost the same primes

Jagy and Kaplansky exhibited a table of pairs of positive definite binary quadratic forms that represent the same odd primes and conjectured that their list is complete outside of ``trivial' pairs. In this article, we confirm their conjecture, and in fact find all pairs of such forms that represent the same primes outside of a finite set.

     

Splitting Patterns and Invariants of Quadratic Forms

Let φ be an anisotropic quadratic form over a field F of characteristic not 2. The splitting pattern of φ is defined to be the increasing sequence of nonnegative integers obtained by considering the Witt indices i_W(φ_k) of φ over K where K ranges over all field extensions of F. Restating earlier results by HURRELBRINK and REHMANN , we show how the index of the Clifford algebra of φ influences the splitting pattern. In the case where F is formally real, we investigate how the signatures of φ influence the splitting behaviour. This enables us to construct certain splitting patterns which have been known to exist, but now over much “simpler” fields like formally real global fields or ?(t). We also give a full classification of splitting patterns of forms of dimension less than or equal to 9 in terms of properties of the determinant and Clifford invariant. Partial results for splitting patterns in dimensions 10 and 11 are also provided. Finally, we consider two anisotropic forms φ and φ of the same dimension m with φ ? ? φ ∈ Iⁿ F and give some bounds on m depending on n which assure that they have the same splitting pattern.     

Global Optimization of a Quadratic Functional with Quadratic Equality Constraints, Part 2

In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).     

Quadratic equations with five prime unknowns

Let b₁,?,b₅ be non-zero integers satisfying gcd(b_i,b_j,b_k)=1, for 1?i<j<k?5 and |b_j|?|b₅| for 1?j?5 and n an integer satisfying . In this paper we improve earlier work by M.C. Liu and Tsang and by the first author and J.Y. Liu. In particular, we prove that if b_j are not all of the same sign, then the quadratic equation

     

Prime Producing Quadratic Polynomials and Class Number One or Two

Let d≡ 5 mod 8 be a positive square-free integer and let h(d) be the class number of the real quadratic field ℚ(√d). Let p be a divisor of d = pq and let . Assume that is prime or equal to 1 for all integers x with 0≤x<W. Under the assumption that the Riemann hypothesis is true, we prove that if , then h(d) < 2. Furthermore we show that h(d)< 2 implies d < 4245. In the case when there exists at least one split prime less than W, we prove the following results without any assumptions on the Riemann hypothesis. If then h< 2 or h = 4. If , then h≤ 2, h = 4 or h = 2^t−2, where t is the number of primes dividing d. In the case when h = 2^t−2 we have , where φ = 2 or 4. 2000 Mathematics Subject Classification: Primary–11R29     

A search for Fibonacci-Wieferich and Wolstenholme primes

A prime is called a Fibonacci-Wieferich prime if , where is the th Fibonacci number. We report that there exist no such primes . A prime is called a Wolstenholme prime if . To date the only known Wolstenholme primes are 16843 and 2124679. We report that there exist no new Wolstenholme primes . Wolstenholme, in 1862, proved that for all primes . It is estimated by a heuristic argument that the ``probability' that is Fibonacci-Wieferich (independently: that is Wolstenholme) is about . We provide some statistical data relevant to occurrences of small values of the Fibonacci-Wieferich quotient modulo .

     

On a Quadratic Optimization Problem with Equality Constraints

The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem.     

Sufficient Global Optimality Conditions for Bivalent Quadratic Optimization

We prove a sufficient global optimality condition for the problem of minimizing a quadratic function subject to quadratic equality constraints where the variables are allowed to take values –1 and 1. We extend the condition to quadratic problems with matrix variables and orthonormality constraints, and in particular to the quadratic assignment problem.     

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

We study several variations of the Bitran–Hax variable fixing method for the continuous quadratic knapsack problem. We close the gaps in the convergence analysis of several existing methods and provide more efficient versions. We report encouraging computational results for large-scale problems.     

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems. The author thanks the Associate Editor and an anonymous referee for their helpful comments.     

Quadratic prediction and quadratic sufficiency in finite populations

The problem of quadratic prediction for population quadratic quantities in finite populations has been considered in the literature. In this paper, we mainly aim at extending the ordinary quadratic prediction problems to a general case, and derive the representations of the two essentially unique optimal predictors: one is an optimal invariant quadratic unbiased predictor, and the other is an optimal invariant quadratic (potentially) biased predictor. Further, we show that the two predictors are nonnegative and reasonable by considering an extreme situation, and apply resulting conclusions to a special model with a compound symmetric variance matrix. In addition, we propose a notion of quadratic sufficiency with regard to the optimal prediction problems by employing materials derived in the first part, and investigate corresponding characterizations in detail.