Character sums over affine spaces and applications
Let \(q=p^n\) be a prime power and \(\mathbb{F}_q\) be the finite field with \(q\) elements. When proving existence and distribution results with the help of characters, it is frequently required to provide non-trivial estimates to sums \(s(\chi ,S):=\sum _{y\in S}\chi (y)\), \(S\subseteq \mathbb{F}_q\). Given a positive integer \(n\) and an \(\mathbb{F}_q\)-affine space \(\mathcal{A}\subseteq \mathbb{F}_{q^n}\), the author shows that a result of \textit{N. M. Katz} [J. Am. Math. Soc. 2, No. 2, 197--199 (1989; Zbl 0672.10026)] provides a new bound on the sum \(\sum _{a\in \mathcal{A}}\chi (a)\), where \(\chi\) is a multiplicative character of \(\mathbb{F}_{q^n}\). The paper focuses on the applicability of this estimate to results regarding the existence of special primitive elements in \(\mathbb{F}_{q^n}\).
- A note on character sums over finite fields.
- An Estimate for Character Sums
- Character sums and primitive roots in finite fields
- Character Sums and Primitive Roots in Finite Fields
- Character sums in finite fields
- DISTRIBUTION OF PRIMITIVE ROOTS IN A FINITE FIELD
- Equations in finite fields with restricted solution sets. I: Character sums
- Existence and properties of \(k\)-normal elements over finite fields
- Existence of primitive 1-normal elements in finite fields
- Existence of primitive 2-normal elements in finite fields
- Existence results on \(k\)-normal elements over finite fields
- Finite fields and their applications. Character sums and polynomials. Based on the invited talks of the RICAM-workshop, Strobl, Austria, September 2--7, 2012
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- New directions in cryptography
- On a problem of Gelfond: the sum of digits of prime numbers
- On a question of Davenport and Lewis and new character sum bounds in finite fields
- On integers \(n\) for which \(X^n-1\) has a divisor of every degree
- On the divisors of \(x^n-1\) in \(\mathbb F_p[x]\)
- On the sum of digits of special sequences in finite fields
- Prescribing digits in finite fields
- Primitive Normal Bases for Finite Fields
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- The sum of digits function in finite fields
- The sum of digits of squares
- Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
- Character sums in complex half-planes
- Character sums over affine spaces and applications
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
- Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields. II.
- On polynomials over finite fields that are free of binomials
- Prescribing traces of primitive elements in finite fields
This page was built for publication: Character sums over affine spaces and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168928)
