Jump to ContentJump to Main Navigation
Convolution and EquidistributionSato-Tate Theorems for Finite-Field Mellin Transforms (AM-180)$
Users without a subscription are not able to see the full content.

Nicholas M. Katz

Print publication date: 2012

Print ISBN-13: 9780691153308

Published to Princeton Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691153308.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in HSO for personal use (for details see http://www.universitypressscholarship.com/page/privacy-policy).date: 19 January 2018

SL(n) Examples with Slightly Composite n

SL(n) Examples with Slightly Composite n

Chapter:
(p.135) Chapter 22 SL(n) Examples with Slightly Composite n
Source:
Convolution and Equidistribution
Author(s):

Nicholas M. Katz

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691153308.003.0023

This chapter continues to study the object N of Theorem 21.1. Thus, k is a finite field of characteristic p, ψ‎ a nontrivial additive character of k, f(x) = f(x)=∑i=−baAixi∈k[x,1/x]Axⁱ ɛ k[x, 1/x] is a Laurent polynomial of “bidegree” (a, b), with a; b both ≤ 1 and both prime to p. It is assumed that f(x) is Artin–Schreier reduced. It takes for N the object N:ℒψ(f(x))(1/2)[1]∈ρarith.

Keywords:   number theory, Laurent polynomial, Artin–Schreier reduced polynomial

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.