尖点形式L函数的广义零点密度估计(英文)

In this paper a zero-density estimate of the large sieve type is given for the automorphic L-function L f (s,χ),where f is a holomorphic cusp form and χ a Dirichlet character of mod q.     

Gauss Sum of Index Four

Let p be a prime number, q = pf and m| q - 1. For a multiplicative character χ of Fq with order m, the Gauss sum G(χ) over Fq is defined by G(χ)=∑(X()Fq)χ(x)ζTP(x),ζp=e2πi/p,(1)where T is the mapping for Fq/Fp.     

Moments of L-Functions Attached to the Twist of Modular Form by Dirichlet Characters

Let f(z) be a holomorphic cusp form of weight κ with respect to the full modular group SL2(Z). Let L(s, f) be the automorphic L-function associated with f(z) and χ be a Dirichlet character modulo q. In this paper, the authors prove that unconditionally for k =1/n with n ∈ N,and the result also holds for any real number 0 k 1 under the GRH for L(s, f ■χ).The authors also prove that under the GRH for L(s, f ■χ),for any real number k 0 and any large prime q.     

Association Schemes with at Most Two Nonlinear Irreducible Characters and Applications to Finite Groups

An irreducible character χ of an association scheme is called nonlinear if the multiplicity of χ is greater than 1. The main result of this paper gives a characterization of commutative association schemes with at most two nonlinear irreducible characters. This yields a characterization of finite groups with at most two nonlinear irreducible characters. A class of noncommutative association schemes with at most two nonlinear irreducible character is also given.     

Mean-square estimate of automorphic L-functions

Let f be a holomorphic Hecke cusp form with even integral weight k≥2 for the full modular group,and letχbe a primitive Dirichlet character modulo q.Let Lf(s,χ)be the automorphic L-function attached to f andχ-We study the mean-square estimate of Lf(s,χ)and establish an asymptotic formula.     

On the products arising from the Kummer conjecture

Let q be a sufficiently large integer and χ be a Dirichlet character modulo q.In this paper,we extend the product ∏χ(-1)=-1L(1,χ) with prime q,arising from the Kummer conjecture,to the products of some general Dirichlet series,and give some meaningful estimates for them.     

Some notes on identities for Dirichlet L-functions

Let q ≥ 3 be an integer, and χ be a Dirichlet character modulo q, L(s, χ) denote the Dirichlet L-function corresponding to χ. In this paper, we show some early information on the mean value of the Dirichlet L-functions and give some new identities for     

Complete solving of explicit evaluation of Gauss sums in the index 2 case

Let p be a prime number,N be a positive integer such that gcd(N,p) = 1,q = pf where f is the multiplicative order of p modulo N.Let χ be a primitive multiplicative character of order N over finite field Fq.This paper studies the problem of explicit evaluation of Gauss sums G(χ) in the "index 2 case"(i.e.[(Z/NZ):p] = 2).Firstly,the classification of the Gauss sums in the index 2 case is presented.Then,the explicit evaluation of Gauss sums G(χλ)(1 λ N-1) in the index 2 case with order N being general even integer(i.e.N = 2r·N0,where r,N0 are positive integers and N0 3 is odd) is obtained.Thus,combining with the researches before,the problem of explicit evaluation of Gauss sums in the index 2 case is completely solved.     

THE ACTION OF THE LINEAR CHARACTER GROUP ON THE SET OF NON-LINEAR IRREDUCIBLE CHARACTERS

Let G be a nonabelian finite group. Then Irr(G/G′) is an abelian group under the multiplication of characters and acts on the set of non-linear irreducible characters of G via the multiplication of characters. The purpose of this paper is to establish some facts about the action of linear character group on non-linear irreducible characters and determine the structures of groups G for which either all the orbit kernels are trivial or the number of orbits is at most two. Using the established results on this action, it is very easy to classify groups G having at most three nomlinear irreducible characters.     

Graphs of nonsolvable groups with four degree-vertices

Let G be a finite group. The degree(vertex) graph Γ(G) attached to G is a character degree graph.Its vertices are the degrees of the nonlinear irreducible complex characters of G, and different vertices m, n are adjacent if the greatest common divisor(m, n) 1. In this paper, we classify all graphs with four vertices that occur as Γ(G) for nonsolvable groups G.     

ZEROS OF BRAUER CHARACTERS

The authors obtain a sufficient condition to determine whether an element is a vanishing regular element of some Brauer character. More precisely, let G be a finite group and p be a fixed prime, and H = G ′O p ′ (G); if g ∈ G0 -H0 with o(gH ) coprime to the number of irreducible p-Brauer characters of G, then there always exists a nonlinear irreducible p-Brauer character which vanishes on g. The authors also show in this note that the sums of certain irreducible p-Brauer characters take the value zero on every element of G0-H0 .     

Neighbor sum distinguishing total colorings of triangle free planar graphs

A total k-coloring c of a graph G is a proper total coloring c of G using colors of the set[k] = {1, 2,..., k}. Let f(u) denote the sum of the color on a vertex u and colors on all the edges incident to u. A k-neighbor sum distinguishing total coloring of G is a total k-coloring of G such that for each edge uv ∈ E(G), f(u) = f(v). By χ nsd(G), we denote the smallest value k in such a coloring of G. Pil′sniak and Wo′zniak conjectured that χ nsd(G) ≤Δ(G) + 3 for any simple graph with maximum degree Δ(G). In this paper, by using the famous Combinatorial Nullstellensatz, we prove that the conjecture holds for any triangle free planar graph with maximum degree at least 7.     

Finite Groups in Which Each Irreducible Character has at Most Two Zeros

Let G be a finite group, Irr(G) denotes the set of irreducible complex characters of G and gG the conjugacy class of G containing element g. A well-known theorem of Burnside([1,Theorem 3.15]) states that every nonlinear X ∈ Irr(G) has a zero on G, that is, an element x (or a conjugacy class xG) of G with X(x) = 0. So, if the number of zeros of character table is very small, we may expect, the structure of group is heavily restricted. For example, [2, Proposition 2.7] claimes that G is a Frobenius group with a complement of order 2 if each row in charcter table has at most one zero (its proof uses the classification of simple groups). In this note, we characterize the finite group G satisfying the following hypothesis:     

关于完全二部图$K_{4, n}$和$K_{n, n}$的点可区别 $IE$-全染色的一些注记

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.     

Remarks on Vertex-Distinguishing IE-Total Coloring of Complete Bipartite Graphs K4,n and Kn,n

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.     

Zeros of Monomial Brauer Characters

Let G be a finite group and p be a fixed prime. A p-Brauer character of G is said to be monomial if it is induced from a linear p-Brauer character of some subgroup(not necessarily proper) of G. Denote by IBr_m(G) the set of irreducible monomial p-Brauer′characters of G. Let H = G′O~p′(G) be the smallest normal subgroup such that G/H is an abelian p′-group. Suppose that g ∈ G is a p-regular element and the order of gH in the factor group G/H does not divide |IBr_m(G)|. Then there exists ? ∈ IBr_m(G) such that ?(g) = 0.     

Hybrid subconvexity bounds for twisted L-functions on GL(3)

Let q be a large prime, and χ the quadratic character modulo q. Let Φ be a self-dual Hecke-Maass cusp form for SL(3, Z), and uj a Hecke-Maass cusp form for Γ0(q) ? SL(2, Z) with spectral parameter tj. We prove, for the first time, some hybrid subconvexity bounds for the twisted L-functions on GL(3), such as L(1/2, Φ× uj ×χ) ?_(Φ,ε)(q(1 + |tj |))~(3/2-θ+ε) and L(1/2 + it, Φ×χ) ?_(Φ,ε)(q(1 + |t|))~(3/4-θ/2+ε) for any ε 0, where θ = 1/23 is admissible. The proofs depend on the first moment of a family of L-functions in short intervals. In order to bound this moment, we first use the approximate functional equations, the Kuznetsov formula, and the Voronoi formula to transform it to a complicated summation, and then we apply different methods to estimate it, which give us strong bounds in different aspects. We also use the stationary phase method and the large sieve inequalities.     

RESEARCH ANNOUNOEMENTS

Let G be a finite group, Irr(G) denotes the set of irreducible complex characters of G and gGthe conjugacy class of G containing element g. A well-known theorem of Burnside([1,Theorem3. 15]) states that every nonlinear X E Irr(G) has a zero on G, that is, an element x (or a conjugacyclass xG) of G with x(x) = 0. So, if the number of zeros of character table is very small, we mayexpect, the structure of group is heavily restricted. For example, [2, Proposition 2.7] claimesthat G is a Fro…     

Vertex-antimagic labelings of regular graphs

Let G = (V, E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertex-antimagic total labeling of G is a bijection f from V (G) ∪ E(G) onto the set of consecutive integers 1, 2, . . . , p + q, such that the vertex-weights form an arithmetic progression with the initial term a and difference d, where the vertex-weight of x is the sum of the value f (x) assigned to the vertex x together with all values f (xy) assigned to edges xy incident to x. Such labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study the properties of such labelings and examine their existence for 2r-regular graphs when the difference d is 0, 1, . . . , r + 1.     

The 2-pebbling property for dense graphs

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number f(G) is the smallest number m such that for every distribution of m pebbles and every vertex v,a pebble can be moved to v. A graph G is said to have the 2-pebbling property if for any distribution with more than 2f(G) q pebbles, where q is the number of vertices with at least one pebble, it is possible,using pebbling moves, to get two pebbles to any vertex. Snevily conjectured that G(s,t) has the 2-pebbling property, where G(s, t) is a bipartite graph with partite sets of size s and t (s ≥ t). Similarly, the-pebbling number f (G) is the smallest number m such that for every distribution of m pebbles and every vertex v, pebbles can be moved to v. Herscovici et al. conjectured that f(G) ≤ 1.5n + 8-6 for the graph G with diameter 3, where n = |V (G)|. In this paper, we prove that if s ≥ 15 and G(s, t) has minimum degree at least (s+1)/ 2 , then f (G(s, t)) = s + t, G(s, t) has the 2-pebbling property and f (G(s, t)) ≤ s + t + 8(-1). In other words, we extend a result due to Czygrinow and Hurlbert, and show that the above Snevily conjecture and Herscovici et al. conjecture are true for G(s, t) with s ≥ 15 and minimum degree at least (s+1)/ 2 .