scholarly journals On sums of coefficients of polynomials related to the Borwein conjectures

2021 ◽  
Author(s):  
Ankush Goswami ◽  
Venkata Raghu Tej Pantangi
Keyword(s):  
Number Theory ◽  
Lower Bound ◽  
Asymptotic Formula ◽  
Recent Result ◽  
Asymptotic Estimate ◽  
Partial Sums ◽  
Absolute Value ◽  
Partial Sum ◽  
Special Cases ◽  
Error Terms

AbstractRecently, Li (Int J Number Theory, 2020) obtained an asymptotic formula for a certain partial sum involving coefficients for the polynomial in the First Borwein conjecture. As a consequence, he showed the positivity of this sum. His result was based on a sieving principle discovered by himself and Wan (Sci China Math, 2010). In fact, Li points out in his paper that his method can be generalized to prove an asymptotic formula for a general partial sum involving coefficients for any prime $$p>3$$ p > 3 . In this work, we extend Li’s method to obtain asymptotic formula for several partial sums of coefficients of a very general polynomial. We find that in the special cases $$p=3, 5$$ p = 3 , 5 , the signs of these sums are consistent with the three famous Borwein conjectures. Similar sums have been studied earlier by Zaharescu (Ramanujan J, 2006) using a completely different method. We also improve on the error terms in the asymptotic formula for Li and Zaharescu. Using a recent result of Borwein (JNT 1993), we also obtain an asymptotic estimate for the maximum of the absolute value of these coefficients for primes $$p=2, 3, 5, 7, 11, 13$$ p = 2 , 3 , 5 , 7 , 11 , 13 and for $$p>15$$ p > 15 , we obtain a lower bound on the maximum absolute value of these coefficients for sufficiently large n.

scholarly journals On the size of the maximum of incomplete Kloosterman sums

2021 ◽  
pp. 1-28
Author(s):  
DANTE BONOLIS
Keyword(s):  
Number Theory ◽  
Fourier Transform ◽  
Lower Bound ◽  
Classical Problem ◽  
Analytic Number Theory ◽  
Kloosterman Sums ◽  
Log P ◽  
General Context ◽  
Absolute Value ◽  
Complex Valued

Abstract Let $t:{\mathbb F_p} \to C$ be a complex valued function on ${\mathbb F_p}$ . A classical problem in analytic number theory is bounding the maximum $$M(t): = \mathop {\max }\limits_{0 \le H < p} \left| {{1 \over {\sqrt p }}\sum\limits_{0 \le n < H} {t(n)} } \right|$$ of the absolute value of the incomplete sums $(1/\sqrt p )\sum\nolimits_{0 \le n < H} {t(n)} $ . In this very general context one of the most important results is the Pólya–Vinogradov bound $$M(t) \le {\left\| {\hat t} \right\|_\infty }\log 3p,$$ where $\hat t:{\mathbb F_p} \to \mathbb C$ is the normalized Fourier transform of t. In this paper we provide a lower bound for certain incomplete Kloosterman sums, namely we prove that for any $\varepsilon > 0$ there exists a large subset of $a \in \mathbb F_p^ \times $ such that for $${\rm{k}}{1_{a,1,p}}:x \mapsto e((ax + \bar x)/p)$$ we have $$M({\rm{k}}{1_{a,1,p}}) \ge \left( {{{1 - \varepsilon } \over {\sqrt 2 \pi }} + o(1)} \right)\log \log p,$$ as $p \to \infty $ . Finally, we prove a result on the growth of the moments of ${\{ M({\rm{k}}{1_{a,1,p}})\} _{a \in \mathbb F_p^ \times }}$ .

scholarly journals Some problems of Analytic number theory IV

2002 ◽  
Vol Volume 25 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Asymptotic Formula ◽  
Kernel Function ◽  
Generating Functions ◽  
Analytic Number Theory ◽  
Second Order ◽  
Analytic Number ◽  
International Audience ◽  
Error Terms

International audience In the present paper, we use Ramachandra's kernel function of the second order, namely ${\rm Exp} ((\sin z)^2)$, which has some advantages over the earlier kernel ${\rm Exp} (z^{4a+2})$ where $a$ is a positive integer. As an outcome of the new kernel we are able to handle $\Omega$-theorems for error terms in the asymptotic formula for the summatory function of the coefficients of generating functions of the ${\rm Exp}(\zeta(s)), {\rm Exp\,Exp}(\zeta(s))$ and also of the type ${\rm Exp\,Exp}((\zeta(s))^{\frac{1}{2}})$.

Fast Bilinear Algorithms for Symmetric Tensor Contractions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Edgar Solomonik ◽  
James Demmel
Keyword(s):  
Symmetric Matrix ◽  
Matrix Multiplication ◽  
Computational Cost ◽  
Symmetric Tensor ◽  
Partial Sums ◽  
Symmetric Tensors ◽  
Outer Product ◽  
Bilinear Complexity ◽  
Special Cases ◽  
Tensor Contractions

AbstractIn matrix-vector multiplication, matrix symmetry does not permit a straightforward reduction in computational cost. More generally, in contractions of symmetric tensors, the symmetries are not preserved in the usual algebraic form of contraction algorithms. We introduce an algorithm that reduces the bilinear complexity (number of computed elementwise products) for most types of symmetric tensor contractions. In particular, it lowers the bilinear complexity of symmetrized contractions of symmetric tensors of order {s+v} and {v+t} by a factor of {\frac{(s+t+v)!}{s!t!v!}} to leading order. The algorithm computes a symmetric tensor of bilinear products, then subtracts unwanted parts of its partial sums. Special cases of this algorithm provide improvements to the bilinear complexity of the multiplication of a symmetric matrix and a vector, the symmetrized vector outer product, and the symmetrized product of symmetric matrices. While the algorithm requires more additions for each elementwise product, the total number of operations is in some cases less than classical algorithms, for tensors of any size. We provide a round-off error analysis of the algorithm and demonstrate that the error is not too large in practice. Finally, we provide an optimized implementation for one variant of the symmetry-preserving algorithm, which achieves speedups of up to 4.58\times for a particular tensor contraction, relative to a classical approach that casts the problem as a matrix-matrix multiplication.

scholarly journals An Exponential Separation Between MA and AM Proofs of Proximity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Recent Result ◽  
Query Complexity ◽  
Random String ◽  
Natural Property ◽  
Public And Private ◽  
Alternate Proof ◽  
Interactive Proofs ◽  
Exponential Separation

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

scholarly journals On the Number of Quadratic Twists with a Rational Point of Almost Minimal Height

2020 ◽  
Author(s):  
Joachim Petit
Keyword(s):  
Asymptotic Formula ◽  
Elliptic Curve ◽  
Asymptotic Estimate ◽  
Rational Point ◽  
Quadratic Fields ◽  
Real Quadratic Fields ◽  
Quadratic Twists ◽  
The Family ◽  
Minimal Height ◽  
Real Quadratic

Abstract We investigate the number of curves having a rational point of almost minimal height in the family of quadratic twists of a given elliptic curve. This problem takes its origin in the work of Hooley, who asked this question in the setting of real quadratic fields. In particular, he showed an asymptotic estimate for the number of such fields with almost minimal fundamental unit. Our main result establishes the analogue asymptotic formula in the setting of quadratic twists of a fixed elliptic curve.

scholarly journals The Algebraic Degree of Phase-Type Distributions

2010 ◽  
Vol 47 (03) ◽  
pp. 611-629
Author(s):  
Mark Fackrell ◽  
Qi-Ming He ◽  
Peter Taylor ◽  
Hanqin Zhang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Polynomial Algorithm ◽  
Algebraic Degree ◽  
Nonnegative Matrices ◽  
Stieltjes Transform ◽  
Special Cases ◽  
Phase Type ◽  
Phase Type Distributions ◽  
The Matrix

This paper is concerned with properties of the algebraic degree of the Laplace-Stieltjes transform of phase-type (PH) distributions. The main problem of interest is: given a PH generator, how do we find the maximum and the minimum algebraic degrees of all irreducible PH representations with that PH generator? Based on the matrix exponential (ME) order of ME distributions and the spectral polynomial algorithm, a method for computing the algebraic degree of a PH distribution is developed. The maximum algebraic degree is identified explicitly. Using Perron-Frobenius theory of nonnegative matrices, a lower bound and an upper bound on the minimum algebraic degree are found, subject to some conditions. Explicit results are obtained for special cases.

A note on Spitzer's lemma and its application to the maximum of partial sums of dependent random variables

1976 ◽  
Vol 13 (2) ◽  
pp. 361-364 ◽  
Author(s):  
M. E. Solari ◽  
J. E. A. Dunnage
Keyword(s):  
Infinite Sequence ◽  
Random Variables ◽  
Finite Sequence ◽  
Partial Sums ◽  
Dependent Random Variables ◽  
Finite Segment ◽  
Exchangeable Random Variables ◽  
Partial Sum

We give an expression for the expectation of max (0, S1, …, Sn) where Sk is the kth partial sum of a finite sequence of exchangeable random variables X1, …, Xn. When the Xk are also independent, the formula we give has already been obtained by Spitzer; and when the sequence is a finite segment of an infinite sequence of exchangeable random variables, it is a consequence of a theorem of Hewitt.

scholarly journals New inequalities of Hermite-Hadamard type for n-times differentiable convex and concave functions with applications

Filomat ◽  
2016 ◽  
Vol 30 (10) ◽  
pp. 2609-2621
Author(s):  
M.A. Latif ◽  
S.S. Dragomir
Keyword(s):  
Concave Functions ◽  
Absolute Value ◽  
Trapezoidal Formula ◽  
Special Means ◽  
Second Derivatives ◽  
Special Cases ◽  
New Inequalities

In this paper, a new identity for n-times differntiable functions is established and by using the obtained identity, some new inequalities Hermite-Hadamard type are obtained for functions whose nth derivatives in absolute value are convex and concave functions. From our results, several inequalities of Hermite-Hadamard type can be derived in terms of functions whose first and second derivatives in absolute value are convex and concave functions as special cases. Our results may provide refinements of some results already exist in literature. Applications to trapezoidal formula and special means of established results are given.

Sign in / Sign up

Export Citation Format

Share Document