On Sums of Two Coprime k-th Powers(II)

For fixed k ≥ 3, let E_k(x) denote the error term of the sum , where 1. It is proved that if the Riemann hypothesis is true, then , . A short interval result is also obtained.     

On Sums of Two Coprime k-th Powers

For fixed k3, let It is known that the asymptotic formula holds for some constant c_k. Let E_k(x)=R_k(x)–c_kx^2/k. We cannot improve the exponent 1/k at present if we do not have further knowledge about the distribution of the zeros of the Riemann Zeta function (s). In this paper, we shall prove that if the Riemann Hypothesis (RH) is true, then E_k(x)=O(x^4/15+), which improves the earlier exponent 5/18 due to Nowak. A mean square estimate of E_k(x) for k6 is also obtained, which implies that E_k(x)=(x^1/k–1/k2) for k6 under RH.     

Sums of Two Exact Powers

An asymptotic formula is obtained for the number of representations of an element of a finite field as a weighted sum of two prescribed powers of primitive elements. This generalises previous work on sums of primitive elements, including that relating to some conjectures of Golomb.     

Evaluating Binomial Character Sums Modulo Powers of Two

We show that for any mod 2m characters, χ1, χ2, the complete exponential sum,∑~(2m)_(x=1)χ1(x)χ2(Ax~k+ B) has a simple explicit evaluation.     

奇数方幂和的通项公式

In this paper, by using superposition method, we aim to show that ∑^n i=1 （2/- 1）^2k-1 is the product of n2 and a rational polynomial in n2 with degree k- 1, and that ∑^ni=1 （2i - 1）^2k is the product of n（2n - 1）（2n ＋ 1） and a rational polynomial in （2n - 1）（2n ＋ 1） with degree k - 1. Moreover, recurrence formulas to compute the coefficients of the corresponding rational polynomials are also obtained.     

Sums and differences of four kth powers

We prove an upper bound for the number of representations of a positive integer N as the sum of four kth powers of integers of size at most B, using a new version of the determinant method developed by Heath-Brown, along with recent results by Salberger on the density of integral points on affine surfaces. More generally we consider representations by any integral diagonal form. The upper bound has the form O_N(B^c/?k){O_{N}(B^{c/sqrt{k}})}, whereas earlier versions of the determinant method would produce an exponent for B of order k ^−1/3 (uniformly in N) in this case. Furthermore, we prove that the number of representations of a positive integer N as a sum of four kth powers of non-negative integers is at most O_e(N^1/k+2/k3/2+e){O_{varepsilon}(N^{1/k+2/k^{3/2}+varepsilon})} for k ≥ 3, improving upon bounds by Wisdom.     

位数码之和的幂的平均阶(I)

在本文中，我们给出了位数码之和的幂的平均阶的一个渐近公式．     

On k -diameter of k -connected graphs

Let G be a k-connected simple graph with order n. The k-diameter, combining connectivity with diameter, of G is the minimum integer d _k (G) for which between any two vertices in G there are at least k internally vertex-disjoint paths of length at most d _k (G). For a fixed positive integer d, some conditions to insure d _k (G)⩽d are given in this paper. In particular, if d⩾3 and the sum of degrees of any s (s=2 or 3) nonadjacent vertices is at least n+(s−1)k+1−d, then d _k (G)⩽d. Furthermore, these conditions are sharp and the upper bound d of k-diameter is best possible. Supported by NNSF of China (19971086).     

Maximum Waring Ranks of Monomials and Sums of Coprime Monomials

We show that monomials and sums of pairwise coprime monomials in four or more variables have Waring rank less than the generic rank, with a short list of exceptions. We asymptotically compare their ranks with the generic rank.     

On the largest kth eigenvalues of trees with n≡0 (mod k)

We consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue of trees with n vertices. In 1995, Jia-yu Shao gave complete solutions for the cases k=2,3,4,5,6 and provided some necessary conditions for extremal trees in general cases (cf. [Linear Algebra Appl. 221 (1995) 131]). We further improve Shao's necessary condition in this paper, which can be seen as the continuation of [Linear Algebra Appl. 221 (1995) 131].     

On Two Variable Jordan Block (II)

On the Hardy space over the bidisk H²(D²), the Toeplitz operators and are unilateral shifts of infinite multiplicity. A closed subspace M is called a submodule if it is invariant for both and . The two variable Jordan block (S₁, S₂) is the compression of the pair to the quotient H²(D²) ⊖M. This paper defines and studies its defect operators. A number of examples are given, and the Hilbert-Schmidtness is proved with good generality. Applications include an extension of a Douglas-Foias uniqueness theorem to general domains, and a study of the essential Taylor spectrum of the pair (S₁, S₂). The paper also estabishes a clean numerical estimate for the commutator [S₁*, S₂] by some spectral data of S₁ or S₂. The newly-discovered core operator plays a key role in this study.     

计算幂和多项式的矩阵方法

利用矩阵给出了计算幂和多项式的统一方法.     

On uniform k-partition problems

We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A few of them are proved to be NP-hard. Examples of applications to scheduling and routing problems are also discussed.     

On the Fibonacci k-numbers

We introduce a general Fibonacci sequence that generalizes, between others, both the classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers were found by studying the recursive application of two geometrical transformations used in the well-known four-triangle longest-edge (4TLE) partition. Many properties of these numbers are deduce directly from elementary matrix algebra.     

On products of k atoms

Let H be an atomic monoid. For k ? \Bbb Nk \in {\Bbb N} let V_k (H){\cal V}_k (H) denote the set of all m ? \Bbb Nm \in {\Bbb N} with the following property: There exist atoms (irreducible elements) u ₁, …, u _k , v ₁, …, v _m ∈ H with u ₁· … · u _k = v ₁ · … · v _m . We show that for a large class of noetherian domains satisfying some natural finiteness conditions, the sets V_k (H){\cal V}_k (H) are almost arithmetical progressions. Suppose that H is a Krull monoid with finite cyclic class group G such that every class contains a prime (this includes the multiplicative monoids of rings of integers of algebraic number fields). We show that, for every k ? \Bbb Nk \in {\Bbb N}, max V_2k+1 (H) = k |G|+ 1{\cal V}_{2k+1} (H) = k \vert G\vert + 1 which settles Problem 38 in [4].     

On Differences of Two kth Powers of Integers

The arithmetic function rk–(n) counts the number of ways to write a natural number n as the difference of two kth powers (k 3 fixed). The investigation of the asymptotic behavior of the Dirichlet summatory function of rk–(n) leads in a natural way to a certain error term Pk–(t). In this article we establish a mean-square upper bound and an -estimate for Pk–(t).     

奇素数的三项方幂和中的平方数

研究了一类基本而又重要的指数Diophantine方程,利用广义Ramanujan-Nagell方程的性质证明了这类方程有非负整数解的充要条件,并得出这类方程的全部非负整数解.