稀疏素数集中的Waring-Goldbach问题(Ⅱ)

本文研究了Waring-Goldbach问题(k=2)与Piatetski-Shapiro素数定理的混合问题,从而进一步深化了华罗庚教授的经典结果.     

A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule

Throughout this paper, the authors introduce a new condition, defined by Assumption  S^′$S^{\prime }$, which establishes a necessary and sufficient condition for the validity of the strong duality between a convex optimization problem and its Lagrange dual. This work will be focused on the context of emptiness of the interior of the ordering cone and convexity of the equality constraints. Moreover, this new condition will be necessary and sufficient for the infinite dimensional Lagrange multiplier rule. This new principle will find application to the elastic–plastic torsion problem, to the continuum model of transportation and to a problem with quadratic equality constraint with connected to evolutionary illumination and visibility problems.     

稀疏素数集中的Waring-Goldbach问题

本文研究了Ｗａｒｉｎｇ Ｇｏｌｄｂａｃｈ问题（ｋ＝２）与Ｐｉａｔｅｔｓｋｉ Ｓｈａｐｉｒｏ素数定理的混合问题，从而进一步深化了华罗庚教授的经典结果     

Lehmer问题的两个推广

设素数P>2,整数C与P互素．对任意整数1≤a≤P-1,存在惟一的整数 1≤b≤P-1满足ab≡c mod P．Lehmer建议我们研究a与b的奇偶性不同的情形．本文给出了这一问题的两个推广,并获得了两个有趣的混合均值公式．     

关于Thompson问题

1987年本文第二作者给J.G.Thompson教授的信中提出猜想:所有有限单群S,都能够用S的阶和S的元的阶的集合统一的刻画.在回信中,Thompson提出了他的关于有限群G可解性判断的问题.当G的素图非连通时,本文给出了J.G.Thompson问题的肯定回答.     

On the Waring-Goldbach Problem for Fourth and Fifth Powers

It is shown that every sufficiently large integer congruentto 14 modulo 240 may be written as the sum of 14 fourth powersof prime numbers, and that every sufficiently large odd integermay be written as the sum of 21 fifth powers of prime numbers.The respective implicit bounds 14 and 21 improve on the previousbounds 15 (following from work of Davenport) and 23 (due toThanigasalam). These conclusions are established through themedium of the Hardy-Littlewood method, the proofs being somewhatnovel in their use of estimates stemming directly from exponentialsums over prime numbers in combination with the linear sieve,rather than the conventional methods which ‘waste’a variable or two by throwing minor arc estimates down to anauxiliary mean value estimate based on variables not restrictedto be prime numbers. In the work on fifth powers, a switchingprinciple is applied to a cognate problem involving almost primesin order to obtain the desired conclusion involving prime numbersalone. 2000 Mathematics Subject Classification: 11P05, 11N36,11L15, 11P55.     

Existence and asymptotic behaviour of solutions of a nonlinear evolution problem

We prove existence and asymptotic behaviour of a weak solutions of a mixed problem for where A is the pseudo-Laplacian operator.     

一类两点边值问题的多重非负解

该文考虑两点边值问题[1/q(t)][q(t)y′(t)]′+p(t)f(y(t))= 0,λ_1 y(α)-λ_2y′(α)=0 and y(β)=B非负解的存在性, 其中p(t)可能在t=α或t=β附近具有奇异性, f(0)≥0, lim_(y→+∞)f(y)/y=+∞, 并且存在y>0, 使得f(y)<0.      

On a problem of Recaman and its generalization

We solve some cases of a conjecture of Pomerance concerning reduced residue systems modulo k consisting of the first φ(k) primes not dividing k. We cover the case when k is a prime, thus giving a complete solution to a problem of Recaman.     

次线性条件下奇异三阶微分方程周期边值问题解的全局结构

讨论三阶微分方程周期边值问题解的全局结构,其中ρ∈(0,1/3~(1/2))为常数,λ∈R~+=[0,+∞)为参数,f在t=0,t=2π和u=0处有奇异性,关于u处满足次线性增长条件。     

A discontinuous functional differential equation

In this paper we give a sufficient condition for the existence of maximal and minimal solutions to a discontinuous functional differential equation x′(t)=f(t,x(t),x(·)), x(0)=0. We apply the result to establish an existence theorem for the Darboux problem for a partial differential equation.     

Gap,cosum and product properties of the θ′ bound on the clique number

In a paper published in 1978, McEliece, Rodemich and Rumsey improved the Lovász bound θ for the maximum clique problem. This strengthening has become well known under the name Lovász–Schrijver bound and is usually denoted by θ′. This article now deals with situations where this bound is not exact. To provide instances for which the gap between this bound and the actual clique number can be arbitrarily large, we establish homomorphy results for this bound under cosums and products of graphs. In particular we show that for circulant graphs of prime order there must be a positive gap between the clique number and the bound.     

Exact number of positive solutions for semipositone problems

This paper is concerned with the exact number of positive solutions for the boundary value problem ^′(|y^′|^p−2y^′)+λf(y)=0 and y(−1)=y(1)=0, where p>1 and λ>0 is a positive parameter. We consider the case in which both f(u) and g(u)=(p−1)f(u)−uf^′(u) change sign exactly once from negative to positive on (0,∞).     

A second-order Cauchy problem in a scale of Banach spaces and application to Kirchhoff equations

In a scale of Banach spaces we study the Cauchy problem for the equation u^′′=A(Bu(t),u), where A is a bilinear operator and B is a completely continuous operator. Obtained results are applied to prove existence of solutions in the Gevrey class for Kirchhoff equations.     

Rewriting systems in alternating knot groups with the Dehn presentation

Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the Dehn presentation of the knot group of a tame, prime, alternating knot, with a regular and common projection has a finite and complete rewriting system. Although there are rules in the rewriting system with left-hand side a generator and which increase the length of the words we show that the system is terminating.      

Exact algorithm for solving a special fixed-charge linear programming problem

A branch-and-bound algorithm (A) for solving a fixed-charge linear programming problem (P) involving identical fixed charges, one equality constraint, and explicit bounds on the variables is presented. Problem (P) can serve as a mathematical model for profit optimization in sawn timber production. Some theoretical considerations upon a fixed-charge problem (P), arising from (P) by permitting the fixed charges to be different for each variable, are carried out. A basic algorithm (A₀) is stated, and it is proved that Algorithm (A₀) finds an optimal solution of Problem (P) [resp., (P)] within a finite number of steps. Algorithm (A₀), combined with bounds developed with regard to Problem (P), yields Algorithm (A), which operates on a subset of all vertices of the feasible region. Finally, computational results concerning the numerical solution of Problem (P) by Algorithm (A) are stated.A part of this work was carried out in connection with the project Optimierung der Schnittholzproducktion auf Zerspaneranlagen, which was done at the Institute of Mathematics of the University of Klagenfurt in cooperation with the firm J. Offner, Holzindustrie GmbH, Wolfsberg. This project was partially supported by Forschungsförderungsfonds für die gewerbliche Wirtschaft. The author would like to thank Professor H. Stettner, C. Nowak, and H. Woschitz for their support and G. Stoiser for his help in achieving the numerical results.     

Sign-changing solutions on a kind of fourth-order Neumann boundary value problem

In this paper, we consider the fourth-order Neumann boundary value problem u(4)(t)−2u^″(t)+u(t)=f(t,u(t)) for all t∈[0,1] and subject to u^′(0)=u^′(1)=u^?(0)=u^?(1)=0. Using the fixed point index and the critical group, we establish the existence theorem of solutions that guarantees the problem has at least one positive solution and two sign-changing solutions under certain conditions.     

Slope packings and coverings,and generic algorithms for the discrete logarithm problem

We consider the set of slopes of lines formed by joining all pairs of points in some subset S of a Desarguesian affine plane of prime order p. If all the slopes are distinct and non‐infinite, we have a slope packing; if every possible non‐infinite slope occurs, then we have a slope covering. We review and unify some results on these problems that can be derived from the study of Sidon sets and sum covers. Then we report some computational results, we have obtained for small values of p. Finally, we point out some connections between slope packings and coverings and generic algorithms for the discrete logarithm problem in prime order (sub)groups. Our results provide a combinatorial characterization of such algorithms, in the sense that any generic algorithm implies the existence of a certain slope packing or covering, and conversely. © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 36–50, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10033     

Slim Exceptional Sets For Sums of Four Squares

Given that available technology permits one to establish thatalmost all natural numbers satisfying appropriate congruenceconditions are represented as the sum of three squares of primenumbers, one expects strong estimates to be attainable for exceptionalsets in the analogous problem involving sums of four squaresof primes. Let E(N) denote the number of positive integers notexceeding N that are congruent to 4 modulo 24, yet cannot bewritten as the sum of four squares of prime numbers. A methodis described that shows that for each positive number , onehas , thereby exploiting effectively the ‘excess’ fourth square of a prime so as to improvethe recent bound due to J. Liu and M.-C. Liu. It transpires that the ideas underlying thisprogress permit estimates for exceptional sets in a varietyof additive problems to be significantly slimmed whenever sufficientlymany excess variables are available. Such ideas are illustratedfor several additional problems involving sums of four squares. 2000 Mathematical Subject Classification: 11P32, 11P05, 11P55.     

Similarity solutions for liquid metal systems near a sharply cornered conductive region

We study the boundary value problem (Pm,a): on (0,+∞), subject to the boundary conditions f(0)=a∈R, f^′(0)=−1 and f^′(+∞)=0. The problem arises in the study of similarity solutions for high frequency excitation of liquid metal systems in an antisymmetric magnetic field. We give a complete picture of solutions of (Pm,a) for the physical interesting case: m<−1 and a?0.