On exponential sums over primes and application in Waring-Goldbach problem

In this paper, we prove the following estimate on exponential sums over primes: Let κ≥1,βκ=1/2 log κ/log2, x≥2 and α=a/q λsubject to (a, q) = 1, 1≤a≤q, and λ∈R. Then As an application, we prove that with at most O(N2/8 ε) exceptions, all positive integers up to N satisfying some necessary congruence conditions are the sum of three squares of primes. This result is as strong as what has previously been established under the generalized Riemann hypothesis.     

Some new sums related to D. H. Lehmer problem

About Lehmer’s number, many people have studied its various properties, and obtained a series of interesting results. In this paper, we consider a generalized Lehmer problem: Let p be a prime, and let N(k; p) denote the number of all 1 ? a _i ? p ? 1 such that a ₁ a ₂ … a _k ≡ 1 mod p and 2 | a _i + ā _i + 1, i = 1, 2, …, k. The main purpose of this paper is using the analytic method, the estimate for character sums and trigonometric sums to study the asymptotic properties of the counting function N(k; p), and give an interesting asymptotic formula for it.     

On the k-polygonal numbers and the mean value of Dedekind sums

For any positive integer k ≥ 3, it is easy to prove that the k-polygonal numbers are a_n(k) = (2n+n(n?1)(k?2))/2. The main purpose of this paper is, using the properties of Gauss sums and Dedekind sums, the mean square value theorem of Dirichlet L-functions and the analytic methods, to study the computational problem of one kind mean value of Dedekind sums S(a_n(k)ā_m(k), p) for k-polygonal numbers with 1 ≤ m, n ≤ p ? 1, and give an interesting computational formula for it.     

Linear combinations of prime powers in sums of terms of binary recurrence sequences

Let (U _n ) _n≥0 be a nondegenerate binary recurrence sequence with positive discriminant. Let p ₁ , . . . , p _s be fixed prime numbers, b ₁ , . . . , b _s be fixed nonnegative integers, and a ₁ , . . . , a _t be positive integers. In this paper, under certain assumptions, we obtain a finiteness result for the solution of the Diophantine equation \( {\alpha}_1{U}_{n1}+\cdots +{\alpha}_t{U}_{n1}={b}_1{p}_1^{z_1}+\cdots {b}_s{p}_s^{z_s}. \) Moreover, we explicitly solve the equation F _n1 + F _n2 = 2 ^z1 + 3 ^z2 in nonnegative integers n ₁, n ₂, z ₁, z ₂ with z ₂ ≥ z ₁. The main tools used in this work are the lower bound for linear forms in logarithms and the Baker–Davenport reduction method. This work generalizes the recent papers [E. Mazumdar and S.S. Rout, Prime powers in sums of terms of binary recurrence sequences, arXiv:1610.02774] and [C. Bertók, L. Hajdu, I. Pink, and Z. Rábai, Linear combinations of prime powers in binary recurrence sequences, Int. J. Number Theory, 13(2):261–271, 2017].     

Short cubic exponential sums over primes

For y ≥ x ^4/5 L ^8B+151 (where L = log(xq) and B is an absolute constant), a nontrivial estimate is obtained for short cubic exponential sums over primes of the form S ₃(α; x, y) = ∑ _x?y<n≤x Λ(n)e(αn ³), where α = a/q + θ/q ², (a, q) = 1, L ^32(B+20) < q ≤ y ⁵ x ^?2 L ^?32(B+20), |θ| ≤ 1, Λ is the von Mangoldt function, and e(t) = e ^2πit.     

On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

A note on the normalizing sequences for sums of linear processes in the case of negative memory

We consider the partial-sum process \( {S}_n(t)={\sum}_{k=0}^{\left\lfloor nt\right\rfloor }{X}_k \) of linear processes \( {X}_n={\sum}_{i=0}^{\infty }{c}_i{\upxi}_{n-i} \) with independent identically distributed innovations {ξ _i } belonging to the domain of attraction of α-stable law (0 < α ≤ 2). If |c _k |?=?k ^?γ?,?k?∈???,?γ?> max(1, 1/α), and \( {\sum}_{k=0}^{\infty}\kern0.5em ck=0 \) (the case of negative memory for the stationary sequence {X _n }), then it is known that the normalizing sequence of S _n (1) can grow as n ^1/α?γ+1 or remain bounded if the signs of the coefficients are constant or alternate, respectively. It is of interest to know whether it is possible, given ? ∈ (0, 1/α ? γ + 1), to change the signs of c _k so that the rate of growth of the normalizing sequence would be n ^? . In this paper, we give the positive answer: we propose a way of choosing the signs and investigate the finite-dimensional convergence of appropriately normalized S _n (t) to linear fractional Lévy motion.     

Estimates of sums of integrals of the Legendre Polynomial

Estimates of sums \({R_{nk}}\left( x \right) = \sum\limits_{m = n}^\infty {{P_{mk}}\left( x \right)} \) are established. Here, P_n0(x)= P_n(x), \({R_{nk}}\left( x \right) = \int\limits_.^x {{P_{n,k - 1}}\left( y \right)dy} \), P_n is the Legendre polynomial with standard normalization P_n(1) = 1. With k = 1 in the main interval [–1, 1] the sum decreases with increasing n as n^–1, and in the half-open interval [–1, 1), as n^–3/2. With k > 1 the point x = 1 does not need to be excluded. The sum decreases as n^-k–1/2. Moreover, a small increase in the multiplicative constant permits to obtain the estimate \(|{R_{nk}}\left( {\cos \theta } \right)| < \frac{{C{{\sin }^{k - 3/2}}\theta }}{{{n^{k + 1/2}}}}\), where C depends weakly on k (but not on n, θ). In passing, a Mehler–Dirichlet-type integral for R_nk(cos θ) is deduced.     

On the summability factors of infinite series

The author has established that if [λ_n] is a convex sequence such that the series Σn ^-1λ_n is convergent and the sequence {K _n} satisfies the condition |K _n|=O[log(n+1)]^k(C, 1),k?0, whereK _n denotes the (R, logn, 1) mean of the sequence {n log (n+1)a _n}, then the series Σlog(n+1)^1-kλ_n a _n is summable |R, logn, 1|. The result obtained for the particular casek=0 generalises a previous result of the author [1].     

The <Emphasis Type="Italic">p</Emphasis>-Adic order of the <Emphasis Type="Italic">k</Emphasis>-Fibonacci and <Emphasis Type="Italic">k</Emphasis>-Lucas numbers

Let (F _k,n ) _n and (L _k,n )n be the k-Fibonacci and k-Lucas sequence, respectively, which satisfies the same recursive relation a _n+1 = ka _n + a _n?1 with initial values F _k,0 = 0, F _k,1 = 1, L _k,0 = 2 and L _k,1 = k. In this paper, we characterize the p-adic orders ν _p (F _k,n ) and ν _p (L _k,n ) for all primes p and all positive integers k.     

Testing for change in the mean via convergence in distribution of sup-functionals of weighted tied-down partial sums processes

Let X ₁,..., X _n, n > 1, be nondegenerate independent chronologically ordered realvalued observables with finite means. Consider the “no-change in the mean” null hypothesis H ₀: X ₁,..., X _n is a randomsample on X with Var X <∞. We revisit the problem of nonparametric testing for H ₀ versus the “at most one change (AMOC) in the mean” alternative hypothesis H _A: there is an integer k*, 1 ≤ k* < n, such that EX ₁ = · · · = EX_k* ≠ EX_k*+1 = ··· = EX _n. A natural way of testing for H ₀ versus H _A is via comparing the sample mean of the first k observables to the sample mean of the last n - k observables, for all possible times k of AMOC in the mean, 1 ≤ k < n. In particular, a number of such tests in the literature are based on test statistics that are maximums in k of the appropriately individually normalized absolute deviations Δ_k = |S _k/k - (S _n - S _k)/(n - k)|, where S _k:= X ₁ + ··· + X _k. Asymptotic distributions of these test statistics under H ₀ as n → ∞ are obtained via establishing convergence in distribution of supfunctionals of respectively weighted |Z _n(t)|, where {Z _n(t), 0 ≤ t ≤ 1}_n≥1 are the tied-down partial sums processes such that

$${Z_n}\left( t \right): = \left( {{S_{\left\lceil {\left( {n + 1} \right)t} \right\rceil }} - \left[ {\left( {n + 1} \right)t} \right]{S_n}/n} \right)/\sqrt n $$

if 0 ≤ t < 1, and Z _n(t):= 0 if t = 1. In the present paper, we propose an alternative route to nonparametric testing for H ₀ versus H _A via sup-functionals of appropriately weighted |Z _n(t)|. Simply considering max_1?k<n Δk as a prototype test statistic leads us to establishing convergence in distribution of special sup-functionals of |Z _n(t)|/(t(1 - t)) under H ₀ and assuming also that E|X|^r < ∞ for some r > 2. We believe the weight function t(1 - t) for sup-functionals of |Z _n(t)| has not been considered before.

     

Division Algebras with Left Algebraic Commutators

Let D be a division algebra with center F and K a (not necessarily central) subfield of D. An element a ∈ D is called left algebraic (resp. right algebraic) over K, if there exists a non-zero left polynomial a ₀ + a ₁ x + ? + a _n x ⁿ (resp. right polynomial a ₀ + x a ₁ + ? + x ⁿ a _n ) over K such that a ₀ + a ₁ a + ? + a _n a ⁿ = 0 (resp. a ₀ + a a ₁ + ? + a ⁿ a _n ). Bell et al. proved that every division algebra whose elements are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. In this paper we generalize this result and prove that every division algebra whose all multiplicative commutators are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite provided that the center of division algebra is infinite. Also, we show that every division algebra whose multiplicative group of commutators is left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. Among other results we present similar result regarding additive commutators under certain conditions.     

Equations in finite fields with restricted solution sets. I (Character sums)

In earlier papers, for “large” (but otherwise unspecified) subsets A, B of Z _p and for h(x) ∈ Z _p [x], Gyarmati studied the solvability of the equations a + b = h(x), resp. ab = h(x) with a ∈ A, b ∈ B, x ∈ Z _p , and for large subsets A, B, C, D of Z _p Sárközy showed the solvability of the equations a + b = cd, resp. ab + 1 = cd with a ∈ A, b ∈ B, c ∈ C, d ∈ D. In this series of papers equations of this type will be studied in finite fields. In particular, in Part I of the series we will prove the necessary character sum estimates of independent interest some of which generalize earlier results.     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

On Haar series of <Emphasis Type="Italic">A</Emphasis>–integrable functions

In this paper we obtain a necessary and sufficient condition on the sequence of natural numbers {q _n } such that the almost everywhere convergence of the cubic partial sums S _qn (x) of the multiple Haar series Σ_n a _nχ_n(x) and the condition lim inf \(\lambda \cdot mes\left\{ {x:\begin{array}{*{20}{c}} {\sup } \\ n \end{array}\left| {S{}_{qn}\left( x \right)} \right| \succ \lambda } \right\} = 0\), imply that the coefficients a _n can be uniquely determined by the sum of the series. Also, we have obtained a necessary and sufficient condition for the series \(\sum\limits_{n = 1}^\infty {{\varepsilon _n}{a_n}} {\chi _n}\left( x \right)\) with an arbitrary bounded sequence {ε _n} to be a Fourier-Haar series of an A-integrable function.     

Expectation of the truncated randomly weighted sums with dominatedly varying summands

We consider the asymptotic behavior of the values P(S > x), E(S 1_{S>x}), and E(S | S > x). Here S = θ₁X₁ + θ₂X₂ + · · · + θ_nX_n is a randomly weighted sum of the basic random variables X₁,X₂, . . . , X_n, which follow some special dependence structure, and {θ₁, θ₂, . . . , θ_n} is a collection of nonnegative and arbitrarily dependent random weights; the collections {X₁,X₂, . . .,X_n} and {θ₁, θ₂, . . . , θ_n} are supposed to be independent. We derive asymptotic formulas in the case where the number of summands n is fixed and the distributions of the basic random variables are dominatedly varying.We apply them to some values related to the risk measures of certain weighted sums.     

Estimates for sums of moduli of blocks in trigonometric Fourier series

We consider the following two problems. Problem 1: what conditions on a sequence of finite subsets A _k ? ? and a sequence of functions λ _k : A _k → ? provide the existence of a number C such that any function f ∈ L ₁ satisfies the inequality ‖U _A,Λ(f)‖ _p ≤ C‖f‖₁ and what is the exact constant in this inequality? Here, \(U_{\mathcal{A},\Lambda } \left( f \right)\left( x \right) = \sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {\lambda _k \left( m \right)c_m \left( f \right)e^{imx} } } \right|}\) and c _m (f) are Fourier coefficients of the function f ∈ L ₁. Problem 2: what conditions on a sequence of finite subsets A _k ? ? guarantee that the function \(\sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {c_m \left( h \right)e^{imx} } } \right|}\) belongs to L _p for every function h of bounded variation?     

Symmetric quasi-norms of sums of independent random variables in symmetric function spaces with the Kruglov property

Let X be a symmetric Banach function space on [0, 1] and let E be a symmetric (quasi)-Banach sequence space. Let f = {f _k } _k=1 ⁿ , n ≥ 1 be an arbitrary sequence of independent random variables in X and let {e _k } _k=1 ^∞ ? E be the standard unit vector sequence in E. This paper presents a deterministic characterization of the quantity

$||||\sum\limits_{k = 1}^n {{f_k}{e_k}|{|_E}|{|_X}} $

in terms of the sum of disjoint copies of individual terms of f. We acknowledge key contributions by previous authors in detail in the introduction, however our approach is based on the important recent advances in the study of the Kruglov property of symmetric spaces made earlier by the authors. Authors acknowledge support from the ARC.

     

Normal number constructions for Cantor series with slowly growing bases

Let Q = (q_n)_n=1^∞ be a sequence of bases with q_i ≥ 2. In the case when the q_i are slowly growing and satisfy some additional weak conditions, we provide a construction of a number whose Q-Cantor series expansion is both Q-normal and Q-distribution normal. Moreover, this construction will result in a computable number provided we have some additional conditions on the computability of Q, and from this construction we can provide computable constructions of numbers with atypical normality properties.     

A transformation from Hausdorff to Stieltjes moment sequences

We introduce a non-linear injective transformation τ from the set of non-vanishing normalized Hausdorff moment sequences to the set of normalized Stieltjes moment sequences by the formulaT[(a _n ) _n=1 ^∞ ] _n = 1/a₁ ...a _n . Special cases of this transformation have appeared in various papers on exponential functionals of Lévy processes, partly motivated by mathematical finance. We give several examples of moment sequences arising from the transformation and provide the corresponding measures, some of which are related toq-series.