Wedescribe a polynomial-size conic quadratic reformulation for amachine-job assignment problemwith separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation. © 2009 Elsevier B.V. All rights reserved.

= 1 or −1 according as j is or is not a quadratic residue mod p. A multivariable generalization of Theorem 1.1 follows. Theorem 1.1 is a special case of Theorem 1.2 with x3 = · · · = xp = 0. Theorem 1.2. Let p be an odd prime and p = (−1)(p−1)/2p. Then there exist integer polynomials R(x1, x2, . . . , xp) and S(x1, x2, . . . , xp) such that 4 · det(circ(x1, x2, . . . , xp)) x1 + x2 + · · ·+ xp ...

Vegetable production systems are often characterized by excessive nitrogen (N) fertilization and the incorporation of large amounts of post-harvest crop residues. This makes them particularly prone to ammonia (NH3) and nitrous oxide (N2O) emissions. Yet, urgently needed management strategies that can reduce these harmful emissions are missing, because underlying processes are not fully understo...

A general type of linear cyclic codes is introduced as a straightforward generalization of quadratic residue codes, e-residue codes, generalized quadratic residue codes and polyadic codes. A generalized version of the well-known squareroot bound for odd-weight words is derived.

Recently, a new algebraic decoding method was proposed by Truong et al. In this paper, three decoders for the quadratic residue codes with parameters (71, 36, 11), (79, 40, 15), and (97, 49, 15), which have not been decoded before, are developed by using the decoding scheme given by Truong et al. To confirm our results, an exhaustive computer simulation was executed successfully.

A prime number p is called elite if only finitely many Fermat numbers 2 n + 1 are quadratic residues of p. Previously only the interval up to 10 was systematically searched for elite primes and 16 such primes were found. We extended this research up to 2.5 · 10 and found five further elites, among which 1 151 139 841 is the smallest and 171 727 482 881 the largest.

In the book which accompanies the stencils various methods of finding quadratic residues are discussed and the method by means of the expansion of the square root of the number in a continued fraction is found to be by far the most effective. Various examples are given illustrating the power of the stencils, and a reproduction of the first page of the list of primes accompanies the work. The pl...

In [1] a proof was given of Fermat’s Two-Square Theorem using the group theoretical structure of the classical modular group. This has been extended in many directions and to other square properties in general rings. In particular in [2] a two-square theorem was given for the Gaussian integers in terms of when ii is a quadratic residue. In this note we examine and survey this technique and the ...

Let π(x; d, a) denote the number of primes p ≤ x with p ≡ a(mod d). Chebyshev’s bias is the phenomenon that ‘more often’ π(x; d, n) > π(x; d, r), than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If π(x; d, n) ≥ π(x; d, r) for every x up to some large number, then one expects that N(x; d, n) ≥ N(x; d, r) for every x. Here N(x; d, a) denotes ...

to study the effects of two irrigation regimes and application of barley residue, zeolite and superabsorbent polymer on forage yield and some physiological traits of maize and sorghum, an experiment was conducted over two years in kerman, iran. a randomized complete block design arranged in a factorial split was used with three replications. two irrigation regimes of normal irrigation and water...