On the distribution of Jacobi sums

Abstract Let \mathbf{F}_{q} be a finite field of q elements. For multiplicative characters \chi_{1},\ldots,\chi_{m} of \mathbf{F}_{q}^{\times} , we let J(\chi_{1},\ldots,\chi_{m}) denote the Jacobi sum. Nicholas Katz and Zhiyong Zheng showed that for m=2 , the normalized Jacobi sum q^{-1/2}J(\chi_{1},\chi_{2}) ( \chi_{1}\chi_{2} nontrivial) is asymptotically equidistributed on the unit circle as q\to\infty , when \chi_{1} and \chi_{2} run through all nontrivial multiplicative characters of \mathbf{F}_{q}^{\times} . In this paper, we show a similar property for m\geq 2 . More generally, we show that the normalized Jacobi sum q^{-(m-1)/2}J(\chi_{1},\ldots,\chi_{m}) ( \chi_{1}\cdots\chi_{m} nontrivial) is asymptotically equidistributed on the unit circle, when \chi_{1},\ldots,\chi_{m} run through arbitrary sets of nontrivial multiplicative characters of \mathbf{F}_{q}^{\times} with two of the sets being sufficiently large. The case m=2 answers a question of Shparlinski.

Download Full-text

The Feuerbach Theorem and Cyclography in Universal Geometry

KoG ◽

10.31896/k.24.5 ◽

2020 ◽

pp. 47-58

Author(s):

William Beare ◽

Norman Wildberger

Keyword(s):

Finite Field ◽

Unit Circle ◽

Finite Fields ◽

Algebraic Approach ◽

Rational Points ◽

Field Case ◽

Rational Trigonometry ◽

Universal Geometry ◽

Simplified Form

We have another look at the Feuerbach theorem with a view to extending it in an oriented way to finite fields using the purely algebraic approach of rational trigonometry and universal geometry. Our approach starts with the tangent lines to three rational points on the unit circle, and all subsequent formulas involve the three parameters that define them. Tangency of incircles is treated in the oriented setting via a simplified form of cyclography. Some interesting features of the finite field case are discussed.

Download Full-text

Overview

Convolution and Equidistribution ◽

10.23943/princeton/9780691153308.003.0002 ◽

2012 ◽

Author(s):

Nicholas M. Katz

Keyword(s):

Finite Field ◽

Numerical Experiments ◽

Multiplicative Characters

This chapter provides an overview of the present analysis, which grew out of two questions, raised by Ron Evans and Zeev Rudnick respectively, in May and June of 2003. Evans and Rudnick performed numerical experiments on the sums as χ‎ varies over all multiplicative characters of k, and as χ‎ varies over all nontrivial multiplicative characters of a finite field k of odd characteristic, respectively. Both equidistribution results of Evans and Rudnick are proven.

Download Full-text

Evaluating prime power Gauss and Jacobi sums

Tamkang Journal of Mathematics ◽

10.5556/j.tkjm.48.2017.1866 ◽

2017 ◽

Vol 48 (3) ◽

pp. 227-240 ◽

Cited By ~ 1

Author(s):

Misty Ostergaard ◽

Vincent Pigno ◽

Christopher Pinner

Keyword(s):

Prime Power ◽

Gauss Sums ◽

Jacobi Sums ◽

Jacobi Sum ◽

Simple Evaluation ◽

Gauss And Jacobi Sums ◽

Mod P

We show that for any mod $p^m$ characters, $\chi_1, \dots, \chi_k,$ with at least one $\chi_i$ primitive mod $p^m$, the Jacobi sum, $$ \mathop{\sum_{x_1=1}^{p^m}\dots \sum_{x_k=1}^{p^m}}_{x_1+\dots+x_k\equiv B \text{ mod } p^m}\chi_1(x_1)\cdots \chi_k(x_k), $$ has a simple evaluation when $m$ is sufficiently large (for $m\geq 2$ if $p\nmid B$). As part of the proof we give a simple evaluation of the mod $p^m$ Gauss sums when $m\geq 2$ that differs slightly from existing evaluations when $p=2$.

Download Full-text

Jacobi sums and cyclotomic numbers for a finite field

Acta Arithmetica ◽

10.4064/aa-41-1-1-13 ◽

1982 ◽

Vol 41 (1) ◽

pp. 1-13 ◽

Cited By ~ 8

Author(s):

J. Parnami ◽

M. Agrawal ◽

A. Rajwade

Keyword(s):

Finite Field ◽

Jacobi Sums ◽

Cyclotomic Numbers

Download Full-text

Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems

Bulletin of the Australian Mathematical Society ◽

10.1017/s000497270003207x ◽

1998 ◽

Vol 58 (1) ◽

pp. 147-154 ◽

Cited By ~ 25

Author(s):

Joe Buhler ◽

Neal Koblitz

Keyword(s):

Lattice Basis Reduction ◽

Lll Algorithm ◽

Prime Field ◽

Jacobi Sums ◽

Jacobi Sum ◽

Basis Reduction

Using the LLL-algorithm for finding short vectors in lattices, we show how to compute a Jacobi sum for the prime field Fp in Q(e2πi/n) in time O(log3p), where n is small and fixed, p is large, and p = 1 (mod n). This result is useful in the construction of hyperelliptic cryptosystems.

Download Full-text

Beta dynamical systems over the formal fields

Studia Scientiarum Mathematicarum Hungarica ◽

10.1556/sscmath.51.2014.4.1291 ◽

2014 ◽

Vol 51 (4) ◽

pp. 454-465

Author(s):

Lu-Ming Shen ◽

Huiping Jing

Keyword(s):

Dynamical Systems ◽

Finite Field ◽

Haar Measure ◽

Laurent Series ◽

Formal Laurent Series ◽

Almost All

Let \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathbb{F}_q ((X^{ - 1} ))$$ \end{document} denote the formal field of all formal Laurent series x = Σ n=ν∞anX−n in an indeterminate X, with coefficients an lying in a given finite field \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathbb{F}_q$$ \end{document}. For any \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\beta \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document} with deg β > 1, it is known that for almost all \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$x \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document} (with respect to the Haar measure), x is β-normal. In this paper, we show the inverse direction, i.e., for any x, for almost all \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\beta \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document}, x is β-normal.

Download Full-text

The Restricted Arc-Width of a Graph

The Electronic Journal of Combinatorics ◽

10.37236/1734 ◽

2003 ◽

Vol 10 (1) ◽

Author(s):

David Arthur

Keyword(s):

Unit Circle ◽

Single Point ◽

Minimum Width ◽

Graph Operations ◽

Function Mapping

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.

Download Full-text

Valued Field Graph and Some Related Parameters

Advances in Mathematics: Scientific Journal ◽

10.37418/amsj.9.1.30 ◽

2020 ◽

pp. 389-395

Author(s):

G. Suresh Singh ◽

P. K. Prasobha

Keyword(s):

Finite Field ◽

Independence Number ◽

Valued Field ◽

Vertex Set ◽

Adic Valuation

Let $K$ be any finite field. For any prime $p$, the $p$-adic valuation map is given by $\psi_{p}:K/\{0\} \to \R^+\bigcup\{0\}$ is given by $\psi_{p}(r) = n$ where $r = p^n \frac{a}{b}$, where $p,a,b$ are relatively prime. The field $K$ together with a valuation is called valued field. Also, any field $K$ has the trivial valuation determined by $\psi{(K)} = \{0,1\}$. Through out the paper K represents $\Z_q$. In this paper, we construct the graph corresponding to the valuation map called the valued field graph, denoted by $VFG_{p}(\Z_{q})$ whose vertex set is $\{v_0,v_1,v_2,\ldots, v_{q-1}\}$ where two vertices $v_i$ and $v_j$ are adjacent if $\psi_{p}(i) = j$ or $\psi_{p}(j) = i$. Here, we tried to characterize the valued field graph in $\Z_q$. Also we analyse various graph theoretical parameters such as diameter, independence number etc.

Download Full-text