An optimal lower bound on the number of total operations to compute 0-1 polynomials over the field of complex numbers

1978 ◽  
Author(s):  
Jean-Paul Van de Wiele
Keyword(s):  
Lower Bound ◽  
Complex Numbers ◽  
Optimal Lower Bound

On the Inf-Sup Constant of a Triangular Spectral Method for the Stokes Equations

2016 ◽  
Vol 16 (3) ◽  
pp. 507-522 ◽  
Author(s):  
Yanhui Su ◽  
Lizhen Chen ◽  
Xianjuan Li ◽  
Chuanju Xu
Keyword(s):  
Lower Bound ◽  
Error Estimate ◽  
Spectral Method ◽  
Stokes Equations ◽  
Necessary Condition ◽  
Well Posedness ◽  
Saddle Point Problems ◽  
Numerical Examples ◽  
Lbb Condition ◽  
Optimal Lower Bound

AbstractThe Ladyženskaja–Babuška–Brezzi (LBB) condition is a necessary condition for the well-posedness of discrete saddle point problems stemming from discretizing the Stokes equations. In this paper, we prove the LBB condition and provide the (optimal) lower bound for this condition for the triangular spectral method proposed by L. Chen, J. Shen, and C. Xu in [3]. Then this lower bound is used to derive an error estimate for the pressure. Some numerical examples are provided to confirm the theoretical estimates.

An optimal lower bound for nonregular languages

1994 ◽  
Vol 52 (6) ◽  
pp. 339 ◽  
Author(s):  
A. Bertoni ◽  
Carlo Mereghetti ◽  
Giovanni Pighizzini
Keyword(s):  
Lower Bound ◽  
Optimal Lower Bound

scholarly journals Extreme Values of the Riemann Zeta Function on the 1-Line

2017 ◽  
Vol 2019 (22) ◽  
pp. 6924-6932 ◽  
Author(s):  
Christoph Aistleitner ◽  
Kamalakshya Mahatab ◽  
Marc Munsch
Keyword(s):  
Lower Bound ◽  
Extreme Values ◽  
Mean Square ◽  
Self Similarity ◽  
New Variant ◽  
The Riemann Zeta Function ◽  
Riemann Zeta ◽  
The Mean ◽  
Resonator Method ◽  
Optimal Lower Bound

Abstract We prove that there are arbitrarily large values of t such that $|\zeta (1+it)| \geq e^{\gamma } (\log _{2} t +\log _{3} t) + \mathcal{O}(1)$. This essentially matches the prediction for the optimal lower bound in a conjecture of Granville and Soundararajan. Our proof uses a new variant of the “long resonator” method. While earlier implementations of this method crucially relied on a “sparsification” technique to control the mean-square of the resonator function, in the present paper we exploit certain self-similarity properties of a specially designed resonator function.

An optimal lower bound on the number of variables for graph identification

COMBINATORICA ◽  
1992 ◽  
Vol 12 (4) ◽  
pp. 389-410 ◽  
Author(s):  
Jin-Yi Cai ◽  
Martin F�rer ◽  
Neil Immerman
Keyword(s):  
Lower Bound ◽  
Optimal Lower Bound

scholarly journals Improved bounds for arithmetic progressions in product sets

2015 ◽  
Vol 11 (08) ◽  
pp. 2295-2303 ◽  
Author(s):  
Dmitrii Zhelezov
Keyword(s):  
Lower Bound ◽  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Complex Numbers ◽  
Natural Numbers ◽  
Multiplicative Constant ◽  
Product Sets

Let B be a set of natural numbers of size n. We prove that the length of the longest arithmetic progression contained in the product set B.B = {bb′|b, b′ ∈ B} cannot be greater than O(n log n) which matches the lower bound provided in an earlier paper up to a multiplicative constant. For sets of complex numbers, we improve the bound to Oϵ(n1 + ϵ) for arbitrary ϵ > 0 assuming the GRH.

Sign in / Sign up

Export Citation Format

Share Document