A Poisson Summation Formula for Extensions of Number Fields

2000 ◽  
Vol 61 (1) ◽  
pp. 36-50
Author(s):  
Eduardo Friedman ◽  
Nils-Peter Skoruppa
2012 ◽  
Vol 154 (2) ◽  
pp. 193-212 ◽  
Author(s):  
LEO GOLDMAKHER ◽  
BENOÎT LOUVEL

AbstractWe formulate and prove a large sieve inequality for quadratic characters over a number field. To do this, we introduce the notion of an n-th order Hecke family. We develop the basic theory of these Hecke families, including versions of the Poisson summation formula.


2017 ◽  
Vol 13 (02) ◽  
pp. 487-512
Author(s):  
Ha Thanh Nguyen Tran

The function [Formula: see text] for a number field is analogous to the dimension of the Riemann–Roch spaces at divisors on an algebraic curve. We provide a method to compute this function for number fields with unit group of rank at most 2, even with large discriminant. This method is based on using LLL-reduced bases, the “jump algorithm” and Poisson summation formula.


1961 ◽  
Vol 12 (3) ◽  
pp. 133-138 ◽  
Author(s):  
L. Carlitz

1. Guinand (2) has obtained finite identities of the typewhere m, n, N are positive integers and eitherorwhere γ is Euler's constant and the notation ∑′ indicates that when x is integral the term r = x is multiplied by ½. Clearly there is no loss of generality in taking N = 1 in (1.1).


Author(s):  
Nelson Petulante

We establish a generalized version of the classical Poisson summation formula. This formula incorporates a special feature called “compression”, whereby, at the same time that the formula equates a series to its Fourier dual, the compressive feature serves to enable both sides of the equation to converge.


Sign in / Sign up

Export Citation Format

Share Document