Results 41 to 50 of about 884,151 (313)
NMR experiment factors numbers with Gauss sums [PDF]
, 2006 We factor the number 157573 using an NMR implementation of Gauss sums.Comment: 4 pages 5 ...
H. Davenport +15 more
core +2 more sources
Gauss Sums and Binomial Coefficients
Journal of Number Theory, 2002 Let \(p= tn+r\) be a prime which splits in \(\mathbb{Q}(\sqrt{-t})\) where \(t\) has one of the following forms \[ \begin{aligned} t= k>3 &\;\text{ for a prime } k\equiv 3\pmod 4,\\ t= 4k &\;\text{ for a prime } k\equiv 1\pmod 4,\\ t= 8k &\;\text{ for an odd prime } k.
Lee, DH, Hahn, SG Hahn, Sang-Geun
openaire +2 more sources
Gauss Sum Factorization with Cold Atoms [PDF]
Physical Review Letters, 2008 4 pages, 5 ...
Gilowski, M. +6 more
openaire +3 more sources
Mutually unbiased phase states, phase uncertainties, and Gauss sums [PDF]
, 2005 Mutually unbiased bases (MUBs), which are such that the inner product between two vectors in different orthogonal bases is a constant equal to 1/sqrt{d), with d the dimension of the finite Hilbert space, are becoming more and more studied for ...
Planat, M., Rosu, H. C.
core +2 more sources
On Classical Gauss Sums and Some of Their Properties
Symmetry, 2018 The goal of this paper is to solve the computational problem of one kind rational polynomials of classical Gauss sums, applying the analytic means and the properties of the character sums. Finally, we will calculate a meaningful recursive formula for it.
Li Chen
semanticscholar +1 more source
Complete Solving for Explicit Evaluation of Gauss Sums in the Index 2 Case
, 2010 Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let $\k$ be a primitive multiplicative character of order $N$ over finite field $\fq$.
B. C. Berndt +18 more
core +1 more source
Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials [PDF]
, 2015 We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$.
Katz, Daniel J., Langevin, Philippe
core +1 more source
Finite Fields and Their Applications, 1998 Let \(m\) be an odd positive integer, \(n\) an arbitrary positive integer, and \(p\) a prime which does not divide \(m\). Let \(\mathbb{F}_{p}\) be a prime finite field, \(\mathbb{F}_{q}\) a finite extension of \(\mathbb{F}_{p}\) of degree \(f\), so \(q=p^{f}\), and \( \chi\) a multiplicative character of \(\mathbb{F}_{q}\) of order \(m\). If \( \zeta_{
openaire +1 more source
Tokyo Journal of Mathematics, 2012 Let \(p > 2\) be a prime number, \(\mathbb F_p\) the prime finite field with \(p\) elements, \(\mathbb F^*_p\) its multiplicative cyclic group of order \(p-1\) and \(i = \sqrt{-1}\). The classical Gauss sum \(g_p\) is given by \[ \tau_p= \sum_{x \in \mathbb F^*_p} \left( \frac{x}{p} \right) e^{2 { \pi}i x/p}, \] where \( \left( \frac{x}{p} \right)\) is
GOMI, Yasushi +2 more
openaire +3 more sources
The hybrid power mean of the generalized Gauss sums and the generalized two-term exponential sums
AIMS MathematicsThis article applied the properties of character sums, quadratic character, and classical Gauss sums to study the calculations of the hybrid power mean of the generalized Gauss sums and the generalized two-term exponential sums.
Xue Han, Tingting Wang
doaj +1 more source