关于不同因子分解的数目

设f(n)表示分解自然数n(>1)为大于1的整数因子乘积的所有方式的数目(不计因子的顺序),并设0<β<1,N(x,β)=Card{n≤x,f(n)≥n~β}.本文分别估计了N(x,β)和f(n))的值.     

有限酉群作用下子空间轨道按和生成的格

设F_q2⁽ⁿ⁾是 F_q2上的 n 维行向量空间, U_n( F_q2)是 F_q2上的 n 阶酉群. 设M(m, r; n)是U_n(F_q2}作用下的一个子空间轨道, L(m, r; n)是 M (m, r; n)中子空间的和生成的集合.该文讨论了各个轨道生成的集合L(m, r; n)之间的包含关系, 给出了一个子空间是属于给定的由M(m, r; n)生成的集合L(m, r, n)中的一个元素的条件, 以及L}(m, r; n)做成几何格的条件.     

时滞差分方程的吸引性

本文给出了时滞差分方程x_n+1=x_nf(x_n,x_n-1),n=0,1,…解的全局吸引性的一个新的充分条件;作为应用,部分解决了G.Ladas的一个猜想.     

一些与Dyck路有关的数的恒等式

本文通过Cauchy留数定理和算子方法导出了一些形如∑_i=0ⁿ (-1)^n-i(n i)U_{m+k+i, k+i} =f(n) 和∑_i=0²ⁿ(-1 )ⁱ(2n i) U_{m+k+i, k+i} = g(n)的差分恒等式,这里U_{n, κ}表示Dyck路在不同条件下的计数公式,f(n),g(n)与m(n)只和n有关的函数.     

小区间中的整数的最大素因子(Ⅱ)

设 P(x)为n 的最大素因子.本文证明了 P(x)>x~(0.71)对充分大的 x 成立.     

p-值星形函数的子类

Let M_n+p-1 denote the class of functions f(z) = 1/z^p+a₀/z^p-2+a₁/z^p-2+…+a_n+p-1zⁿ+…, regular and p-valent in the annulus 0<|z|<1 and satisfying Re((D^n+p f(z))/(D^n+p-1 f(z)))-2)<-(n+p-1)/(n+p),|z|<1,n>-p where D^n+p-1 f(z)=1/z^p((z^n+2p-1f(z))/(n+p-1)!)^(n+p-1).M_n+p?M_n+p-1 is proved. Since M₀ is the subclass of p-valent meromorphically starlike functions, all functions in Mn + p-1 are p-valent meromorphically star-like functions. Further the integrals of functions in M_n+p-1, are considered.     

用Hermite-Fejér型插值多项式逼近连续函数

Let f(x)∈C_[-1,1],T_n(x)=cos (n arccos x),U_n(x)=(sin((n+1)arccosx))/(1-x²)^1/2,P_n(x) be the Legendre polynomials of degree n. And let ω(t ) be a given modulus of continuity, H_ω={f|ω(f,t)≤ω(t)}.A. K. Sharma and J. Tzimbalario(J. Appro. Th., 13(1975), 431-442) considered the operators L_n,p (f, x) (p= 0, 1, 2,3) and obtained some theorems.In this paper, we prove the following theorems.     

关于Haar 酉元的一个注记

设M 是一个Ⅱ₁ 型因子, τ 是M 的正规的、忠实的迹态, U ∈ M 是一个Haar 酉元, p ∈ M是一个投影, τ (p) = (1/n) (n > 3, n ∈ Z), p 和U 自由. 我们用初等方法证明了若pUp = wh 是pUp 的极分解, 则w 也是一个Haar 酉元且w 和h 是自由的. 我们还给出了pUp 的矩的刻画.     

具有正交的(g,f)-因子分解的子图

仅考虑简单图.设G是一个图,g(x)和f(x)是定义在V(G)上的整数值函数,且对任意的x∈V(G),设g(x)≤f(x),H是G的一个子图,F={F₁,F₂,…,F_t}是G的一个因子分解,如果对所有的1≤i≤t, |E(G)∩E(F_i)|=1,则称F与H正交.证明了:设G是一个(mg(x)+k,mf(x)-k)-图,其中对任意的x∈V(G),g(x)≥1或f(x)≥5是定义在V(G)上的整数值函数,1≤k<m,则存在一个子图R满足对G的任意子图H，|E(H)|=k,R有(g,f)-因子分解与H正交.     

n × n 上三角算子矩阵的单值扩张性以及应用*

设X_i是无穷维复Banach空间, L(X_j,X_i)是X_j到X_i上的有界线性算子全体.考虑 n × n 上三角算子矩阵T=(T_ij)_1≤j≤n, 其中T_ij L(X_j,X_i),1≤j≤n; T_ij=0, i>j.本文研究了T的单值扩张性, 通过考察集合S(T)={λ∈C}: T在点λ没有SVEP},证明了S(T)在i=1 ? nS(T_i)中退化,进而给出等式S(T)=i=1 ? n S(T_i)成立的条件. 同时, 考察了T的单值扩张性扰动,得到了S(T)保持对角稳定时T_i所需的条件并予以证明, 同时举例说明这些条件的合理性.最后, 给出单值扩张性关于谱σ(T)和局部谱σT (x)的应用, 得到了谱扰动和局部谱扰动不变的新条件.     

On the largest prime factor of shifted primes

For any integer n ≥ 2, let P(n) be the largest prime factor of n. In this paper, we prove that the number of primes p ≤ x with P(p-1) ≥ p~c is more than(1-c + o(1))π(x) for 0 c 1/2. This extends a recent result of Luca, Menares and Madariaga for1/4≤ c ≤1/2. We also pose two conjectures for further research.     

Dynamics of a Function Related to the Primes

Let n = p1p2 ··· pk, where pi(1 ≤ i ≤ k) are primes in the descending order and are not all equal. Let Ωk(n) = P(p1 + p2)P(p2 + p3) ··· P(pk-1+ pk)P(pk+ p1), where P(n) is the largest prime factor of n. Define w0(n) = n and wi(n) = w(wi-1(n)) for all integers i ≥ 1. The smallest integer s for which there exists a positive integer t such thatΩs k(n) = Ωs+t k(n) is called the index of periodicity of n. The authors investigate the index of periodicity of n.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.     

Products of Ratios of Consecutive Integers

Take the product of the numbers (n/(n+1))^∊_n for 1≤ n < N, where each ∊_n is ± 1. Express the product as a/b in lowest terms. Evidently the minimal possible value for a over all choices for ∊_n is 1; just take each ∊_n = 1, or each ∊_n = 0. Denote the maximal possible value of a by A(N). It is known from work of Nicolas and Langevin that (log 4+o(1))N≤ log A(N)≤(2/3+o(1))Nlog N. Using the Rosse–Iwaniec sieve, we improve the lower bound to the same order of magnitude as the upper bound.For Jean-Louis Nicolas, on his sixtieth birthday2000 Mathematics Subject Classification: Primary—11N56; Secondary—11N36     

The estimate for mean values on prime numbers relative to \frac{4} {p} = \frac{1} {{n_1 }} + \frac{1} {{n_2 }} + \frac{1} {{n_3 }}

If n is a positive integer,let f （n） denote the number of positive integer solutions （n 1,n 2,n 3） of the Diophantine equation 4/n=1/n₁ + 1/n₂ + 1/n₃.For the prime number p,f （p） can be split into f 1 （p） + f 2 （p）,where f i （p） （i=1,2） counts those solutions with exactly i of denominators n 1,n 2,n 3 divisible by p.In this paper,we shall study the estimate for mean values ∑ p相似文献   

Additive problems for integers with a given number of prime divisors

The asymptotics of sums of the form Στ(|bn−a|) (summation overn<N, ω(n)=k) is studied, whereω(n) is the number of distinct prime divisors ofn, andτ(n) is the number of all divisors. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 749–762, May, 1998. In conclusion, the author wishes to express his gratitude to Professor N. M. Timofeev for valuable advice. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00502.     

On the inverse problem relative to dynamics of the <Emphasis Type="Italic">w</Emphasis> function

Let P be the set of prime numbers and P(n) denote the largest prime factor of integer n > 1. Write

一类特殊的有限循环环

证明了一类n阶(n=P_1P_2…p_m,p_i(i=1,2,…,m)互异为素数)环是有限循环环,并讨论了他们的结构及相关性质,最后给出了这类n阶环有零因子或有子域的充要条件.主要结果:P_1P_2…P_m阶环共有2^m个,它们是(p_(1m个,它们是(p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2^(m-1)个,它们是p_(1(m-1)个,它们是p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其.中k_i=0,k_j=0或1,1≤j≤m,j≠i.