A Comparative Result for Multiplicative Functions

In this paper, we compare the asymptotic behavior of _nx f(n) and _nx g(n) for multiplicative functions f and g, respectively, where |f| g. Our results extend relevant theorems by E. Wirsing and G. Hal@aacute;sz. The methods we use are elementary.     

On Logarithmic Smoothing of the Maximum Function

We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g of f itself, where >0 denotes the approximation parameter. The one-parametric family g converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g , where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x().     

Sur les équations fonctionnelles auxq-différences

Summary In this paper, we study the convergence of formal power series solutions of functional equations of the formP _k(x)(^[k](x))=(x), where ^[k] (x) denotes thek-th iterate of the function.We obtain results similar to the results of Malgrange and Ramis for formal solutions of differential equations: if(0) = 0, and(0) =q is a nonzero complex number with absolute value less than one then, if(x)=a(n)x ⁿ is a divergent solution, there exists a positive real numbers such that the power seriesa(n)q ^sn(n+1)2 x ⁿ has a finite and nonzero radius of convergence.

     

Skew Brownian motion-type of extensions

We consider a class of possible extensions of a given symmetric Feller processZ _t fromR{0} to the entire real lineR, depending on a parameter [0, 1]. It is proved that the proposed extension exists if =1/2; for 1/2, exists if and only ifZ _t does not jump over 0 (e.g., ifZ _t is a diffusion).     

Weighted Composition Operators on Bergman and Dirichlet Spaces

Let H() denote a functional Hilbert space of analytic functions on a domain . Let w : C and : be such that w f is in H() for every f in H(). The operator wC given by f w f is called a weighted composition operator on H(). In this paper we characterize such operators and those for which (wC )* is a composition operator. Compact weighted composition operators on some functional Hilbert spaces are also characterized. We give sufficient conditions for the compactness of such operators on weighted Dirichlet spaces.     

The Logarithmic Frequency of Values of Additive Functions

We consider the weak convergence of distribution functions (_mx 1/ m)^-1 _{m x},f_x(m)x is a set (x 2) of strongly additive functions such that f_x(p){0,1} for each prime number p.     

Critical sets in parametric optimization

We deal with one-parameter families of optimization problems in finite dimensions. The constraints are both of equality and inequality type. The concept of a generalized critical point (g.c. point) is introduced. In particular, every local minimum, Kuhn-Tucker point, and point of Fritz John type is a g.c. point. Under fairly weak (even generic) conditions we study the set consisting of all g.c. points. Due to the parameter, the set is pieced together from one-dimensional manifolds. The points of can be divided into five (characteristic) types. The subset of nondegenerate critical points (first type) is open and dense in (nondegenerate means: strict complementarity, nondegeneracy of the corresponding quadratic form and linear independence of the gradients of binding constraints). A nondegenerate critical point is completely characterized by means of four indices. The change of these indices along is presented. Finally, the Kuhn-Tucker subset of is studied in more detail, in particular in connection with the (failure of the) Mangasarian-Fromowitz constraint qualification.     

More about signatures and approximation

Consider a non-singular real algebraic varietyM together with a codimension 1 real algebraic setY M. SupposeY=^–1(0) for a smooth function :M and denote by the signature induced by onM–Y. The following results are proved.For compactM, is induced by a regular functionf R(M) if and only if the setY ^c, where changes sign, is the union of the (d–1)-dimensional parts of some irreducible components ofY if and only if can be approximated by regular functions with the same zero-set. For non-compactM this is true only ifR(M) is a factorial ring. Similar results are proved whenM andY are real analytic instead of algebraic.Dedicated to the memory of our friend Mario RaimondoThe authors are members of GNSAGA of CNR. This work is partially supported by MURST.     

The addition formula for theta functions

Summary In this paper we solve the functional equationx(u + v)(u – v) = f ₁(u)g₁(v) + f₂(u)g₂(v) under the assumption thatx, , f ₁, f₂, g₁, g₂ are complex-valued functions onR ⁿ ,n N arbitrary, and 0 and 0 are continuous. Our main result shows that, apart from degeneracy and some obvious modifications, theta functions of one complex variable are the only continuous solutions of this functional equation.     

On the equation of similar profiles

Summary Considerf+ ff+ (1–f²)+ f=0 together with the boundary conditionsf(0)=f(0)=0,f ()=1. If=–1,>0, arbitrary there is at least one solution which satisfies 0<f<1 on (0, ). By the additional conditionf>0 on (0, ) or, alternately 0<1, the uniqueness of the solution is demonstrated.If=1,<0, arbitrary the existence of solutions for which –1<f<0 in some initial interval (0,t) and satisfying generallyf>1 is established. In both problems, bounds forf (0) and qualitative behavior of the solutions are shown.

---

Sommario Si consideri il problema definito dall'equazionef+ f f+ (1–f²)+ f=0 e dalle condizioni al contornof(0)=f (0)=0,f()=1. Assumendo=–1,>0, arbitrario si dimostra che esiste almeno una soluzione che soddisfa 0<f<1 nell'intervallo (0, ). Se in aggiunta si ipotizzaf>0 in (0, ), oppure 0<=1, l'unicità délia soluzione è assicurata.Successivamente si considéra il problema di valori al contorno con=1,<0, arbitrario. In questo caso esiste un'intera classe di soluzioni che soddisfano –1<f<0 in un intorno dell'origine e tali chef>1, in generale.Di detti problemi viene studiato il comportamento délle soluzioni e vengono determinate dalle maggiorazioni e minorazioni del valoref(0).

     

Note on initial topologies on rational vector spaces induced by realvalued linear mappings

LetG be a vector space over the field of rational numbers andf, g:G -linear mappings. equipped with the usual norm topology. Denote by _f , _g the initial topologies onG induced byf respectivelyg.Then the following result holds: If there is a nonvoid open setU whose complement contains at least one inner point such thatf ^–1 U _g , then there is ac withf=cg. In particular, iff0, the topologies coincide.Furthermore, a -linear mappingh: (G, _f )(G, _g ) is continuous if and only if there is a real constantc withg ^o h=cf.Dedicated to Professor János Aczél on his 60th birthday     

Numerical application of Euler's series transformation and its generalizations

Summary A nonlinear generalizationÊ _z of Euler's series transformation is compared with the (linear) Euler-Knopp transformationE _z and a twoparametric methodE . It is shown how to applyE orE _, to compute the valuef(z_o) of a functionf from the power series at 0 iff is holomorphic in a half plane or in the cut plane. BothE andE _, are superior toÊ _z . A compact recursive algorithm is given for computingE andE _,.     

Fonctions séparément harmoniques,un théorème de type Terada

Given D a domain in , G an open set in and E a subset of D verifying the harmonic analogue of Local Polynomial Condition of Leja at some point in D. We prove that if f(x, y) is a complex function defined on D × G such that– f(x, ) is harmonic on G for every fixed x E,– f(, y) is harmonic on D for every fixed y G,then f is harmonic in (x, y) on D × G.     

Fundamental equation of information revisited

Summary This paper presents a new, shorter and more direct proof of the following result of J. Aczél and C. T. Ng: IfM: J R (J =]0, 1[ ^k ) is both multiplicative and additive, then the general solution: J R of(x) + M(1 – x)(y/1 – x) = (y) + M(1 – y)(x/1 – y) (x, y, x + y J) is given by(x) = ifM = 0,(x) = M(x)[L(x) + ] + M(1 – x)L(1 – x) ifM 0,where is an arbitrary constant andL: J R is an arbitrary solution of the logarithmic functional equationL(xy) = L(x) + L(y) (x, y J). Also, some extensions of this result to fields more general than the reals are given.     

Strong rightD-domains

An integral domainR is called rightD-domain if its lattice of all right ideals is distributive. In § 2 a sufficient condition for an integral domainR is given such thatR is a rightD-domain if and only ifR is a leftD-domain. For example each integral domain which is algebraic over its center satisfies this criterion. Furthermore, a rightD-domain is called strong if its lattice of all fractional right ideals is distributive. Examples of strong rightD-domains are given in §4. Each overring of a strong rightD-domain is also a strong rightD-domain whereas arbitrary rightD-domains may have overrings which are no rightD-domains. Section 3 is mainly concerned with the set * of all left invertible fractional right ideals and the mapping :**,II _l ^–1 whereI _l ^–1 denotes the left inverse ofI. For example, equivalent conditions are given for * to be a sublattice of and it is shown that is bijective if and only if (IJ)=(I)+(J) holds for allI,J*. Finally, §5 deals with (right)D-domains which are algebraic over their centersC. It is proved thatR is invariant if and only ifC is a commutative Prüfer domain andR the integral closure ofC inQ(R).     

Homotopies for computation of fixed points on unbounded regions

Givenf: R ⁿ R ^n* with some conditions, our aim is to compute a fixed pointx f(x) off; hereR ⁿ isn-dimensional Euclidean space andR ^n* is the collection of nonempty subsets ofR ⁿ . A typical application of the algorithm can be motivated as follows: Beginning with the constant mapf ₀:R ⁿ {0} R ⁿ and its fixed pointx ₀ = 0, we deformf _t ast tof f and follow the pathx _t of fixed points off _t . Cluster points of thex _t 's ast are fixed points off. This research was supported in part by Army Research Office-Durham Contract DAHC-04-71-C-0041 and by National Science Foundation Grant GK-5695.     

The connection between the zeros of the ζ-function and sequences(g(p)), p prime,mod 1

In this paper we give the connection between the zeros of the -function and sequences(g(p)), p prime, mod 1 ifg(x)=x for 0, >0 or ifg(X) is a polynomial in .     

The Product of Independent Random Variables with Regularly Varying Tails

A distribution is said to have regularly varying tail with index – (0) if lim _x(kx,)/(x,)=k ^– for each k>0. Let X and Y be independent positive random variables with distributions and , respecitvely. The distribution of product XY is called Mellin–Stieltjes convolution (MS convolution) of and . It is known that D() (the class of distributions on (0,) that have regularly varying tails with index –) is closed under MS convolution. This paper deals with decomposition problem of distributions in D() related to MS convolution. A representation of a regularly varying function F of the following form is investigated: F(x)= _k=0 ^n–1 b _k f(a ^k x), where f is a measurable function and a and b _k (k=1,...,n–1) are real constants. A criterion is given for these constants in order that f be regularly varying. This criterion is applicable to show that there exist two distributions and such that neither nor belongs to D() (>0) and their MS convolution belongs to D().     

On the Growth of the Maximum of the Modulus of an Entire Function on a Sequence

Let M _f(r) and _f(r) be, respectively, the maximum of the modulus and the maximum term of an entire function f and let be a continuously differentiable function convex on (–, +) and such that x = o((x)) as x +. We establish that, in order that the equality be true for any entire function f, it is necessary and sufficient that ln (x) = o((x)) as x +.     

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.