Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37     

On Large Values of the Divisor Function

Let d(n) denote the divisor function, and let D(X) denote the maximal value of d(n) for n X. For 0 < z 1, both lower and upper bounds are given for the number of integersn with n X, zD(X) d(n).     

Some estimates in theL p metric in the central limit theorem for additive functions

The convergence of the value distributions of a normalized sequence of strongly additive arithmetic functions to the standard normal law in theL _p metric is considered. An asymptotic formula for the variance is obtained. In both cases, the remainders are expressed in terms of the third absolute moment of the additive function. Vilnius University, Naugarduko 24, 2006 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 39, No. 1, pp. 74–80, January–March, 1999. Translated by A. Mačiulis     

Open problems in pluripotential theory

We propose a list of open problems in pluripotential theory partially motivated by their applications to complex differential geometry. The list includes both local questions as well as issues related to the compact complex manifold setting.     

ORDINAL NUMBERS IN ARITHMETIC PROGRESSION

The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers (ß + δγ)γ<γ<>r, δ ≠ 0.     

Some classes of completely monotonic functions, II

A function is said to be completely monotonic if for all x > 0 and n = 0,1,2,.... In this paper we present several new classes of completely monotonic functions. Our functions have in common that they are defined in terms of the classical gamma, digamma, and polygamma functions. Moreover, we apply one of our monotonicity theorems to prove a new inequality for prime numbers. Some of the given results extend and complement theorems due to Bustoz & Ismail, Clark & Ismail, and other researchers. 2000 Mathematics Subject Classification Primary—11A41, 26A48, 33B15; Secondary—26D15     

Short interval asymptotics for a class of arithmetic functions

Summary We provide a general asymptotic formula which permits applications to sums like <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"7"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"8"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"9"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation> \sum_{x< n\le x+y} \big(d(n)\big)^2, \quad \sum_{x< n\le x+y} d(n^3),\quad \sum_{x< n\le x+y}\big(r(n)\big)^2, \quad \sum_{x< n\le x+y}r(n^3), $$ where $d(n)$ and $r(n)$ are the usual arithmetic functions (number of divisors, sums of two squares), and $y$ is small compared to~$x$.     

On the local distribution of certain arithmetic functions

Let d(n), σ ₁(n), and φ(n) stand for the number of positive divisors of n, the sum of the positive divisors of n, and Euler’s function, respectively. For each ν ∈, Z, we obtain asymptotic formulas for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd integer m as well as for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd rational number r. Our method also applies when φ(n) is replaced by σ ₁(n), thus, improving upon an earlier result of Bateman, Erdős, Pomerance, and Straus, according to which the set of integers n such that is an integer is of density 1/2. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 315–331, July–September, 2006.     

Arithmetic Processes in Semigroups

We consider the asymptotic behavior of the distributions of stochastic processes defined by multiplicative functions in an arithmetic semigroup.     

Browder－Hartman－Stampacchia变分不等式研究概况及问题

本文介绍了Ｂｒｏｗｄｅｒ－Ｈａｒｔｍａｎ－Ｓｔａｍｐａｃｃｈｉａ变分不等式理论及应用当前研究的概况及存在的某些问题。     

Some characterizations of duality for DC optimization with composite functions

In this paper, by virtue of the epigraph technique, we first introduce some new regularity conditions and then obtain some complete characterizations of the Fenchel–Lagrange duality and the stable Fenchel–Lagrange duality for a new class of DC optimization involving a composite function. Moreover, we apply the strong and stable strong duality results to obtain some extended (stable) Farkas lemmas and (stable) alternative type theorems for this DC optimization problem. As applications, we obtain the corresponding results for a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator, respectively.     

Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

Average distribution of k-free numbers in arithmetic progressions

We obtain a new bound on the average value of the error term in the asymptotic formula for the number of k-free numbers in arithmetic progressions. In particular, we improve the results of J. Gibson (2014) and C. Hooley (1975).     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

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.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

Riordan阵与含有Genocchi数的一些恒等式

In this paper, using generating functions and Riordan arrays, we get some identities relating Genocchi numbers with Stirling numbers and Cauchy numbers.     

一种新型区间数多属性决策算法研究

随着多属性决策问题的复杂性、不确定性日益增强，基于区间数的多属性决策理论与应用研究越来越广泛。基于算子有序性的构建思想，本文提出并构建了基于有序欧几里德算子的区间数多属性决策算法模型，证明了有序欧几里德算子的单调性、齐次性和幂等性。采用基于有序欧几里德算子的区间数多属性决策方法对某火炮采购问题进行了决策计算，证明了该方法的有效性与可行性。     

The

ROSSER and SCHOENFELD have used the fact that the first 3,500,000 zeros of the RIEMANN zeta function lie on the critical line to give estimates on and . With an improvement of the above result by BRENTet al., we are able to improve these estimates and to show that the prime is greater than for . We give further results without proof.