Ω-results for Beurling's zeta function and lower bounds for the generalised Dirichlet divisor problem

In this paper we study generalised prime systems for which the integer counting function NP(x) is asymptotically well behaved, in the sense that NP(x)=ρx+O(xβ), where ρ is a positive constant and . For such systems, the associated zeta function ζP(s) is holomorphic for . We prove that for , for any ε>0, and also for ε=0 for all such σ except possibly one value. The Dirichlet divisor problem for generalised integers concerns the size of the error term in NkP(x)−Ress=1(ζPk(s)xs/s), which is O(xθ) for some θ<1. Letting αk denote the infimum of such θ, we show that .     

The vanishing order of certain Hecke L-functions of imaginary quadratic fields

Let −D<−4 denote a fundamental discriminant which is either odd or divisible by 8, so that the canonical Hecke character of exists. Let d be a fundamental discriminant prime to D. Let 2k−1 be an odd natural number prime to the class number of . Let χ be the twist of the (2k−1)th power of a canonical Hecke character of by the Kronecker's symbol . It is proved that the vanishing order of the Hecke L-function L(s,χ) at its central point s=k is determined by its root number when , where the constant implied in the symbol ? depends only on k and ?, and is effective for L-functions with root number −1.     

Simple arguments on consecutive power residues

By some extremely simple arguments, we point out the following:

(i)

If n is the least positive kth power non-residue modulo a positive integer m, then the greatest number of consecutive kth power residues mod m is smaller than m/n.

(ii)

Let OK be the ring of algebraic integers in a quadratic field with d∈{−1,−2,−3,−7,−11}. Then, for any irreducible π∈OK and positive integer k not relatively prime to , there exists a kth power non-residue ω∈OK modulo π such that .

     

Some identities involving theta functions

Let (|q|<1). For k∈N it is shown that there exist k rational numbers A(k,0),…,A(k,k−1) such that

     

Transcendence of certain infinite products

We prove the transcendence results for the infinite product , where Ek(x), Fk(x) are polynomials, α is an algebraic number, and r?2 is an integer. As applications, we give necessary and sufficient conditions for transcendence of and , where Fn and Ln are Fibonacci numbers and Lucas numbers respectively, and {ak}_k?0 is a sequence of algebraic numbers with log‖ak‖=o(rk).     

A description of continued fraction expansions of quadratic surds represented by polynomials

The principal thrust of this investigation is to provide families of quadratic polynomials , where e_k²−f_k²C=n (for any given nonzero integer n) satisfying the property that for any , the period length of the simple continued fraction expansion of is constant for fixed k and lim_k→∞?_k=∞. This generalizes, and completes, numerous results in the literature, where the primary focus was upon |n|=1, including the work of this author, and coauthors, in Mollin (Far East J. Math. Sci. Special Vol. 1998, Part III, 257-293; Serdica Math. J. 27 (2001) 317) Mollin and Cheng (Math. Rep. Acad. Sci. Canada 24 (2002) 102; Internat Math J 2 (2002) 951) and Mollin et al. (JP J. Algebra Number Theory Appl. 2 (2002) 47).     

The oscillation of differential transforms - entire Jacobi expansions

Let L=(1−x²)D²−((β−α)−(α+β+2)x)D with , and . Let f∈C^∞[−1,1], , with normalized Jacobi polynomials and the Cn decrease sufficiently fast. Set Lk=L(Lk−1), k?2. Let ρ>1. If the number of sign changes of (Lkf)(x) in (−1,1) is O(k1/(ρ+1)), then f extends to be an entire function of logarithmic order . For Legendre expansions, the result holds with replaced with .     

On distinct sums and distinct distances

The paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the following arithmetic problem. Consider n pairwise disjoint s element sets and form all sums of pairs of elements of the same set. What is the minimum number of distinct sums one can get this way? This paper proves that the number of distinct sums is at least n^d_s, where d_s=1/c_⌈s/2⌉ is defined in the paper and tends to e⁻¹ as s goes to infinity. Here e is the base of the natural logarithm. As an application we improve the Solymosi-Tóth bound on an old Erdo&#x030B;s problem: we prove that n distinct points in the plane determine distinct distances, where ε>0 is arbitrary. Our bound also finds applications in other related results in discrete geometry. Our bounds are proven through an involved calculation of entropies of several random variables.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

On the quadratic character of quadratic units

Let be a prime. Let a,b∈Z with p?a(a²+b²). In the paper we mainly determine by assuming p=c²+d² or p=Ax²+2Bxy+Cy² with AC−B²=a²+b². As an application we obtain simple criteria for εD to be a quadratic residue , where D>1 is a squarefree integer such that D is a quadratic residue of p, εD is the fundamental unit of the quadratic field with negative norm. We also establish the congruences for and obtain a general criterion for p|U(p−1)/4, where {Un} is the Lucas sequence defined by U₀=0, U₁=1 and Un+1=bUn+k²Un−1(n?1).     

Some irreducibility results for truncated binomial expansions

For positive integers n>k, let be the polynomial obtained by truncating the binomial expansion of n(1+x) at the kth stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of Pn,k(x) over the field of rational numbers when 2≤2k≤n<³(k+1).     

Haj?asz-Sobolev imbedding and extension

The author establishes some geometric criteria for a Haj?asz-Sobolev -extension (resp. -imbedding) domain of Rn with n?2, s∈(0,1] and p∈[n/s,∞] (resp. p∈(n/s,∞]). In particular, the author proves that a bounded finitely connected planar domain Ω is a weak α-cigar domain with α∈(0,1) if and only if for some/all s∈[α,1) and p=(2−α)/(s−α), where denotes the restriction of the Triebel-Lizorkin space on Ω.     

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

A bijection is presented between (1): partitions with conditions f_j+f_j+1≤k−1 and f₁≤i−1, where f_j is the frequency of the part j in the partition, and (2): sets of k−1 ordered partitions (n⁽¹⁾,n⁽²⁾,…,n^(k−1)) such that and , where m_j is the number of parts in n^(j). This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the k−1 ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud’s version of the Burge correspondence.     

Dense edge-magic graphs and thin additive bases

A graph G of order n and size m is edge-magic if there is a bijection l:V(G)∪E(G)→[n+m] such that all sums l(a)+l(b)+l(ab), ab∈E(G), are the same. We present new lower and upper bounds on M(n), the maximum size of an edge-magic graph of order n, being the first to show an upper bound of the form . Concrete estimates for ε can be obtained by knowing s(k,n), the maximum number of distinct pairwise sums that a k-subset of [n] can have.So, we also study s(k,n), motivated by the above connections to edge-magic graphs and by the fact that a few known functions from additive number theory can be expressed via s(k,n). For example, our estimate

     

Independence polynomials of k-tree related graphs

An independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote the cardinality of a maximum independent set and f_s(G) for 0≤s≤α(G) denote the number of independent sets of s vertices. The independence polynomial defined first by Gutman and Harary has been the focus of considerable research recently. Wingard bounded the coefficients f_s(T) for trees T with n vertices: for s≥2. We generalize this result to bounds for a very large class of graphs, maximal k-degenerate graphs, a class which includes all k-trees. Additionally, we characterize all instances where our bounds are achieved, and determine exactly the independence polynomials of several classes of k-tree related graphs. Our main theorems generalize several related results known before.     

Rationality theorems for Hecke operators on GLn

We define n families of Hecke operators for GL_n whose generating series are rational functions of the form q_k(u)⁻¹ where q_k is a polynomial of degree , and whose form is that of the kth exterior product. This work can be viewed as a refinement of work of Andrianov (Math. USSR Sb. 12(3) (1970)), in which he defined Hecke operators the sum of whose generating series was a rational function with nontrivial numerator and whose denominator was essentially .By a careful analysis of the Satake map which defines an isomorphism between a local Hecke algebra and a ring of symmetric polynomials, we define n families of (polynomial) Hecke operators and characterize their generating series as rational functions. We then give an explicit means by which to locally invert the Satake isomorphism, and show how to translate these polynomial operators back to the classical double coset setting. The classical Hecke operators have generating series of exactly the same form as their polynomial counterparts, and hence are of number-theoretic interest. We give explicit examples for GL₃ and GL₄.     

On almost prime k-tuples

Let k?2 and ai,bi(1?i?k) be integers such that ai>0 and _∏1?i<j?k(aibj−ajbi)≠0. Let Ω(m) denote the total number of prime factors of m. Suppose has no fixed prime divisors. Results of the form where rk is asymptotic to klogk have been obtained by using sieve methods, in particular weighted sieves. In this paper, we use another kind of weighted sieve due to Selberg to obtain improved admissible values for rk.     

On the average orders of the error term in the Dirichlet divisor problem

Let Δ(x) be the error term in the Dirichlet divisor problem. The purpose of this paper is to study the difference between two kinds of mean value formulas of Δ(x), that is, the mean value formulas and ∑_n?xΔ(n)^k with a natural number k. In particular we study the case k=2 and 3 in detail.