Rationality of Four-Valued Families of Weil Sums of Binomials

• URL: http://arxiv.org/abs/2306.14414v2
• Date: Sun, 7 Apr 2024 00:42:11 GMT
• Title: Rationality of Four-Valued Families of Weil Sums of Binomials
• Authors: Daniel J. Katz, Allison E. Wong,
• Abstract summary: Weil sums of binomials of the form $WK,s_u=sum_x in K psi(xs - u x)$ are investigated. We show that if the Weil spectrum contains precisely four distinct values, then they must all be rational integers.
• Score: 6.752538702870792
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the rationality of Weil sums of binomials of the form $W^{K,s}_u=\sum_{x \in K} \psi(x^s - u x)$, where $K$ is a finite field whose canonical additive character is $\psi$, and where $u$ is an element of $K^{\times}$ and $s$ is a positive integer relatively prime to $|K^\times|$, so that $x \mapsto x^s$ is a permutation of $K$. The Weil spectrum for $K$ and $s$, which is the family of values $W^{K,s}_u$ as $u$ runs through $K^\times$, is of interest in arithmetic geometry and in several information-theoretic applications. The Weil spectrum always contains at least three distinct values if $s$ is nondegenerate (i.e., if $s$ is not a power of $p$ modulo $|K^\times|$, where $p$ is the characteristic of $K$). It is already known that if the Weil spectrum contains precisely three distinct values, then they must all be rational integers. We show that if the Weil spectrum contains precisely four distinct values, then they must all be rational integers, with the sole exception of the case where $|K|=5$ and $s \equiv 3 \pmod{4}$.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions [54.54897832889028]
  We show that for any $K$, there is a universal set" $U subset [n]$ of size independent of $n$, such that for any $Q$ and any row $i$, the large attention scores $A_i,j$ in row $i$ of $A$ all have $jin U$. We empirically show the benefits of our scheme for vision transformers, showing how to train new models that use our universal set while training as well.
  arXiv  Detail & Related papers  (2024-10-07T19:47:13Z)
• A note on the differential spectrum of the Ness-Helleseth function [9.776869981132844]
  We study differential equations arising from the Ness-Helleseth function $f_u$ more carefully. We express the differential spectrum of $f_u$ for such $u$ in terms of two quadratic character sums.
  arXiv  Detail & Related papers  (2024-09-05T02:28:17Z)
• Further Investigation on Differential Properties of the Generalized Ness-Helleseth Function [13.67029767623542]
  The function defined by $f_u(x)=uxd_1+xd_2$ is called the generalized Ness-Helleseth function over $mathbbF_pn$. For each $u$ satisfying $chi(u+1) = chi(u-1)$, the differential spectrum of $f_u(x)$ is investigated.
  arXiv  Detail & Related papers  (2024-08-30T13:18:23Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Completely Bounded Norms of $k$-positive Maps [41.78224056793453]
  Given an operator system $mathcalS$, we define the parameters $r_k(mathcalS)$ (resp. $d_k(mathcalS)$) We show that the sequence $(r_k( mathcalS))$ tends to $1$ if and only if $mathcalS$ is exact and that the sequence $(d_k(mathcalS))$ tends to $1$ if and only if $mathcalS$ has the lifting
  arXiv  Detail & Related papers  (2024-01-22T20:37:14Z)
• Realization of an arbitrary structure of perfect distinguishability of states in general probability theory [0.0]
  All subsets with a single element are of course in $mathcal A$, and since smaller collections are easier to distinguish, if $Hin mathcal A$ and $L subset H$ then $Lin mathcal A$; in other words, $mathcal A$ is a so-called $textitindependence system$ on the set of indices $[n]$.
  arXiv  Detail & Related papers  (2023-01-16T18:33:39Z)
• Exceptional points for associated Legendre functions of the second kind [0.0]
  We consider the complex $nu$ plane structure of the associated Legendre function $Q-1/2-K_nu(coshrho)$. We find that for any noninteger value for $K$ $Q-1/2-K_nu(coshrho)$ has an infinite number of poles in the complex $nu$ plane.
  arXiv  Detail & Related papers  (2023-01-08T17:05:43Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.