On an Inequality for the Entropy of a Probability Distribution

We strengthen a theorem of Allouche, Mendès France and Tenenbaum and also a recent generalization of Daróczy.     

Instants of small amplitude of brownian motion and application to the Kubilius model

Let W(t), t ≥ 0, be the standard Brownian motion. We study the size of the time intervals I which are admissible for the long range of slow increase, namely given a real z > 0, $\sup _{t \in I} {{\left| {W(t)} \right|} \mathord{\left/ {\vphantom {{\left| {W(t)} \right|} {\sqrt t \leqslant z}}} \right. \kern-0em} {\sqrt t \leqslant z}}$ . We obtain optimal results in terms of class test functions and, by means of the quantitative Borel-Cantelli lemma, a fine frequency result concerning their occurences. Some of these results extend to sums of independent random variables by means of Sakhanenko’s invariance principle. By also using this device to transfer the results to the Kubilius model, we derive applications to the prime number divisor function. We obtain refinements of some results recently proved by Ford and Tenenbaum in [4].     

Sommes D'Exponentielles et Entiers Sans Grand Facteur Premier

Let S(x,y) be the set S(x,y)= 1 n x : P(n) y, where P(n) denotesthe largest prime factor of n. We study , where f is a multiplicative function. When f=1and when f=µ, we widen the domain of uniform approximationusing the method of Fouvry and Tenenbaum and making explicitthe contribution of the Siegel zero. Soit S(x,y) l'ensemble S(x,y)= 1 n x : P(n) y, désigne le plus grand facteur premier den. Nous étudions , lorsque f est une fonction multiplicative. Quand f=1 et quand f=µ,nous élargissons le domaine d'approximation uniformeenutilisant la méthode développée par Fouvryet Tenenbaum et en explicitant la contribution du zérode Siegel. 1991 Mathematics Subject Classification: 11N25, 11N99.     

Approximating the number of integers free of large prime factors

Define to be the number of positive integers such that has no prime divisor larger than . We present a simple algorithm that approximates in floating point operations. This algorithm is based directly on a theorem of Hildebrand and Tenenbaum. We also present data which indicate that this algorithm is more accurate in practice than other known approximations, including the well-known approximation , where is Dickman's function.

     

Approximating the number of integers without large prime factors

denotes the number of positive integers and free of prime factors . Hildebrand and Tenenbaum gave a smooth approximation formula for in the range , where is a fixed positive number . In this paper, by modifying their approximation formula, we provide a fast algorithm to approximate . The computational complexity of this algorithm is . We give numerical results which show that this algorithm provides accurate estimates for and is faster than conventional methods such as algorithms exploiting Dickman's function.

     

How quadratic are the natural numbers?

Abstract. For natural numbers n we inspect all factorizations n = ab of n with a ￡ ba \le b in \Bbb N\Bbb N and denote by n=a_n b_nn=a_n b_n the most quadratic one, i.e. such that b_n - a_nb_n - a_n is minimal. Then the quotient k(n) : = a_n/b_n\kappa (n) := a_n/b_n is a measure for the quadraticity of n. The best general estimate for k(n)\kappa (n) is of course very poor: 1/n ￡ k(n) ￡ 11/n \le \kappa (n)\le 1. But a Theorem of Hall and Tenenbaum [1, p. 29], implies(logn)^-d-e ￡ k(n) ￡ (logn)^-d(\log n)^{-\delta -\varepsilon } \le \kappa (n) \le (\log n)^{-\delta } on average, with d = 1 - (1+log₂  2)/log2=0,08607 ?\delta = 1 - (1+\log _2 \,2)/\log 2=0,08607 \ldots and for every e > 0\varepsilon >0. Hence the natural numbers are fairly quadratic.¶k(n)\kappa (n) characterizes a specific optimal factorization of n. A quadraticity measure, which is more global with respect to the prime factorization of n, is k^*(n): = ?_{1 ￡ a ￡ b, ab=n} a/b\kappa ^*(n):= \textstyle\sum\limits \limits _{1\le a \le b, ab=n} a/b. We show k^*(n) ~ \frac 12\kappa ^*(n) \sim \frac {1}{2} on average, and k^*(n)=W(2^{\frac 12(1-e) log n/log ₂n})\kappa ^*(n)=\Omega (2^{\frac {1}{2}(1-\varepsilon ) {\log}\, n/{\log} _2n})for every e > 0\varepsilon>0.     

An estimate for the number of integers without large prime factors

denotes the number of positive integers and free of prime factors y$">. Hildebrand and Tenenbaum provided a good approximation of . However, their method requires the solution to the equation , and therefore it needs a large amount of time for the numerical solution of the above equation for large . Hildebrand also showed approximates for , where and is the unique solution to . Let be defined by for 0$">. We show approximates , and also approximates , where . Using these approximations, we give a simple method which approximates within a factor in the range , where is any positive constant.

     

非线性微分系统解的有界性和周期解的存在性

本文运用了比较新的手法,证明了非线性微分系统(dx)/(dt)=1/(a(x))[c(y)-b(x)];(dy)/(dt)=-a(x)[h(x)-e(t)](1)(其中a(x),b(x),h(x),c(y),e(t)为连续可微函数,x,y∈R,t∈[0,+∞),且a(x)>0)解的有界性及周期解的存在性,并应用该结论讨论了强迫振动方程:x+(f(x)+g(x)x)x+h(x)=e(t)(2)(其中f(x),g(x)为连续可微函数,x∈R,h(x),e(t)同上)解的有界性及周期解的存在性.     

分形空间的局部紧性及网极限

对于完备度量空间 (X ,d) ,研究了X的局部紧性与相应分形空间 (H(X) ,h)的局部紧性之间的关系 ,得到结论 :(H(X) ,h)是局部紧的当且仅当X是局部紧的 .另一方面 ,给出了 (H(X) ,h)中收敛网的极限通过并、交及闭包运算的表示 .     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.     

半鞅序列积分误差的极限过程的收敛定理

Jacod, Jakubowski和M\'emin讨论了与单个独立增量过程$X$的误差过程$^n\!X =X_t-X_{[nt]/n}$相关的积分误差过程$Y^n(X)$和$Z^{n,p}(X)$, 研究了半鞅序列$\{(nY^n(X),nZ^{n,p}(X))\}_{n\ge 1}$的极限定理. 记半鞅序列$\{(nY^n(X),nZ^{n,p}(X))\}_{n\ge1}$的极限过程为$(Y(X),Z^p(X))$, Jacod等给出了其极限过程$(Y(X)$, $Z^p(X))$的表达式. 本文将研究半鞅序列$\{X^n\}_{n\ge1}$积分误差的极限过程$Y(X^n)$和$Z^{p}(X^n)$的收敛定理, 主要研究半鞅序列$\{(X^n,Y(X^n),Z^p(X^n))\}_{n\ge1}$的依分布弱收敛和依分布稳定收敛.     

图的邻接矩阵的行列式与积和式的递推表达式

设A(G)是简单图G的邻接矩阵,H是由G的独立边和不交圈组成的生成子图的集合,e是H中某个图的独立边,C是H中图的圈,且e∈E(C).记G-e是G的删边子图,G\W是从G中删去导出子图W中的顶点及其关联边后得到的图.那么A(G)的行列式为detA(G)=detA(G-e)-detA(G\e)-2(-1)~(|V(C)|)detA(G\C)A(G)的积和式为perA(G)=perA(G-e)+perA(G\e)+2perA(G\C)这里,C取遍H中图的经过边e的圈.     

全有向图的幂敛指数

设D为有向图，T（D）为D的全有向图（Total-digraph),k(D)和p(D)分别为D的幂敛指数（Index of convergence)与周期（Period)，本文证明了。1，对任意非平凡有向图D,p(T(D))=1,k(T(D))≤max{2p(D)-1,2K(D) 1}，特别地，当D为本原有向图时，k(T(D))≤k(D) 1，当D不含有向圈时，k(T(D))=2k(D)-1；当D为有向圈Cn时，k(T(D))=2n-1.2。对任意非平凡强连通图D,k(T(D))≥Diam(D) 1。我们还证明了以上界是不可改进的最好界。     

一阶非线性周期方程的奇异点方法

本文应用奇异点理论,在g(x)为凹(凸)型函数时,给出周期系统(?)+a(t)g(x)=h(t)整体等价于Whitney意义下的尖点映射的结果.精确地说,算子Fx(t)=(?)+a(t)g(x(t))的奇异值集F(∑)为单连通超曲面并且将C[0,1]分成两个连通分支A1和A3,使得:(1)对周期为1的连续函数p(t)∈A1有唯一解.(2)对周期为1的连续函数p(t)∈A3恰有三个周期解.进一步,尖点集C的像集F(C)是C[0,1]中的,余维数等于2的子流形.对p∈F(C)有唯一解,而对p(t)∈F(∑)\F(C)恰有两个周期解.     

算子权移位的换位代数的交换性

令T是以{Wk}∞k=1B(Cn)为权序列的内射算子权移位.设T是强不可约的,而且sup1k<∞‖W-1k‖< ∞.用A′(T)表示T的换位代数,radA′(T)表示A′(T)的Jacobson根.本文刻划了radA′(T)并且证明了商代数A′(T)/radA′(T)是交换的.     

关于Thue方程的解数

设ｍ是正整数，ｆ（Ｘ，Ｙ）＝ａ０Ｘｎ＋ａ１Ｘ（ｎ－１）Ｙ＋．．．＋ａｎＹｎ∈Ｚ［Ｘ，Ｙ］是Ｑ上不可约化的叫ｎ（ｎ≥３）次齐次多项式。本文证明了：当ｇｃｄ（ｍ，ａ０）＝１，ｎ≥４００且ｍ≥１０（３５）时，方程｜ｆ（ｘ，ｙ）｜＝ｍ，ｘ，ｙ∈ｚ，ｇｃｄ（ｘ，ｙ）＝１，至多有６ｎｖ（ｍ）组解（ｘ，ｙ），其中ｖ（ｍ）是同余式Ｆ（ｚ）＝ｆ（ｚ，１）≡０（ｍｏｄｍ）的解数。特别是当ｇｃｄ（ｍ，ＤＦ）＝１时，该方程至多有６ｎ（ω（ｍ）＋１）组解（ｘ，ｙ），其中ＤＦ是多项式Ｆ的判别式，ω（ｍ）是ｍ的不同素因数的个数．     

有限级超越整函数的差分多项式的值分布

研究了差分多项式H(z)=POk∑(i=1)a_if(z+c_i)的值分布,其中f是有限级超越整函数,P(f)是,的多项式,κ≥2,ci(i=1,…,k)是互不相同的常数,α_i(i=1,…,κ)是非零常数.得到了H(z)-a和H(z)-α(z)的零点的个数的估计,其中a∈C且α(z)(■0)为小函数.讨论了H(z)的非零有限Borel例外值的不存在性.     

Structure of Incidence Algebras of graphs

In this paper, we study the incidence algebra I (A, γ) of the category of paths in a (oriented multi-) graph γ over a ring A.We describe relationships between algebraic properties of I(A, We describe relationships between algebraic properties of I(A, γ) and combinatorial features of γ. Specifically, we give necessary and sufficient conditions on γ and A in order that I(A, γ) satisfy a polynomial identity, be prime, semi-prime, o r right Noether-ian. We also determine the nil radical B (A, γ) of I(A, γ) for a large class of rings A, and show that under certain finiteness conditions, IiA, γ)/B (A, γ) i s isomorphic to the direct product of the incidence algebras of the strongly connected components of γ     

一类积分微分方程周期解的存在性和唯一性

本文考虑具连续时滞和离散时滞的非线性积分微分方程x'(t)=A(t,x(t))x(t)+∫-∞tC(t,s)x(s)ds+∑i=1i gi(t,x(t—τi(t)))+b(t)和x’(t)=f(t,x(t))+∫-∞tC(t,s)x(s)ds+∑i=1igi(t,x(t-τi(t)))+b(t)周期解的存在性和唯一性问题,这里t∈R,x∈Rn;A(t,x),C(t,s)为n×n阶连续的函数矩阵; f(t,x),gi(t,x)(i=1,2,…,l),b(t)是n维连续向量.通过利用线性系统指数型二分性理论和泛函分析方法研究上述系统,获得了保证其周期解存在性、唯一性的充分性条件.我们除了实质性的推广和改进了已有的结果外,还得到三个新的定理,这是用已有的方法无法获得的(见文[1-30]).     

一类缺项算子矩阵的谱扰动

有界线性算子的点谱和剩余谱分别可进-步细分为两类:σ_(p1),σ_(p2)和σ_(r1),σ_(r2).设H,K为无穷维可分的Hilbert空间,本文将对于给定的A ∈B (H),B ∈B(K),给出了缺项算子M_C=(AC/OB)关于分类后所得四种谱的扰动结果.