Quadratic residues and non-residues for infinitely many Piatetski-Shapiro primes

In this paper, we prove a quantitative version of the statement that every nonempty finite subset of N+ is a set of quadratic residues for infinitely many primes of the form [nc] with 1 ≤ c ≤243/205. Correspondingly, we can obtain a similar result for the case of quadratic non-residues under reasonable assumptions. These results generalize the previous ones obtained by Wright in certain aspects.     

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use information belonging to only one level in the Hasse diagram adjacent to the level of the solution at hand. In this paper, we propose a data correcting algorithm that looks at multiple levels of the Hasse diagram and hence makes the data correcting algorithm more efficient. Our computations with quadratic cost partition problems show that this multilevel search effects a 8- to 10-fold reduction in computation times, so that some of the dense quadratic partition problem instances of size 500, currently considered as some of the most difficult problems and far beyond the capabilities of current exact methods, are solvable on a personal computer working at 300 MHz within 10 min.     

On the Characterization of Quadratic Splines

A quadratic spline is a differentiable piecewise quadratic function. Many problems in the numerical analysis and optimization literature can be reformulated as unconstrained minimizations of quadratic splines. However, only special cases of quadratic splines have been studied in the existing literature and algorithms have been developed on a case-by-case basis. There lacks an analytical representation of a general or even convex quadratic spline. The current paper fills this gap by providing an analytical representation of a general quadratic spline. Furthermore, for a convex quadratic spline, it is shown that the representation can be refined in the neighborhood of a nondegenerate point and a set of nondegenerate minimizers. Based on these characterizations, many existing algorithms for specific convex quadratic splines are also finitely convergent for a general convex quadratic spline. Finally, we study the relationship between the convexity of a quadratic spline function and the monotonicity of the corresponding linear complementarity problem. It is shown that, although both conditions lead to easy solvability of the problem, they are different in general.This project was initiated when the first author was visiting the Technical University of Denmark and Erasmus University. The visit was partially funded by the Danish Natural Science Research Council.     

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).     

On the Limit Cycles of Quadratic Differential Systems

In this paper we give the necessary and sufficient conditions for all finite critical points of quadratic differential systems to be weak foci, and solve an open problem proposed by Yanquian Ye. Received January 11, 1999, Revised October 10, 2000, Accepted March 5, 2001     

Approximation of the Quadratic Set Covering problem

We study in this article the polynomial approximation properties of the Quadratic Set Covering problem. This problem, which arises in many applications, is a natural generalization of the usual Set Covering problem. We show that this problem is very hard to approximate in the general case, and even in classical subcases (when the size of each set or when the frequency of each element is bounded by a constant). Then we focus on the convex case and give both positive and negative approximation results. Finally, we tackle the unweighted version of this problem.     

On the Conditions of a Center and General Integrals of Quadratic Differential Systems

We give the general integral of quadratic differential system with center in two cases under the Chinese classification. Project supported by the National Natural Science Foundation of China and Natural Science Foundation of Jiangsu Province Education Commission     

Quadratic programming and combinatorial minimum weight product problems

We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (a ^T x + γ)(b ^T x + δ) under linear constraints A x ≤ d. Examples of such problems are combinatorial minimum weight product problems such as the following: given a graph G = (V,E) and two edge weights find an s − t path P that minimizes a(P)b(P), the product of its edge weights relative to a and b.      

Quadratic residues and the distribution of prime numbers

D. Shanks [11] has given a heuristical argument for the fact that there are “more” primes in the non-quadratic residue classes modq than in the quadratic ones. In this paper we confirmShanks' conjecture in all casesq<25 in the following sense. Ifl ₁ is a quadratic residue,l ₂ a non-residue modq, ε(n, q, l ₁,l ₂) takes the values +1 or ?1 according ton?l ₁ orl ₂ modq, then $$\mathop {\lim }\limits_{x \to \infty } \sum\limits_p {\varepsilon (p,q,l_1 ,l_2 )} \log pp^{ - \alpha } \exp ( - (\log p)^2 /x) = - \infty$$ for 0≤α<1/2. In the general case the same holds, if all zeros ?=β+yγ of allL(s, χ modq),q fix, satisfy the inequality β²?γ²<1/4.     

三项式xn+x-a的二次不可约因式

设n是大于5的正整数,a是非零整数,f(x)=xn x-a.本文证明了:如果f(x)有首项系数等于1的二次整系数不可约因式g(x),则必有n≡2(mod3),a=-1,g(x)=x2 x 1或者n≡5(mod6),a=1,g(x)=x2-x 1.     

Quadratic perturbations of quadratic codimension-four centers

We study the stratum in the set of all quadratic differential systems , with a center, known as the codimension-four case Q₄. It has a center and a node and a rational first integral. The limit cycles under small quadratic perturbations in the system are determined by the zeros of the first Poincaré-Pontryagin-Melnikov integral I. We show that the orbits of the unperturbed system are elliptic curves, and I is a complete elliptic integral. Then using Picard-Fuchs equations and the Petrov's method (based on the argument principle), we set an upper bound of eight for the number of limit cycles produced from the period annulus around the center.     

A Remark on Computing the Tame Kernel of Quadratic Imaginary Fields

In this paper, we discuss a method to compute the tame kernel of a number field. Confining ourselves to an imaginary quadratic field, we prove that is bijective when . Received October 25, 1999, Accepted February 5, 2001     

Approximate solution of the linear quadratic control problem

In this paper the Legendre polynomials method is applied in order to find the approximate solution of the linear quadratic optimal control problem with imposed inequality constraints. The computational procedure based on the obtained results, is presented     

A Necessary and Sufficient Condition for Admissibility of Nonnegative Quadratic Estimator

ＡＮｅｃｅｓｓａｒｙａｎｄＳｕｆｆｉｃｉｅｎｔＣｏｎｄｉｔｉｏｎｆｏｒＡｄｍｉｓｓｉｂｉｌｉｔｙｏｆＮｏｎｎｅｇａｔｉｖｅＱｕａｄｒａｔｉｃＥｓｔｉｍａｔｏｒＬｕＣｈａｎｇｙｕ（鹿长余）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｎｏｒｔｈｅａ...     

Euler's partition theorem and the combinatorics of ℓ-sequences

Euler's partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [M. Bousquet-Mélou, K. Eriksson, Lecture hall partitions II, Ramanujan J. 1 (2) (1997) 165–185] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an ℓ-sequence” and the ratio “1” is replaced by a root of the characteristic polynomial of the ℓ-sequence. This generalization of Euler's theorem is intrinsically different from the many others that have appeared, as it involves a family of partitions constrained by the ratio of successive parts.In this paper, we provide a surprisingly simple bijection for this result, a question suggested by Richard Stanley. In fact, we give a parametrized family of bijections, that include, as special cases, Sylvester's bijection and a bijection for the lecture hall theorem. We introduce Sylvester diagrams as a way to visualize these bijections and deduce their properties.In proving the bijections, we uncover the intrinsic role played by the combinatorics of ℓ-sequences and use this structure to give a combinatorial characterization of the partitions defined by the ratio constraint. Several open questions suggested by this work are described.     

A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities

In this paper we consider the problem of bounding the Betti numbers, b _i (S), of a semi-algebraic set S⊂ℝ ^k defined by polynomial inequalities P ₁≥0,…,P _s ≥0, where P _i ∈ℝ[X ₁,…,X _k ], s<k, and deg (P _i )≤2, for 1≤i≤s. We prove that for 0≤i≤k−1,

On the Representation of Numbers by Positive Diagonal Quadratic Forms with Five Variables of Level 16

A general formula is derived for the number of representations r(n; f) of a natural number n by diagonal quadratic forms f with five variables of level 16. For f belonging to one-class series, r(n; f) coincides with the sum of a singular series, while in the case of a many-class series an additional term is required, for which the generalized theta-function introduced by T. V. Vepkhvadze [4] is used.     

Quadratic distances for capacity and bi-capacity approximation and identification

The application of multi-attribute utility theory based on the Choquet integral requires the prior identification of a capacity if the utility scale is unipolar, or of a bi-capacity if the utility scale is bipolar. In order to implement a minimum distance principle for capacity or bi-capacity approximation or identification, quadratic distances between capacities and bi-capacities are studied. The proposed approach, consisting in solving a strictly convex quadratic program, has been implemented within the GNU R kappalab package for capacity and nonadditive integral manipulation. Its application is illustrated on two examples.