Small Solutions of Quadratic Diophantine Equations

We consider quadratic diophantine equations of the shape for a polynomial Q(X₁, ..., X_s) Z[X₁, ..., X_s] of degree 2.Let H be an upper bound for the absolute values of the coefficientsof Q, and assume that the homogeneous quadratic part of Q isnon-singular. We prove, for all s 3, the existence of a polynomialbound _s(H) with the following property: if equation (1) hasa solution x Z^s at all, then it has one satisfying For s = 3 and s = 4 no polynomial bounds _s(H) were previouslyknown, and for s 5 we have been able to improve existing boundsquite significantly. 2000 Mathematics Subject Classification11D09, 11E20, 11H06, 11P55.     

Structure of Degenerate Block Algebras

Given a non-trivial torsion-free abelian group (A,+,Q), a field F of characteristic 0, and a non-degenerate bi-additive skew-symmetric map : A A F, we define a Lie algebra = (A, ) over F with basis {e_x | x A/{0}} and Lie product [e_x,e_y] = (x,y)e_x+y. We show that is endowed uniquely with a non-degenerate symmetric invariant bilinear form and the derivation algebra Der of is a complete Lie algebra. We describe the double extension D( , T) of by T, where T is spanned by the locally finite derivations of , and determine the second cohomology group H²(D( , T),F) using anti-derivations related to the form on D( , T). Finally, we compute the second Leibniz cohomology groups HL²( , F) and HL²(D( , T), F).2000 Mathematics Subject Classification: 17B05, 17B30This work was supported by the NNSF of China (19971044), the Doctoral Programme Foundation of Institution of Higher Education (97005511), and the Foundation of Jiangsu Educational Committee.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

The tame kernel of imaginary quadratic fields with class number 2 or 3

This paper presents improved bounds for the norms of exceptional finite places of the group , where is an imaginary quadratic field of class number 2 or 3. As an application we show that .

     

An O(n 2) Active Set Algorithm for Solving Two Related Box Constrained Parametric Quadratic Programs

Recently, O(n ²) active set methods have been presented for minimizing the parametric quadratic functions (1/2)x Dx–a x+| x–c| and (1/2)x Dx–a x+(/2)( x–c)², respectively, subject to lxb, for all nonnegative values of the parameter . Here, D is a positive diagonal n×n matrix, and a are arbitrary n-vectors, c is an arbitrary scalar; l and b are arbitrary n-vectors such that lb. In this paper, we show that each one of these algorithms may be used to simultaneously solve both parametric programs withno additional computational cost.     

Tenth degree number fields with quintic fields having one real place

In this paper, we enumerate all number fields of degree of discriminant smaller than in absolute value containing a quintic field having one real place. For each one of the (resp. found fields of signature (resp. the field discriminant, the quintic field discriminant, a polynomial defining the relative quadratic extension, the corresponding relative discriminant, the corresponding polynomial over , and the Galois group of the Galois closure are given.

In a supplementary section, we give the first coincidence of discriminant of (resp. nonisomorphic fields of signature (resp. .

     

Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.     

A Test-Example of a Quadratic Lattice

We compute the subdirectly irreducible factors of the free Hermitean (semi)lattice generated by a single element a subject to the relation aa ; we also compute the factors of its induced distributive presentation.     

Numerical analysis of a quadratic matrix equation

The quadratic matrix equation AX²+ BX + C = 0in n x nmatricesarises in applications and is of intrinsic interest as oneof the simplest nonlinear matrix equations. We give a completecharacterization of solutions in terms of the generalized Schurdecomposition and describe and compare various numerical solutiontechniques. In particular, we give a thorough treatment offunctional iteration methods based on Bernoulli’s method.Other methods considered include Newton’s method with exact line searches, symbolic solution and continued fractions.We show that functional iteration applied to the quadraticmatrix equation can provide an efficient way to solve the associated quadratic eigenvalue problem (²A + B + C)x = 0.     

On a differential-algebraic problem

The method of quasilinearization is a procedure for obtaining approximate solutions of differential equations. In this paper, this technique is applied to a differential-algebraic problem. Under some natural assumptions, monotone sequences converge quadratically to a unique solution of our problem.