On universal sums of polygonal numbers

For m = 3, 4,..., the polygonal numbers of order m are given by pm(n) =(m- 2) n2 + n(n= 0, 1, 2,...). For positive integers a, b, c and i, j, k 3 with max{i, j, k} 5, we call the triple(api, bpj, cpk)universal if for any n = 0, 1, 2,..., there are nonnegative integers x, y, z such that n = api(x) + bpj(y)+ cpk(z). We show that there are only 95 candidates for universal triples(two of which are(p4, p5, p6) and(p3, p4, p27)), and conjecture that they are indeed universal triples. For many triples(api, bpj, cpk)(including(p3, 4p4, p5),(p4, p5, p6) and(p4, p4, p5)), we prove that any nonnegative integer can be written in the form api(x) + bpj(y) + cpk(z) with x, y, z ∈ Z. We also show some related new results on ternary quadratic forms,one of which states that any nonnegative integer n ≡ 1(mod 6) can be written in the form x2+ 3y2+ 24z2 with x, y, z ∈ Z. In addition, we pose several related conjectures one of which states that for any m = 3, 4,...each natural number can be expressed as pm+1(x1) + pm+2(x2) + pm+3(x3) + r with x1, x2, x3 ∈ {0, 1, 2,...}and r ∈ {0,..., m- 3}.     

Disk-like Tiles Derived from Complex Bases

For each positive integer k,the radix representation of the complex numbers in the base-k i gives rise to a lattice self-affine tile T_k in the plane,which consists of all the complex numbersthat can be expressed in the form ∑_(j1) d_j(-k i)~(-j),where d_j∈{0,1,2,...,k~2}.We prove that T_kis homeomorphic to the closed unit disk {z∈C:|z|1} if and only if k≠2.     

MEROMORPHIC SOLUTIONS OF A TYPE OF SYSTEM OF COMPLEX DIFFERENTIAL-DIFFERENCE EQUATIONS

Applying Nevanlinna theory of the value distribution of meromorphic functions,we mainly study the growth and some other properties of meromorphic solutions of the type of system of complex differential and difference equations of the following form∑nj=1aj(z)f1(λj1)(z+cj) = R2(z, f2(z)),∑nj=1βj(z)f2(λj2)(z+cj)=R1(Z,F1(z)).(*)where λij(j = 1, 2, ···, n; i = 1, 2) are finite non-negative integers, and cj(j = 1, 2, ···, n)are distinct, nonzero complex numbers, αj(z), βj(z)(j = 1, 2, ···, n) are small functions relative to fi(z)(i = 1, 2) respectively, Ri(z, f(z))(i = 1, 2) are rational in fi(z)(i = 1, 2)with coefficients which are small functions of fi(z)(i = 1, 2) respectively.     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.     

系数具有相同级的复线性微-差分方程亚纯解的增长性

The main purpose of this paper is to study the growth of meromorphic solutions of complex linear differential-difference equations L(z, f) =n∑i=0m∑j=0Aij(z)f(j)(z + ci) = 0 or F(z)with entire or meromorphic coefficients, and ci, i = 0,..., n being distinct complex numbers,where there is only one dominant coefficient.     

SINGULAR POSITIVE RADIAL SOLUTIONS FOR A GENERAL SEMILINEAR ELLIPTIC EQUATION

The existence and uniqueness of singular solutions decaying like r m(see(1.4)) of the equation u + k i=1 ci|x|li upi = 0,x ∈ Rn(0.1) are obtained,where n ≥ 3,ci > 0,li > 2,i = 1,2,...,k,pi > 1,i = 1,2,...,k and the separation structure of singular solutions decaying like r(n 2) of eq.(0.1) are discussed.moreover,we obtain the explicit critical exponent ps(l)(see(1.9)).     

Universal sums of three quadratic polynomials

Let a,b,c,d,e and f be integers with a≥ c≥ e> 0,b>-a and b≡a(mod 2),d>-c and d≡c(mod 2),f>-e and f≡e(mod 2).Suppose that b≥d if a=c,and d≥f if c=e.When b(a-b),d(c-d) and f(e-f) are not all zero,we prove that if each n∈N={0,1,2,...} can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈N then the tuple(a,b,c,d,e,f) must be on our list of 473 candidates,and show that 56 of them meet our purpose.When b∈[0,a),d∈[0,c) and f∈[0,e),we investigate the universal tuples(a,b,c,d,e,f) over Z for which any n∈N can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈Z,and show that there are totally 12,082 such candidates some of which are proved to be universal tuples over Z.For example,we show that any n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈Z,and conjecture that each n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈N.     

完全图的Cantesian积的L(2,1)-圆标定

For positive integers j and k with j ≥ k, an L（j, k）-labeling of a graph G is an assignment of nonnegative integers to V（G） such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L（j, k）-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L（j, k）-labelings of G. An m-（j, k）-circular labeling of a graph G is a function f ： V（G） →{0, 1, 2,..., m - 1} such that ｜f（u） - f（v）｜m ≥ j if u and v are adjacent; and ｜f（u） - f（v）｜m 〉 k ifu and v are at distance two, where ｜x｜m = min{｜xl｜, m-｜x｜}. The minimum integer m such that there exists an m-（j, k）-circular labeling of G is called the σj,k-number of G and is denoted by σj,k（G）. This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

Darboux integrability and algebraic limit cycles for a class of polynomial differential systems

This paper deals with the existence of Darboux first integrals for the planar polynomial differential systems x=x-y+P n+1(x,y)+xF2n(x,y),y=x+y+Q n+1(x,y)+yF2n(x,y),where P i(x,y),Q i(x,y)and F i(x,y)are homogeneous polynomials of degree i.Within this class,we identify some new Darboux integrable systems having either a focus or a center at the origin.For such Darboux integrable systems having degrees 5and 9 we give the explicit expressions of their algebraic limit cycles.For the systems having degrees 3,5,7 and 9and restricted to a certain subclass we present necessary and sufficient conditions for being Darboux integrable.     

Congruences involving generalized central trinomial coefficients

For integers b and c the generalized central trinomial coefficient Tn(b,c)denotes the coefficient of xnin the expansion of(x2+bx+c)n.Those Tn=Tn(1,1)(n=0,1,2,...)are the usual central trinomial coefficients,and Tn(3,2)coincides with the Delannoy number Dn=n k=0n k n+k k in combinatorics.We investigate congruences involving generalized central trinomial coefficients systematically.Here are some typical results:For each n=1,2,3,...,we have n-1k=0(2k+1)Tk(b,c)2(b2-4c)n-1-k≡0(mod n2)and in particular n2|n-1k=0(2k+1)D2k;if p is an odd prime then p-1k=0T2k≡-1p(mod p)and p-1k=0D2k≡2p(mod p),where(-)denotes the Legendre symbol.We also raise several conjectures some of which involve parameters in the representations of primes by certain binary quadratic forms.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

L（1, 2）-edge-labelings for lattices

For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by kThe λ j,k-number of G is the minimum m such that an m-L(j, k)-edge-labeling is admitted by GIn this article, the L(1, 2)-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λ j,k-numbers of these graphs are obtained.     

On the Schinzel identity ofCyclotomic Polynomial

For integer n > 0, let n.(x) denote the nth cyclotomic polynomialwhere is a primitive nib root of unity and (j, n) denotes the greatest common divisor of j andn.Although 4.(x) is irreducible over the integers, 4.(x) may be reducible over certain quadraticfield. Let n > 1 be an odd square-free number. Aurifeuille and Le Lasseur[1] proved thatLater on Schinzel[2] proved that (1) can be improved aswhere m|n,(3) denotes the Jacobi symbol, andwhere both Pn,m(x) and Qn,m(x) are polynomials with i…     

Solution to an Extremal Problem on Bigraphic Pairs with a Z_3-connected Realization

Let S =(a_1...,a_m;b_1,...,b_n),where a_1,...,a_m and b_1,...,b_n are two nonincreasing sequences of nonnegative integers. The pair S =(a_1,..., a_m; b_1,..., b_n) is said to be a bigraphic pair if there is a simple bipartite graph G =(X U Y, E) such that a_1...,a_m and b_1,...b_n are the degrees of the vertices in X and Y, respectively. Let Z3 be the cyclic group of order 3. Define a(Z_3,m,n) to be the minimum integer k such that every bigraphic pair S =(a_1,..., a_m; b_1,..., b_n) with a_m,b_n≥2 and σ(S) = a_1+…+a_m≥k has a Z_3-connected realization. For n =m, Yin [Discrete Math.,339, 2018-2026(2016)] recently determined the values of σ(Z_3,m,m) for m≥ 4. In this paper, we completely determine the values of a(Z_3,m,n) for m ≥n≥4.     

A Representation of the Lorentz Spin Group and Its Application

For an integer m ≥ 4, we define a set of 2[m/2] × 2[m/2] matrices γj （m）, （j = 0, 1,..., m - 1） which satisfy γj （m）γk （m） ＋γk （m）γj （m） = 2ηjk （m）I[m/2], where （ηjk （m）） 0≤j,k≤m-1 is a diagonal matrix, the first diagonal element of which is 1 and the others are -1, I[m/2] is a 2[m/1] × 2[m/2] identity matrix with [m/2] being the integer part of m/2. For m = 4 and 5, the representation （m） of the Lorentz Spin group is known. For m≥ 6, we prove that （i） when m = 2n, （n ≥ 3）, （m） is the group generated by the set of matrices {T｜T=1/√ξ（（I＋k） 0 ＋ 0 I-K） （ U 0 0 U）, （ii） when m = 2n ＋ 1 （n≥ 3）, （m） is generated by the set of matrices {T｜T=1/√ξ（I -k^- k I）U,U∈ （m-1）,ξ=1-m-2 ∑k,j=0 ηkja^k a^j〉0, K=i[m-3 ∑j=0 a^j γj（m-2）＋a^（m-2） In],K^-=i[m-3∑j=0 a^j γj（m-2）-a^（m-2） In]}     

关于一些图类的L(1,2)-边标号

For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0,..., m}, such that adjacent edges receive labels differing by at least j, and edges which are distance two apart receive labels differing by at least k. The λ′j,k-number of G is the minimum m of an m-L(j, k)-edge-labeling admitted by G.In this article, we study the L(1, 2)-edge-labeling for paths, cycles, complete graphs, complete multipartite graphs, infinite ?-regular trees and wheels.     

Schur Convexity for Two Classes of Symmetric Functions and Their Applications

For x =(x1, x2, ···, xn) ∈ Rn+∪ Rn-, the symmetric functions Fn(x, r) and Gn(x, r) are defined by r1 + xFij n(x, r) = Fn(x1, x2, ···, xn; r) =x1≤iij1i2···ir ≤n j=1and r1- xGij n(x, r) = Gn(x1, x2, ···, xn; r) =,x1≤i1i2···ir ≤n j=1ij respectively, where r = 1, 2, ···, n, and i1, i2, ···, in are positive integers. In this paper,the Schur convexity of Fn(x, r) and Gn(x, r) are discussed. As applications, by a bijective transformation of independent variable for a Schur convex function, the authors obtain Schur convexity for some other symmetric functions, which subsumes the main results in recent literature; and by use of the theory of majorization establish some inequalities. In particular, the authors derive from the results of this paper the Weierstrass inequalities and the Ky Fan's inequality, and give a generalization of Safta's conjecture in the n-dimensional space and others.     

New series of odd non-congruent numbers Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

We determine all square-free odd positive integers n such that the 2-Selmer groups Sn and Sn of the elliptic curve En: y2 = x(x -n)(x - 2n) and its dual curve En: y2 = x3 6nx2 n2x have the smallest size: Sn = {1}, Sn = {1,2,n,2n}. It is well known that for such integer n, the rank of group En(Q) of the rational points on En is zero so that n is a non-congruent number. In this way we obtain many new series of elliptic curves En with rank zero and such series of integers n are non-congruent numbers.     

THE VALUE DISTRIBUTION AND UNIQUENESS OF ONE CERTAIN TYPE OF DIFFERENTIAL-DIFFERENCE POLYNOMIALS

In this article, we investigate the distribution of the zeros and uniqueness of differential-difference polynomials G(z) =(fn(fm(z)- 1)dΠj=1f(z + cj)vj)(k)- α(z),H(z) =(fn(f(z)- 1)mdΠj=1f(z + cj)vj)(k)- α(z),where f is transcendental entire function of finite order, cj(j = 1, 2, ···, d), n, m, d, and vj(j = 1, 2, ···, d) are integers, and obtain some theorems, which extended and improved many previous results.