Pair correlation for Dedekind zeta functions of abelian extensions

08/13/2019
by   David de Laat, et al.
0

Here we study problems related to the proportions of zeros, especially simple and distinct zeros on the critical line, of Dedekind zeta functions. We obtain new bounds on a counting function that measures the discrepancy of the zeta functions from having all zeros simple. In particular, for quadratic number fields, we deduce that more than 45 work based on Montgomery's pair correlation approach for the Riemann zeta function. Our optimization problems can be interpreted as interpolants between the pair correlation bound for the Riemann zeta function and the Cohn-Elkies sphere packing bound in dimension 1. We compute the bounds through optimization over Schwartz functions using semidefinite programming and also show how semidefinite programming can be used to optimize over functions with bounded support.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2022

Semidefinite programming bounds for binary codes from a split Terwilliger algebra

We study the upper bounds for A(n,d), the maximum size of codewords with...
research
06/20/2022

Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions

The Cohn-Elkies linear program for sphere packing, which was used to sol...
research
11/19/2018

Corrected pair correlation functions for environments with obstacles

Environments with immobile obstacles or void regions that inhibit and al...
research
06/03/2019

Attractive vs. truncated repulsive supercooled liquids : dynamics is encoded in the pair correlation function

We compare glassy dynamics in two liquids that differ in the form of the...
research
05/05/2020

Primes in arithmetic progressions and semidefinite programming

Assuming the generalized Riemann hypothesis, we give asymptotic bounds o...
research
01/29/2023

Fast Correlation Function Calculator – A high-performance pair counting toolkit

Context. A novel high-performance exact pair counting toolkit called Fas...
research
08/19/2020

Matchings, hypergraphs, association schemes, and semidefinite optimization

We utilize association schemes to analyze the quality of semidefinite pr...

Please sign up or login with your details

Forgot password? Click here to reset