An algorithm for the explicit evaluation of GL( n ;R) Kloosterman sums

DOI10.1145/1610296.1610297MaRDI QIDQ5176458zbMATH OpenOpenAlexFDO

Authors Kevin A. Broughan

Publication date 26 February 2015

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1610296.1610297

zbMATH Keywords

Kloosterman sumPlücker coordinatesPlücker relationssymbolic-numeric algorithm

Mathematics Subject Classification ID

Trigonometric and exponential sums (general theory) (11L03) Gauss and Kloosterman sums; generalizations (11L05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3985332
• A Kuznetsov formula for Kloosterman sums on \(\text{GL}_n\)
• On a generalization of Kloosterman sums
• Evaluation of kloosterman and salié sums for arbitrary number fields
• On general Kloosterman sums
• On the general Kloosterman sums
• Sums of Kloosterman sums revisited
• On some Kloosterman sums
• scientific article; zbMATH DE number 1833327
• Poincaré series on \(\mathrm{GL}(r)\) and Kloosterman sums

Cited in

(2)

• GL(n)pack
• Bounds for Kloosterman sums on \(\mathrm{GL}(n)\)

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: An algorithm for the explicit evaluation of GL( n ;R) Kloosterman sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176458)