一个二维整数瓶颈问题及其算法

本文讨论了数学模型：ｍａｘ｛ｆ（ｘ）│ｆ（ｘ）＝ｍｉｎ（１≤ｊ≤ｎ）〔ｃ１ｊｘ１ｊ＋ｃ２ｊｘ２ｊ〕，ｘ∈Ｄ｝，其中Ｄ＝｛ｘ│ｘ＝｛ｘｉｊ｝，ｎΣ（ｊ＝１）ｘｉｊ＝ａ，ｉ＝１，２，ｘｉｊ≥０且为整数｝，并给出了一个拟多项式算法。     

厄米特矩阵的迹的几点性质

应用矩阵Ａ＝（ａｉｊ）∈Ｃｎ×ｎ的弗罗伯尼范数ＡＦ和谱范数ＡＳ，研究厄米特矩阵的迹的性质，得到几个结论：Ｔｒ（ＡＢ）＝∑ｎｉ＝１λｉ∑ｎｊ＝１ｔｉｊμｊ（λｉ，μｊ分别为Ａ，Ｂ的特征值，０≤ｔｉｊ≤１，且∑ｎｉ＝１ｔｉｊ＝１，ｊ＝１，２，…，ｎ）；Ｔｒ（ＡＢ）≤Ｔｒ（Ａ）ＢＳ；Ｔｒ（ＡＢ）Ｈ（ＡＢ）］≤Ｔｒ（ＡＨＡ）［ｍａｘ１≤ｉ≤ｎλｉ］２（λｉ是Ｂ的特征值）等．     

自然数n的分拆数

自然数ｎ的分拆数陈皓（湖北邮电学校普通室）本文研究自然数ｎ的分拆数的计算方法．定义把自然数ｎ写成ｋ个不小于ｒ的非负整数ａ１，ａ２，…，ａｋ之和（假定ｒ≤ａ１≤ａ２≤…≤ａｋ）则称（ａ１，ａ２，…ａｋ）为ｎ的一个（ｋ，ｒ）分拆，把”的（ｋ，ｒ）分拆数记...     

关于丢番图方程D1x^2＋2^mD2=y^n的解数

设Ｄ１、Ｄ２、ｍ、ｘ、ｙ是适合Ｄ１〉１，Ｄ２〉１，２├Ｄ１Ｄ２，ｇｃｄ（Ｄ１，Ｄ２）＝ｇｃｄ（ｘ，ｙ）＝１的正整数，ｎ是适合ｎ├ｈ的奇素数，其中ｈ是虚二次域Ｑ（√－２＾ｍＤ１Ｄ２）的类数。本文主要证明了：方程Ｄ１ｘ＾２＋２＾ｍＤ２＝ｙ＾ｎ至多有５．１０＾１６组例外解（Ｄ１，Ｄ２，ｘ，ｙ，ｍ，ｎ）而且这些解都满足了７≤ｎ〈８．５．１０＾６以及ｙ＾ｎ〈ｅｘｐ（ｅｘｐ（ｅｘｐ４６））。     

贪婪t－相交有限序列族

设Ｆ为有限序列族，对ａ＝（ａ１，ａ２，…，ａｎ）∈Ｆ，ａｉ为整数且０≤ａｉ≤ｓｉ（整数），记ｓ（ａ）＝｛ｊ｜１≤ｊ≤ｎ，ａｊ＞０｝，ｓ（Ｆ）＝｛ｓ（ａ）｜ａ∈Ｆ｝，及Ａ｛１，２，…，ｎ｝时Ｗ（Ａ）＝Пｉ∈Ａｓｉ．称Ｆ为贪婪ｔ－相交，如对任何ａ，ｂ∈Ｆ，至少有ｔ个ａｉ，ｂｉ＞０，且Ｗ（Ａ）≥Ｗ（（｛１，２，…，ｎ｝－Ａ）＋Ｂ）对任何Ａ∈Ｓ（Ｆ）及ＢＡ（｜Ｂ｜＝ｔ－１）成立．本文得到当ｓ１＞ｓ２＞…＞ｓｎ时的最大贪婪ｔ－相交有限序列族．     

改进的R.Nevanlinna第二基本定理

设ｆ（ｚ）是超越亚纯函数，ｎ为任一非负整数，ε为任意正数，ａ＾（ｉ）ｒ＝（ｖ＝１，２，…，ｑｉ，ｉ＝０，１，…，ｎ）均为有穷非零复数，满足ｍｉｎ／１≤ｖ１＜ｖ２≤ｑｉ｜ａ＾（ｉ）ｖ１－ａ＾（ｉ）ｖ２｜≥δ＞０，ｉ＝０，１，…，ｎ。若ｆ（０）≠０，∞，П＾ｎｉ＝１ｆ（ｉ）（０）≠０，则对０＜ｒ＜＋∞有ｍ（ｒ，ｆ）＋ｍ（ｒ，１／ｆ）＋Σ＾ｕｉ＝０Σ＾ｑｉｒ＝１ｍ（ｒ，ａ＾（ｉ）ｖ，ｆ＾（ｉ）≤（２＋ε     

一类解析函数族的极值点与支撑点

设Ｇ＝｛ｆ（ｚ）：ｆ（ｚ）在│ｚ│〈１上解析，ｆ（ｚ）＝ｚ－Σｎ＝２→∞ ａｎｚ＾ｎ，ａｎ≥０，Σｎ＝２→∞ ｎａｎ≤１，Σｎ＝３→∞ｎ（ｎ－１）ａｎ≤２ａ２｝。本文找出了函数族Ｇ的极值点与支撑点。     

浅述整除与同余

浅述整除与同余四川大学唐贤江一、整数的整除性１、基本概念对于两个整数ａ、ｂ（ｂ≠０），若存在一个整数ｎ，使得ａ＝ｂｎ，则称ｂ整除ａ，或ａ被ｂ整除，记为ｂ｜ａ；ｂ整除ａ有时也称ｂ是ａ的因数，ａ是ｂ的倍数。若ｂ不能整除ａ用ｂａ表示。２、基本性质１）若ｂ｜...     

关于Andrew Granvill问题的推广

设是一个整数，对任一０＜α＜ｎ且（ａ，ｎ）＝１，显然存在唯一的整数０＜α＜ｎ－１使得αα≡１（ｍｏｄｎ）．本文的主要目的是研究差式｜α－α｜在算术级数中的分布性质，并给出一个有趣的渐近公式．     

具有四项的指数丢番图方程(Ⅲ)

根据定理 １,２和 ３;求任何一个方程 ａ~ｘ－ｂ~ｙ＝ｎ,ａ~ｘｂ~ｙ±ａ~ｚ±ｂ~ｗ±１＝０ 或ａ~ｘ±ｂ~ｙ±ａ~ｚ±ｂ~ｗ＝０（ｘ,ｙ,ｚ,ｗ∈≥０）的解都是很简单的,此处ａ,ｂ是适合 ２ ≤５ ａ,ｂ≤５０的互素的两个整数,ｎ是适合１≤ｎ≤８００００的整数．     

On a class of self-similar processes with stationary increments in higher order Wiener chaoses

We study a class of self-similar processes with stationary increments belonging to higher order Wiener chaoses which are similar to Hermite processes. We obtain an almost sure wavelet-like expansion of these processes. This allows us to compute the pointwise and local Hölder regularity of sample paths and to analyse their behaviour at infinity. We also provide some results on the Hausdorff dimension of the range and graphs of multidimensional anisotropic self-similar processes with stationary increments defined by multiple Wiener–Itô integrals.     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].