Estimation de sommes multiples de fonctions arithmétiques

We estimate some sums of the shape S(X ¹,..., X ^m ):=_{1 d1 X1...1 dm Xm} f(d ₁,..., d _m )when m N and f is a nonnegative arithmetical function. We relate them to the behaviour of the associated Dirichlet series F(s ₁,..., s _m ) = _{d1 = 1} ... _{dm = 1} f(d ₁,..., d _m )/d ₁ ^s1 ... d _m ^sm.The main aim of this work is to develop analytic tools to count the rational points of bounded height on toric varieties.     

Interpolating them-th power ofx at the zeros of then-th Chebyshev-polynomial yields an almost best Chebyshev-approximation

LetX={x ₁,x ₂,..., _n }I=[–1, 1] and . ForfC ₁(I) definef* byf–p _f =f*, wherep _f denotes the interpolation-polynomial off with respect toX. We state some properties of the operatorf f*. In particular, we treat the case whereX consists of the zeros of the Chebyshev polynomialT _n (x) and obtain x ^m –p _x ^m8eE _n–1(x ^m ), whereE _n–1(f) denotes the sup-norm distance fromf to the polynomials of degree less thann. Finally we state a lower estimate forE _n (f) that omits theassumptionf ⁽ⁿ⁺¹⁾>0 in a similar estimate of Meinardus.     

Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Approximate necessary conditions for locally weak Pareto optimality

Necessary conditions for a given pointx ⁰ to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f ₁,...,f _m ),F:XR ^m,XR ^m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df ₁(x ⁰)|i=1,...,m}T ^*(X, x ⁰) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper.     

The generalized order complementarity problem

Given an ordered Banach Space (E,K) andm functionsf ₁,f ₂,...,f _m:EE, the generalized order complementarity problem associated with {f _i} andK is to findx ₀K such thatf _i(x ₀)K,i=1,...,m, and (x ₀,f ₁(x ₀),...,f _m(x ₀))=0. The problem is shown to be equivalent to several fixed-point problems and equivalent to the order complementarity problem studied by Borwein and Dempster and by Isac. Existence and uniqueness of solutions and least-element theory are shown in the spacesC(, ) andL _p(, ). For general locally convex spaces, least-element theory is derived, existence is proved, and an algorithm for computing a solution is presented. Applications to the mixed lubrication theory of fluid mechanics are described.     

On a hypothesis on Poincaré series

Let F(x₁,..., x_m) (m1) be a polynomial with integral p-adic coefficients, and let N, be the number of solutions of the congruence F(x₁,..., X_m)=0 mod A proof is given that the Poincaré series (t) = ₀ N t is rational for a class of isometrically-equivalent polynomials of m variables (m2) containing a form of degree n2 of two variables.Translated from Matematicheskie Zametki, Vol. 14, No. 3, pp. 453–463, September, 1973.The author wishes to thank N. G. Chudakov for discussing this paper and for his helpful advice.     

Die Zahl der Spitzen und die Jacobi-Algebra einer isolierten Hyperflächensingularität

Let f{x_o,...,x_n} define a germ of a complex analytic hypersurface (X_o,0) with isolated singularity. We show that the number of cusps of the unfolded discriminant curve is an invariant of the Jacobian algebra {x,_o},...,x_n/(f/x_o,...,f/x_n) of f. Moreover we show that this number + 1 equals the sum of the Milnor numbers of (X_o,0) and of the polar curve of (X_o,0). Our result generalizes formulas of Iversen and Lê for plane curves to arbitrary dimensions.     

A Question of Nori: Projective Generation of Ideals

Let A be a smooth affine domain of dimension d over an infinite perfect field k and let n be an integer such that 2n d + 3. Let I A[T] be an ideal of height n. Assume that I = (f ₁,...,f _n ) + (I ² T). Under these assumptions, it is proved in this paper that I = (g ₁,...,g _n ) with f _i – g _i (I ² T), thus settling a question of Nori affirmatively.     

Applications of the Chauvenet Test to Detection of Overliers in Observations Connected into a Homogeneous Markov Chain

Let x₁,...,x_n be random variables connected into a homogeneous Markov chain. The asymptotic behavior of the distribution of the number of overliers is investigated for unknown parameters a, , and . Bibliography: 4 titles.     

Continuity properties of the normal cone to the level sets of a quasiconvex function

Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)^–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x _n)}, where {x _n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.     

On the boundedness of Weyl sums

Leta be irrational and letf:[0,1] be Riemann-integrable with integral zero. Letf _n (x) denote the Weyl sumf _n (x):= _k=0 ^n–1 f({x k>}),x/[0,1[,n. We prove criteria for the boundedness of the sequence (f _n ) _n1 and discuss the relation of this question to irregularities of the distribution of sequences.     

On the extreme spectral properties of Toeplitz matrices generated byL 1 functions with several minima/maxima

In this paper we are concerned with the asymptotic behavior of the smallest eigenvalue ₁ ⁽ⁿ⁾ of symmetric (Hermitian)n ×n Toeplitz matricesT _n (f) generated by an integrable functionf defined in [–, ]. In [7, 8, 11] it is shown that ₁ ⁽ⁿ⁾ tends to essinff =m _f in the following way: ₁ ⁽ⁿ⁾ –m _f 1/n ^2k . These authors use three assumptions:A1)f –m _f has a zero inx =x ₀ of order 2k.A2)f is continuous and at leastC ^2k in a neighborhood ofx ₀.A3)x =x ₀ is the unique global minimum off in [–, ]. In [10] we have proved that the hypothesis of smoothnessA2 is not necessary and that the same result holds under the weaker assumption thatf L ¹[–, ]. In this paper we further extend this theory to the case of a functionf L ¹[–, ] having several global minima by suppressing the hypothesisA3 and by showing that the maximal order 2k of the zeros off –m _f is the only parameter which characterizes the rate of convergence of ₁ ⁽ⁿ⁾ tom _f .     

Oscillatory criteria for nonlinearnth-order differential equations with quasiderivatives

Sufficient conditions are given for the existence of oscillatory proper solutions of a differential equation with quasiderivativesL _n y=f(t,L ₀ y, ..., L _n–1 y) under the validity of the sign conditionf(t,x ₁ ,...,x _n )x ₁0,f(t,0,x ₂ ,...,x _n )=0 on ₊ x ⁿ .     

Punkt- und Geradenabbildungen,die das volumen 1 vonn- dimensionalen simplices im ℝn erhalten

A mappingf of ⁿ ,n3, into itself such thatf(x ₁),f(x ₂, ...,f(x _n+1 ) are the vertices of a simplex of volume 1 ifx ₁,...,x _n+1 are the vertices of a simplex of volume 1, must be equi-affine. (This theorem is also true in casen= 2 as it was proved by Gil Martin, see W. Benz [4].)LetM ⁿ be the set of lines of ⁿ . A mapping: M ⁿ M ⁿ ,n3 such that(a ₁ ),...,(a _n(n+1)/2 ) are the edges of a simplex of volume 1 ifa ₁,...,a _n(n+1)/2 are the edges of a simplex of volume 1, must be induced by an equi-affine mapping of ⁿ .     

Iterative hyperidentities for theA n,m varieties of semigroups

Iterative hyperidentities are hyperidentities of the special formF ^a (x ₁,...,x _k =F ^a+b (x ₁,...,x _k ). This type of hyperidentity has been considered by Denecke and Pöschel, and by Schweigert. Here we consider iterative hyperidentities for the variety A_n,m of commutative semigroups satisfyingx ⁿ =x ^n+m ,n,m 1. We introduce two parameters(m, n) and(m) associated withn andm, and show thatA _nn,m satisfies the iterative hyperidentitiesF (x ₁,...,x _k =F ^+b (x ₁,...,x _k ) for every arityk. Moreover, the numbers and are minimal, making these hyperidentities irreducible in the sense of Schweigert. We also show how these hyperidentities for A_n,m may be used to prove that no non-trivial proper variety of commutative semigroups can have a finite hyperidentity basis.Presented by W. Taylor.Research supported by NSERC of Canada     

Solving systems of polynomial inequalities over a real closed field in subexponential time

Let _m= (₁,..., _m) denote an ordered field, where _i+1>0 is infinitesimal relative to the elements of _i, 0 < –i < m (by definition, ₀= ). Given a system of inequalities f₁ > 0, ..., f_s > 0, f_s+1 0, ..., f_k 0, where f_{j m} [X₁,..., X_n] are polynomials such that, and the absolute value of any integer occurring in the coefficients of the f_js is at most 2^M. An algorithm is constructed which tests the above system of inequalities for solvability over the real closure of _m in polynomial time with respect to M, ((d)ⁿd₀)^n+m. In the case _m=, the algorithm explicitly constructs a family of real solutions of the system (provided the latter is consistent). Previously known algorithms for this problem had complexity of the order ofM(d d ₀ ^{m 2U(n)} .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Maternaticheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 174, pp. 3–36, 1988.     

Cyclic Just-In-Time Sequences Are Optimal

Consider the Product Rate Variation problem. Given n products 1,...,i,...,n, and n positive integer demands d ₁,..., d_i,...,d_n. Find a sequence =₁,...,_T, T = _i=1 ⁿ d _i, of the products, where product i occurs exactly d _i times that always keeps the actual production level, equal the number of product i occurrences in the prefix ₁,..., _t, t=1,...,T, and the desired production level, equal r _i t, where r _i=d_i/T, of each product i as close to each other as possible. The problem is one of the most fundamental problems in sequencing flexible just-in-time production systems. We show that if is an optimal sequence for d ₁,...,d_i,...,d_n, then concatenation ^m of m copies of is an optimal sequence for md ₁,..., md_i,...,md_n.     

Mappings that preserve cones in Lobachevskii space

Let ⁿ be n-dimensional Lobachevskii space, and {l_x:x ⁿ} be a family of lines, parallel to a linel ₀, 0ⁿ (in a given direction). Let {c_x:Xⁿ} be a family of circular cones in ⁿ of opening with axes l_X and vertex X. Then, iff:ⁿⁿ(n>2) is a bijective mapping andf(C_x)=C _f(x), it follows thatf is a motion in the space ⁿ.Translated from Matematicheskie Zametki, Vol. 13, No. 5, pp. 687–694, May, 1973.     

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

Lexicographic quasiconcave multiobjective programming

Summary Letf _i :A R ben real-valued objective functions on a convex setA -K ^m ,K:=R orC, n, mN. Letg: A R ⁿ be defined by , where for eachxA, (i ₁ (x), ..., i _n (x)) is a permutation of (1, ...,n) such that . In this paper we treat the problem of findingx ^*A such that , wherel-max denotes the lexicographic maximum. If the f_i's are strongly quasiconcave we can reduce the problem stepwise until finally it is in the form of a scalar programming problem. Further, we consider conditions for the existence and uniqueness of a solution and discuss the relationship of the problem to the vector maximum (i.e. Pareto) and maxmin (i.e. Chebychev) problems.

---

Zusammenfassung f _i :AR seienn reellwertige Zielfunktionen über einer konvexen MengeA-K ^m ,K:=R oderC, n, mN. g:AR ⁿ sei definiert durch , wobei für jedesxA (i ₁ (x), ... i _n (x)) eine Permutation von (1, ...,n) derart ist, daß Wir betrachten das Problem, einx ^*A so zu finden, daß , wobeil-max das lexikographische Maximum bedeute. Falls dief _i stark quasikonkav sind, läßt sich das Problem stufenweise reduzieren, bis es schließlich die Gestalt eines skalaren Optimierungsproblems annimmt. Wir geben Existenz- und Eindeutigkeitsbedingungen an und besprechen Zusammenhänge mit dem Vektormaximumproblem (d.h. Pareto-Optimierung) und dem Maxmin-Problem (d.h. Tschebyscheff-Optimierung).