Lower bounds for the conductor of L-functions

J. Kaczorowski; A. Perelli

Displaying similar documents to “Lower bounds for the conductor of L-functions”

Approximate formulae for L(1,χ)

Olivier Ramaré (2001)

Acta Arithmetica

Similarity:

Circuit lower bounds and linear codes.

Paturi, R., Pudlák, P. (2004)

Zapiski Nauchnykh Seminarov POMI

Similarity:

An improper Cramer-Rao lower bound

L. Gajek (1987)

Applicationes Mathematicae

Similarity:

Lower Bounds on the Directed Sweepwidth of Planar Shapes

Markov, Minko, Haralampiev, Vladislav, Georgiev, Georgi (2015)

Serdica Journal of Computing

Similarity:

We investigate a recently introduced width measure of planar shapes called sweepwidth and prove a lower bound theorem on the sweepwidth.

Automated proofs of upper bounds on the running time of splitting algorithms.

Kulikov, A.S., Fedin, S.S. (2004)

Zapiski Nauchnykh Seminarov POMI

Similarity:

Lower order terms of the second moment of S(t)

Tsz Ho Chan (2006)

Acta Arithmetica

Similarity:

Heights, regulators and Schinzel's determinant inequality

Shabnam Akhtari, Jeffrey D. Vaaler (2016)

Acta Arithmetica

Similarity:

We prove inequalities that compare the size of an S-regulator with a product of heights of multiplicatively independent S-units. Our upper bound for the S-regulator follows from a general upper bound for the determinant of a real matrix proved by Schinzel. The lower bound for the S-regulator follows from Minkowski's theorem on successive minima and a volume formula proved by Meyer and Pajor. We establish similar upper bounds for the relative regulator of an extension l/k of number fields. ...