On Sums of Two Squares of Primes and a Cube of a Prime

In this paper we are concerned with the exceptional set of the sum of two squares of primesand a cube of a prime P;+p;+p;.Noting that竹三1 or 3(mod 6)is a necessary conditionfor the solvability of the equation n=P}+P;+P;(see【1]),we define E(N)=Card{n:n≤N,礼∈三and n≠P;+Pi+P;for any Pi,1≤i s 3), (1)where三={n:n三1 or 3(mod 6)). This and similar problems have been studied by a number of authors.In 1937,Davenportand Heilbronn[2J proved that if后2 3 is an odd integer then almost all posi…     

Radius of Starlikeness for Class S(a,n)and Its Extension

This paper obtain that the radius of starlikeness for class S(α,n)in [1] is,tespectivety,where α_ is unique solution of equation (αα)~(1/2)=σwith a in (0.1),and α-[1+(1-2α)r~(2n)]/(1-r~(2n)),σ=[1-(1-2α)r~]/(1+r~).Futhermore,we consider an extension of class S(α,n):Let S(α、β、n)denote the class of functions f(z)=z+α_z~(n+1)+…(n≥1)that are analytie in |z|<1 such that f(z)/g(z)∈p(α,n)[1],where g(z)∈S~*(β)[2].This paper prove that the radius of starlikeness of class S(α,β,n) is given by the smallest positive root(less than 1)of the following equations(1-2α)(1-2β)r~(2)-2[1-α-β-n(1-α)]r~+1=0.0≤α≤α_0,(1-α)[1-(1-2β)r~]-n[r~(1+r~)=0.,α_0≤α<1.where α=[1+(1-2α)r~(2)]/(1-r~(2)(0≤r<1),α_0(?(0,1) is some fixed number.This result is also thecxtension of well-known results[T.Th3] and [8,Th3]     

Number and Location of Limit Cycles in a Class of Perturbed Polynomial Systems

In this paper,we investigate the number,location and stability of limit cycles in a class of perturbedpolynomial systems with (2n 1) or (2n 2)-degree by constructing detection function and using qualitativeanalysis.We show that there are at most n limit cycles in the perturbed polynomial system,which is similar tothe result of Perko in [8] by using Melnikov method.For n=2,we establish the general conditions dependingon polynomial's coefficients for the bifurcation,location and stability of limit cycles.The bifurcation parametervalue of limit cycles in [5] is also improved by us.When n=3 the sufficient and necessary conditions for theappearance of 3 limit cycles are given.Two numerical examples for the location and stability of limit cycles areused to demonstrate our theoretical results.     

The topology of moment-angle manifolds——on a conjecture of S. Gitler and S. López de Medrano

In this paper,we study the topology of moment-angle manifolds and prove a conjecture of S.Gitler and S.Lopez de Medrano concerned with the behavior of the moment-angle manifold under the surgery 'cutting off a vertex' on a simple polytope.Let P be a simple polytope of dimension n with m facets and Pv be a poly tope obtained from P by cutting off one vertex v.Let Z=Z(P) and Z_v=Z(P_v) be the corresponding moment-angle manifolds.S.Gitler and S.Lopez de Medrano conjectured that:Z_v is diffeomorphic to ?[(Z(-D~(n+m)) × D~2]##_(j=1)~(m-n)(_j~(m-n))(S~(j+2) × S~(m+n-j-1)),and they proved the conjecture in the case m 3 n.In this paper we prove the conjecture in the general case.     

On the polynomiality and asymptotics of moments of sizes for random(n,dn ± 1)-core partitions with distinct parts

Amdeberhan’s conjectures on the enumeration,the average size,and the largest size of(n,n+1)-core partitions with distinct parts have motivated many research on this topic.Recently,Straub(2016)and Nath and Sellers(2017)obtained formulas for the numbers of(n,dn-1)-and(n,dn+1)-core partitions with distinct parts,respectively.Let X_s,t be the size of a uniform random(s,t)-core partition with distinct parts when s and t are coprime to each other.Some explicit formulas for the k-th moments E[X_n,n+1^k]and E[X_(2 n+1,2 n+3)^k]were given by Zaleski and Zeilberger(2017)when k is small.Zaleski(2017)also studied the expectation and higher moments of X_n,dn-1 and conjectured some polynomiality properties concerning them in ar Xiv:1702.05634.Motivated by the above works,we derive several polynomiality results and asymptotic formulas for the k-th moments of X_n,dn+1 and X_n,dn-1 in this paper,by studying theβ-sets of core partitions.In particular,we show that these k-th moments are asymptotically some polynomials of n with degrees at most 2 k,when d is given and n tends to infinity.Moreover,when d=1,we derive that the k-th moment E[X_n,n+1^k]of X_n,n+1 is asymptotically equal to(n²/10)^kwhen n tends to infinity.The explicit formulas for the expectations E[X_n,dn+1]and E[X_n,dn-1]are also given.The(n,dn-1)-core case in our results proves several conjectures of Zaleski(2017)on the polynomiality of the expectation and higher moments of X_n,dn-1.     

On the Diophantine Equation sum from k=1 to m((k~n)=(m+1)~n)

P. Erds has conjectured [1] that the Diophantine equation 1~n+2~n+…+m~n=(m+1)~n (1) has no positive integer solutions except that n=1, m=2. It is true when m≤10~(10) [3]. A generalized form of (1) has been investigated in [1] [2], and various     

Regular n-simplices in R~n with vertices in Z~n

In this paper the Ⅰ and Ⅱ regular n-simplices are introduced. We prove that the sufficient and necessary conditions for existence of an Ⅰ regular n-simplex in Rn are that if n is even then n = 4m(m + 1), and if n is odd then n = 4m + 1 with that n + 1 can be expressed as a sum of two integral squares or n = 4m - 1, and that the sufficient and necessary condition for existence of a Ⅱ regular n-simplex in Rn is n = 2m2 - 1 or n = 4m(m+1)(m 6 N). The connection between regulars-simplex in Rn and combinational design is given.     

ON THE CROSSING NUMBER OF THE COMPLETE TRIPARTITE GRAPH K_(1,8,n)

The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph Km,n (m≤n) is Z(m,n). where Z(m,n) = [m/2] [(m-1)/2] [n/2] [(n-1)/2](for and real number x, [x] denotes the maximal integer no more than x). Presently, Zarankiewicz' conjecture is proved true only for the case m≤G. In this article, the authors prove that if Zarankiewicz' conjecture holds for m≤9, then the crossing number of the complete tripartite graph K1,8,n is Z(9, n) 12[n/2].     

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

On the Constant Metric Dimension of Generalized Petersen Graphs P（n, 4）

In this paper,we consider the family of generalized Petersen graphs P(n,4).We prove that the metric dimension of P(n,4) is 3 when n ≡ 0(mod 4),and is 4 when n = 4k + 3(k is even).For n ≡ 1,2(mod 4) and n = 4k + 3(k is odd),we prove that the metric dimension of P(n,4) is bounded above by 4.This shows that each graph of the family of generalized Petersen graphs P(n,4)has constant metric dimension.     

CONTINUOUS MAPPING FROM SPHERES TO EUCLIDEAN SPACES

In the forties Knaster, B., posed the following problem: Gieven a continuous mapping f of an (m+n-2) sphere \({S^{m + n - 2}}\) into the Euclidean m -space \({R^m}\） and n distinct points it \({u_1}, \cdots {u_n}\） of \({S^{m + n - 2}}\); does there exist a rotation r such that \[f(r{u_1}) = \cdots = f(r{u_n})?\] In this paper, the index under periodic transfromation of StieM manifold is applied to prove the following theorem: Given a continuous mapping \（f:{S^{k - 1}} \to {R^m}\）， n distinct points \({u_1}, \cdots {u_n} \in {S^{k - 1}}\） viewed as unit vectors satisfying \({u_i}{u_j} = {u_{i + 1}}{u_{j + 1}},i,j \in {I_n}\), and suppose\({u_1}, \cdots {u_n}\） have rank l, then in each of the following cases, there is a!rotation r such that \[f(r{u_1}) = \cdots = f(r{u_n})\] 1. \[n \ne 2,3,k - 1 = (n - 1)m\]; 2. n is an odd prime number, l even,\[k - 1 = \left[ {\frac{{(n - 1)m}}{2}} \right] + l - 2\]; 3. n is an odd prime number, l odd, \[l \ge \left[ {\frac{{(n - 1)m}}{2}} \right] + 1,k - 1 = \left[ {\frac{{(n - 1)m}}{2}} \right] + l - 2;\] 4. n is an odd prime number, l odd, \[l < \left[ {\frac{{(n - 1)m}}{2}} \right] + 1,k - 1 = (n - 1)m + 1;\] where [*] is the least even number>*. This theorem generalizes the classical Borsuk-Ulam theorem.     

On the Covering of the Vertices of a Graph by Cliques

In conversation I was told by Professor R.Brigham the following conjecture [1].Let G(n) be a graph of n vertices.Denote by f(G(n))=t the smallest integer for which the vertices of G(n) can be covered by t cliques. Denote further by h(G(n)) =l the largest integer for which there are l edges of our G(n) no two of Which are in the same clique.Clearly h(G(n)) can be much larger than f(G(n))e.g.if n=2m and G(n) is the complete bipartite graph of m white and m black vertices.Then l(G(n))=m and l(G(n))=m~2. It was conjectured that if G(n).has no isolated vertices then     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

On a problem of Sierpiński,Ⅱ

For any integer s≥ 2, let μsbe the least integer so that every integer l μs is the sum of exactly s integers which are pairwise relatively prime. In 1964, Sierpi′nski asked for the determination of μs. Let pibe the i-th prime and let μs= p2 + p3 + + ps+1+ cs. Recently, the authors solved this problem. In particular,we have(1) cs=-2 if and only if s = 2;(2) the set of integers s with cs= 1100 has asymptotic density one;(3) cs∈ A for all s ≥ 3, where A is an explicit set with A ■[2, 1100] and |A| = 125. In this paper, we prove that,(1) for every a ∈ A, there exists an index s with cs= a;(2) under Dickson's conjecture, for every a ∈ A,there are infinitely many s with cs= a. We also point out that recent progress on small gaps between primes can be applied to this problem.     

Explicit Formulae for Values of Dedekind Zeta Functions of Two Kinds of Cyclotomic Fields

Let K = Q(m) denote the m-th cyclotomic field, and K+ its maximal real subfield, where m =exp is an m-th primary root of unity. Let K (s) denote the Dedekind zeta function ofK. For prime integers m = p, Fumio Hazama recently in [1] obtained formulae for calculating special values of K(s) and K+(s), i.e., calculating formulae of K+(1 - n) and for positive integers n, which are the newest results of a series of his work in many years (see [1-3]).Here we develop Hazama's work for prime integ…     

Boundedness of Commutators Generated by Campanato-type Functions and Riesz Transforms Associated with Schrdinger Operators

Let■=-△+V be a Schrdinger operator on R~n,n3,where △is the Laplacian on R~n and V≠0 is a nonnegative function satisfying the reverse Holder's inequality.Let[b,T]be the commutator generated by the Campanatotype function b∈■ and the Riesz transform associated with Schrdinger operator T=▽(-△+V)~(-1/2).In the paper,we establish the boundedness of[b,T]on Lebesgue spaces and Campanato-type spaces.     

Ramsey Number With Largen

This is an announcement that r(C2m+1, Kn) ≤ c(m) has been proved. The Rarnsey number r(H, Kn) is the smallest integer N such that every H-free graph on N vertices has independence number at least n. The study of Ramsey number r(Ck, Kn) was initiated by Bondy and Erdos[2]. They proved that for any fixed n, r(Ck, Kn) = (k - 1)(n - 1) + 1if k≥n2-1, and r(Ck, Kn)≤kn2. For fixed k≥3, it is difficult to obtain a satisfied bound of r(Ck,Kn) for n →∞. The bound of Bondy and Erdos was improved as r(Ck, Kn)≤c(k)n1+1/m,where m = [(k - 1)/2] by Erdos, Faudree, Rousseau and Schelp[4]. For even cycle, a more refined     

LIE ALGEBRA K(n,μj,m)OF CARTAN TYPE OF CHARACTERISTIC p=2.

Let K(n,μ_j,m),n=2r+1,denote the Lie algebra of characteristic p=2,which isdefined in [4].In the paper the restrietability of K(n,μ_j,m)is discussed and it is provedthat,when r≡1(mod 2)and r>1,1(ad.f)=n+1 if and only if 0≠f∈.Then theinvariance of some filtrations of K(n,μ_j,m)and the condition of isomorphism of K(n,μ_j,m)and K(n′,μ_j′,m′)are obtained.Besides,the generators and the derivation algebraof K(n,μ_l,m)are discussed.The results also hold,when r=0(mod 2)and r>0.     

The Threshold for the Erdos, Jacobson and Lehel Conjecture to Be True

Let σ（k, n） be the smallest even integer such that each n-term positive graphic sequence with term sum at least σ（k, n） can be realized by a graph containing a clique of k ＋ 1 vertices. Erdos et al. （Graph Theory, 1991, 439-449） conjectured that σ（k, n） = （k - 1）（2n- k） ＋ 2. Li et al. （Science in China, 1998, 510-520） proved that the conjecture is true for k 〉 5 and n ≥ （k2） ＋ 3, and raised the problem of determining the smallest integer N（k） such that the conjecture holds for n ≥ N（k）. They also determined the values of N（k） for 2 ≤ k ≤ 7, and proved that [5k-1/2] ≤ N（k） ≤ （k2） ＋ 3 for k ≥ 8. In this paper, we determine the exact values of σ（k, n） for n ≥ 2k＋3 and k ≥ 6. Therefore, the problem of determining σ（k, n） is completely solved. In addition, we prove as a corollary that N（k） -= [5k-1/2] for k ≥6.     

Existence and Upper Semicontinuity of.the Attractor for a Singularly PerturbedNavier-Stokes Equation

Suppose Rn, n = 2, 3 be a smooth bounded domain, we consider the perturbed NavierStokes equationThe study of this equation for ε= 0 has a long and rich history. In the two-dimensional case,the study is very successful and it is well known that the solutions of the equation define aC0-semigroup {S(t): t ≥ 0} in the space H = PL2 (where P is the projection onto thespace of divergence-free vector fields) and which has a global attractor Ac on H (see [1]). But,in the three-dimensional case, …