Gauss Sum of Index 4： （1） Cyclic Case

Let p be a prime, m ≥ 2, and （m,p（p - 1）） = 1. In this paper, we will calculate explicitly the Gauss sum G（X） = ∑x∈F＊qX（x）ζ^Tp^（x） in the case of [（Z/mZ）＊ ： （p）] = 4, and -1 （不属于） （p）, where q P^f, f =φ（m）/4, X is a multiplicative character of Fq with order m, and T is the trace map for Fq/Fp. Under the assumptions [（Z/mZ）＊ ： （p）] = 4 and 1（不属于） （p）, the decomposition field of p in the cyclotomic field Q（ζm） is an imaginary quartic （abelian） field. And G（X） is an integer in K. We deal with the case where K is cyclic in this oaDer and leave the non-cvclic case to the next paper.     

Neighbor Sum Distinguishing Index

We consider proper edge colorings of a graph G using colors of the set {1, . . . , k}. Such a coloring is called neighbor sum distinguishing if for any pair of adjacent vertices x and y the sum of colors taken on the edges incident to x is different from the sum of colors taken on the edges incident to y. The smallest value of k in such a coloring of G is denoted by ndi_Σ(G). In the paper we conjecture that for any connected graph G ≠ C ₅ of order n ≥ 3 we have ndi_Σ(G) ≤ Δ(G) + 2. We prove this conjecture for several classes of graphs. We also show that ndi_Σ(G) ≤ 7Δ(G)/2 for any graph G with Δ(G) ≥ 2 and ndi_Σ(G) ≤ 8 if G is cubic.     

Neighbor Sum Distinguishing Index of Sparse Graphs

A proper k-edge coloring of a graph G is an assignment of one of k colors to each edge of G such that there are no two edges with the same color incident to a common vertex. Let f(v) denote the sum of colors of the edges incident to v. A k-neighbor sum distinguishing edge coloring of G is a proper k-edge coloring of G such that for each edge uv∈E(G), f(u)≠f(v). By χ'_∑(G), we denote the smallest value k in such a coloring of G. Let mad(G) denote the maximum average degree of a graph G. In this paper, we prove that every normal graph with mad(G) ■ and Δ(G) ≥ 8 admits a(Δ(G) + 2)-neighbor sum distinguishing edge coloring. Our approach is based on the Combinatorial Nullstellensatz and discharging method.     

正项级数的Gauss指标判别法

在正项级数Gauss判别法的基础上,定义了正数列an的Gauss指标G=lim[n ln(an/an+1)-1]ln n.从而得到了正项级数的Gauss指标判别法.通过具体计算已有各种判别法的Gauss指标,结果表明,Gauss指标判别法是达朗贝尔、柯西、拉贝、高斯和Bertrand等5种判别法的推广.     

On the Neighbor Sum Distinguishing Index of Planar Graphs

Let c be a proper edge coloring of a graph with integers . Then , while Vizing's theorem guarantees that we can take . On the course of investigating irregularities in graphs, it has been conjectured that with only slightly larger k, that is, , we could enforce an additional strong feature of c, namely that it attributes distinct sums of incident colors to adjacent vertices in G if only this graph has no isolated edges and is not isomorphic to C₅. We prove the conjecture is valid for planar graphs of sufficiently large maximum degree. In fact an even stronger statement holds, as the necessary number of colors stemming from the result of Vizing is proved to be sufficient for this family of graphs. Specifically, our main result states that every planar graph G of maximum degree at least 28, which contains no isolated edges admits a proper edge coloring such that for every edge of G.     

On the Decomposition of an Operator into a Sum of Four Idempotents

We prove that operators of the form (2 ± 2/n)I + K are decomposable into a sum of four idempotents for integer n > 1 if there exists the decomposition K = K ₁ K ₂ ... K _n, , of a compact operator K. We show that the decomposition of the compact operator 4I + K or the operator K into a sum of four idempotents can exist if K is finite-dimensional. If n trK is a sufficiently large (or sufficiently small) integer and K is finite-dimensional, then the operator (2 – 2/n)I + K [or (2 + 2/n)I + K] is a sum of four idempotents.     

Density of Integers That Are the Sum of Four Cubes of Primes

gi. IntroductionIt is conjectured that all sufficielltly large integers e satisfying some necessaly congruenceconditions are the sum of four cubes of primes, i.e.(see e.g. [1]). Such a strong conjecture is out of reach at present; but it is reasonable, inview of the following results of Hua and Davenport respectively. A theorem of Hua[3'4] statesthst almost all positive integers, with t * 0, 12(mod 9) are the sum of five cubes of praies,while DavenPOrt's result in 12] asserts that almost all…     

Constructions of Strongly Regular Cayley Graphs Using Even Index Gauss Sums

In this paper, generalizing the result in [9], I construct strongly regular Cayley graphs by using union of cyclotomic classes of and Gauss sums of index w, where is even. In particular, we obtain three infinite families of strongly regular graphs with new parameters.     

On the Representations of a Number as the Sum of Four Fifth Powers

It is known from Vaughan and Wooley's work on Waring's problemthat every sufficiently large natural number is the sum of atmost 17 fifth powers [13]. It is also known that at least sixfifth powers are required to be able to express every sufficientlylarge natural number as a sum of fifth powers (see, for instance,[5, Theorem 394]). The techniques of [13] allow one to showthat almost all natural numbers are the sum of nine fifth powers.A problem of related interest is to obtain an upper bound forthe number of representations of a number as a sum of a fixednumber of powers. Let R(n) denote the number of representationsof the natural number n as a sum of four fifth powers. In thispaper, we establish a non-trivial upper bound for R(n), whichis expressed in the following theorem.     

Gauss Algebras

A special class of associative algebras is introduced and studied. A criteria of semisimplicity for suitable category of modules is obtained.     

和图、整和图与模和图的几个结果

Let N denote the set of positive integers. The sum graph G^＋（S） of a finite subset S belong to N is the graph （S, E） with uv ∈ E if and only if u ＋ v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = （V, E） is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill （Dm） is integral sum graph and mod sum graph, and give the sum number of Dm.     

和图、整和图及模和图的几个结果

Let N denote the set of positive integers.The sum graph G (S) of a finite subset S (C) N is the graph (S,E) with uv ∈ E if and only if u v ∈ S.A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S С N.By using the set Z of all integers instead of N,we obtain the definition of the integral sum graph.A graph G=(V,E) is a mod sum graph if there exists a positive integer z and a labelling,λ,of the vertices of G with distinct elements from {0,1,2,...,z-1} so that uv ∈ E if and only if the sum,modulo z,of the labels assigned to u and v is the label of a vertex of G.In this paper,we prove that flower tree is integral sum graph.We prove that Dutch m-wind-mill (Dm) is integral sum graph and mod sum graph,and give the sum number of Dm.     

Quadratic Gauss Sums

Letpbe a prime integer andmbe an integer, not divisible byp. LetKbe the splitting field ofX^m−1 over the prime field _p. Solving the Gauss sums problem of ordermin characteristicpmeans determining Gauss sums of all multiplicative characters ofKof order dividingm. Our aim is to solve this problem when the subgroup 〈p〉 is of index 2 in (/m)^*.     

Polynomial Gauss sums

A recent bound for exponential sums by Friedlander, Hansen and Shparlinski is extended to twisted exponential sums with general polynomial arguments. As a by-product a new result about perfect powers in certain products of polynomials is established.

     

Gauss on infinity

In opposing the use of completed infinity in mathematics, Gauss was making a valid criticism of one particular kind of argument. His celebrated statement has no connection with the set theory to which it was later applied.