Modular Counting of Rational Points over Finite Fields
|
|
- Matilda Silvia Carpenter
- 6 years ago
- Views:
Transcription
1 Modular Counting of Rational Points over Finite Fields Daqing Wan Department of Mathematics University of California Irvine, CA Abstract Let F q be the finite field of q elements, where q = p h. Let f(x) be a polynomial over F q in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 with coordinates in F q. In this paper, we give a deterministic algorithm which computes the reduction of N(f) modulo p b in O(n(8m) (h+b)p ) bit operations. This is singly exponential in each of the parameters {h, b, p}, answering affirmatively an open problem proposed in [5]. 1 Introduction Let F q be the finite field of q elements, where q = p h and p is a prime. Let f(x 1,, x n ) be a polynomial in n variables with coefficients in F q and with sparse representation. That is, f is written as a sum of m non-zero monomials: f(x 1,, x n ) = a j x V j, a j F q, where V j = (V 1j,, V nj ) Z n 0, x V j = x V 1j 1 x V nj n. Let N(f) denote the number of F q -rational points on the affine hypersurface defined by f = 0. It is clear that 0 N(f) q n. Replacing 1
2 x q i by x i, we may assume that the degree of f in each variable is at most q 1. The input size for f is mn log(q). A fundamental problem of great importance is to compute the number N(f) efficiently and deterministically. The nature of this problem varies quite a bit depending on the range of the various parameters. As a consequence, it has been studied extensively in a number of directions, by both mathematicians and computer scientists. For f(x) = a 1 x q a n x q 1 n + b, deciding if the number N(f) is positive is the well known subset sum problem over F q, which is NP-complete if p > 2. Ehrenfeucht and Karpinski [3] showed that computing N(f) is #P -complete even when we restrict the degree to be three. Von zur Gathen et.al [9] showed that it is also #P -complete when we restrict to curves (n = 2). The harder problem of computing the zeta function of an algebraic variety over a finite field is well studied by p-adic methods, see Wan [11][12] for a survey and the references there. In particular, a polynomial time algorithm in dense input size to compute the zeta function is obtained in Lauder-Wan [7] if the characteristic p is small and if the number of variables is fixed. In the case that f defines a smooth projective hypersurface of degree not divisible by p > 2, Lauder [6] gave a p-adic polynomial time algorithm in dense input size for computing the zeta function if p is small (the number of variables can be large). Note that in the case of zeta functions, one has to use dense input size, as the output size is already as large as the size of the dense input. For a positive integer r > 1, let N r (f) denote the least non-negative residue of N(f) modulo r. It is clear that N r (f) = N(f) if r > q n. Thus, it is no easier to compute N r (f) in general for large r. The problem of computing N r (f) can be viewed as a non-archimedian approximation problem. It gives the residue class of the integer N(f) modulo r. By the Chinese remainder theorem, we can assume that r is a prime power. One can hope that it may be easier to compute N r (f) for small fixed r. Even this is hard. For fixed r which is not a power of p, computing N r (f) is shown to be NP-hard in Gopalan-Guruswami-Lipton (GGL in short) [5]. Thus, we shall assume that r is a power of p throughout this paper. If r = p b is small, a polynomial time algorithm to compute N p r(f) using dense input size is described in Wan [11] using the reduction of the Dwork trace formula. If r = p b is a power of p, GGL [5] proved that computing N p b(f) is also NP-hard if either p 2n or if h 2n or if b > nh (i.e., p b > q n ). This shows that exponential dependence on each of {p, b, h} cannot be avoided in computing N p b(f). Using modulus amplifying polynomials, they constructed an algorithm to compute N p b(f) in time O(nm 2qb ). In the case q = p (i.e., 2
3 h = 1), the running time O(nm 2pb ) is singly exponential both in terms of p and b, and thus essentially optimal except for a possible constant multiple in the exponent. The constant 2 comes from the degree of the optimal modulus amplifying polynomial. For general q = p h, the running time O(nm 2qb ) is doubly exponential in h. By reducing equations over F q to equations over F p, GGL [5] constructed a modified version of their algorithm which computes N p b(f) in time O(n(mh w ) 2hpb ), where w is the p-weight degree of f. This running time is singly exponential in h but with an extra exponential dependence on the p-weight degree of f. GGL [5] raised the open problem: Is there an algorithm to compute N p b(f) over F q which is singly exponential in p and h? In this paper, we provide an affirmative answer to this question. We have Theorem 1.1 Let f(x) be a polynomial in n variables with m monomials over F q, where q = p h. There is a deterministic algorithm which computes N p b(f) in bit operations. O(nmp b 3mh ( (h + b)(p 1) + 3)(h+b)(p 1) ) = O(n(8m) (h+b)p ) Our methods are completely different from the modulus amplifying polynomial approach used in [5]. Low degree modulo amplifying polynomials first appeared in the work of Toda [8] and further applications were made in the work of Yao [14] and Beigel-Tarui [1]. In contrast, the idea of our algorithm is to use a simple formula [10][13] for N(f) (and more general for exponential sums) in terms of Gauss sums, and then applying the Gross-Koblitz formula relating Gauss sums to the p-adic Γ-function. Candelas and his collaborators [2] have used similar techniques to calculate the zeta function in some special cases. Remarks: An alternative approach to the main result of this paper is to use Dwork s p-adic analytic construction of the additive character and the Dwork trace formula as used in our previous work [11][7]. In this paper, we only consider the hypersurface (one equation) case. The more general case of a system of polynomial equations can be easily reduced to the one equation case, see Wan [12] for various reductions. Acknowledgements. It is a pleasure to thank A.C. Yao and Xiaoming Sun for helpful discussions on the subset sum problem over finite fields. This work was partially supported by NSF. 3
4 2 A counting formula via Gauss sums Let V 1,, V m be m distinct lattice points in Z n 0. For V j = (V 1j,, V nj ), write x V j = x V 1j 1 x V nj n. We may assume that 0 V ij q 1. Let f be the polynomial in n variables over F q written in the form: f(x 1,, x n ) = a j x V j, a j F q. Let N(f) denote the number of F q -rational points on the affine hypersurface f = 0. We first review the formula in [10][13] for N(f) in terms of Gauss sums. Let Z p be the ring of integers in the field Q p of p-adic rational numbers. Let Z q be the ring of integers in the unique unramified extension of Q p with residue field F q. Let ω be the Teichmüller character of the multiplicative group F q. For a F q, the value ω(a) is just the (q 1)-th root of unity in Z q such that ω(a) modulo p reduces to a. Define the (q 2) Gauss sums over F q by G(k) = ω(a) k ζp Tr(a) (1 k q 2), a F q where ζ p is a fixed primitive p-th root of unity in an extension of Q p and Tr denotes the trace map from F q to the prime field F p. Lemma 2.1 For all a F q, the Gauss sums satisfy the following interpolation relation q 1 ζp Tr(a) G(k) = k=0 q 1 ω(a)k, where G(0) = q 1, G(q 1) = q. Proof. By the Vandermonde determinant, there are numbers C(k) (0 k q 1) such that for all a F q, one has q 1 ζp Tr(a) C(k) = k=0 q 1 ω(a)k. 4
5 It suffices to prove that C(k) = G(k) for all k. Taking a = 0, one finds that C(0)/(q 1) = 1. This proves that C(0) = q 1 = G(0). For 1 k q 2, one computes that Finally, G(k) = a F q 0 = ζp Tr(a) a F q ω(a) k ζ Tr(a) p = C(0) q 1 = C(k) (q 1) = C(k). q 1 C(q 1) q + (q 1). q 1 This gives C(q 1) = q = G(q 1). The lemma is proved. Now we turn to deriving a counting formula for N(f) in terms of Gauss sums. Write W j = (1, V j ) Z n+1 0. Then, x 0 f = a j x W j = a j x 0 x V 1j 1 x V nj n, where x now has n + 1 variables {x 0,, x n }. Using the formula one then calculates that 0, if (q 1) k, ω(t) k = q 1, if (q 1) k and k > 0, t F q q, if k = 0, N(f) = 1 ζp Tr(x0f(x)) q x 0,,x n F q = 1 m ζ Tr(a jx Wj ) p q x 0,,x n F q = 1 m q 1 G(k j ) q x 0,,x n F q k j =0 q 1 ω(a j) k j ω(x W j ) k j = 1 q 1 q 1 m G(k j ) ( q k 1 =0 k m=0 q 1 ω(a j) k j ) ω(x k1w1+ +kmwm ) x 0,,x n F q (q 1) s(k) q n s(k) m = ω(a m (q 1) m j ) k j G(k j ), (1) k jw j 0(mod q 1) 5
6 where s(k) denotes the number of non-zero entries in the integer vector k 1 W k m W m Z n+1 0. It is clear that 0 s(k) n + 1. Formula (1) was used in [13] to prove the mirror congruence formula for a strong mirror pair of Calabi-Yau hypersurfaces. In this paper, we use formula (1) to derive an algorithm to compute N p b(f). Note that each term in formula (1) is an algebraic integer. The number of terms in formula (1) can be as large as q m, which is too big and exponential in terms of m. Fortunately, many of these terms are actually zero modulo p b. This follows from the Stickelberger theorem described in next section. 3 Stickelberger, Gross-Koblitz formula Let π be the unique element in Z p [ζ p ] satisfying π p 1 = p, π ζ p 1(mod(ζ p 1) 2 ). Thus, ord p (π) = 1/(p 1) and π is a uniformizer in the complete discrete valuation ring Z p [ζ p ]. Theorem 3.1 (Stickelberger) For integer 0 k q 2, write k = k 0 + k 1 p + + k h 1 p h 1 in p-adic expansion, where 0 k i p 1. Let σ(k) = k k h 1 be the sum of the p-digits of k. Then, G(k) π σ(k) k 0!k 1! k h 1! (modπσ(k)+p 1 ). The Stickelberger theorem gives the first non-zero digit in the π-adic expansion of the Gauss sum. To get higher digits, we can use the Gross- Koblitz formula which gives all digits of the Gauss sum in terms of the p-adic Γ-function. Let Z p be the ring of p-adic integers. The p-adic Γ-function Γ p (z) is a continuous function from Z p to Z p which is determined by its values on Z 0 defined as follows: Γ p (0) = 1, Γ p (n) = ( 1) n n 1 j 0(mod p),1 j n 1 6 j, (n 1).
7 If 0 n 1 n 2 are two integers such that n 1 n 2 (modp a ), then we have the p-adic continuity relation: For a p-adic integer we can then define Γ p (n 1 ) Γ p (n 2 )(modp a ). z = z i p i, 0 z i p 1, i=0 Γ p (z) = lim i Γ p (z 0 + z 1 p + + z i p i ). This limit exits and is in Z p. To compute the reduction of Γ p (z) modulo p b, it suffices to compute Γ p (z 0 + z 1 p + + z b 1 p b 1 ) Γ p (z)(modp b ), which takes at most p b multiplications in Z/p b Z. For an integer k, let k q 1 denote the least non-negative residue of k modulo q 1. The rational number k q 1 /(q 1) is clearly a p-adic integer in Z p. Theorem 3.2 (Gross-Koblitz [4]) For integer 1 k q 2, we have the formula h 1 G(k) π = Γ σ(k) p ( pi k q 1 q 1 ) Z p. i=0 Note that the quotient G(k) π σ(k) Z p also holds for k = 0 and k = q 1, given by G(0) π 0 = q 1, G(q 1) π h(p 1) = q ( p) h = ( 1)h 1. 4 Modular counting algorithm We now show that formula (1) can be used to compute N p b(f), the reduction of N(f) modulo p b, in the time as stated in Theorem 1.1. In fact, the 7
8 Stickelberger theorem shows that in formula (1), it suffices to restrict to those terms satisfying Write σ(k 1 ) + + σ(k m ) (h + b)(p 1) 1, 0 k j q 1. k j = h 1 i=0 k ij p i, 0 k ij p 1. Let S b be the set of non-negative integer vector solutions k = (k 1,, k m ) of the system k j W j 0(mod q 1), h 1 k ij (h + b)(p 1) 1. i=0 Reducing formula (1), we obtain the following congruence modulo p b : N p b(f) (q 1)s(k) qn s(k) ( p) σ(k1)+ +σ(km) k S b (q 1) m p 1 m ω(a j ) k j G(k j) π σ(k j). (2) Note that the quotient σ(k 1)+ +σ(k m) p 1 This follows from the first equation is always a non-negative integer. k k m 0(mod(q 1)) in the linear system j k j W j 0(mod(q 1)). By our definition of S b, it is clear that the cardinality of S b is bounded by the number A of non-negative integer solutions of the inequality One calculates that ( ) mh + (h + b)(p 1) 1 A = (h + b)(p 1) 1 By the Stirling formula, we deduce that h 1 k ij (h + b)(p 1) 1. (3) i=0 (mh + (h + b)(p 1))(h+b)(p 1) 1. ((h + b)(p 1) 1)! ( ) (h+b)(p 1) emh A (h + b)(p 1) + e, 8
9 where e is the base in the natural logarithm. To compute the Teichmüller lifting ω(a j ) modulo p b, one first lifts a j to b j modulo p b, then computes ω(a j ) b pb 1 j (modp b ). This takes O(b log(p)) multiplications in Z/p b Z. For each term in (1), the product of the Gauss sums can be computed via the p-adic Γ-function in mp b operations in Z/p b Z. Thus, the total time to compute N p b(f) is bounded by O(nmp b emh ( (h + b)(p 1) + e)(h+b)(p 1) ) = O(n(8m) (h+b)p ). The theorem is proved. We summarize our algorithm below. Algorithm 4.1 Input: f(x) = m a j X V j over F q. 1. Compute the Teichmüller liftings ω(a j ) modulo p b for all 1 j m. 2. List the solutions k = (k 1,..., k m ) of the inequality h 1 k ij (h + b)(p 1) 1, 0 k ij p 1, i=0 where k j = h 1 i=0 k ij p i. This can be done in time A. 3. For each solution k = (k 1,, k m ) in Step 2 which satisfies k j W j 0(mod(q 1)), h(n s(k)) + 1 p 1 σ(k j ) b 1, use the Gross-Koblitz formula to compute the corresponding term in formula (2) modulo p b. 4. Add the results and output the sum modulo p b, which is the reduction of N(f) modulo p b. References [1] R. Beigel and J. Tarui, On ACC, Computational Complexity, 4(1994),
10 [2] P. Candelas, X. de la Ossa and F. R. Villegas, Calabi-Yau manifolds over finite fields, I. [3] A. Ehrenfeucht and M. Karpinski, The computational complexity of counting problems, Tech. Rep CS, ICSI, Berkeley, [4] B. Gross and N. Koblitz, Gauss sums and the p-adic Γ-function, Ann. Math., 109(1979), [5] P. Gopalan, V. Guruswami and R.J. Lipton, Algorithms for modular counting of roots of multivariate polynomials, in LATIN 2006, [6] A. Lauder, Counting solutions in equations in mnay variables over finite fields, Found. Comp. Math., Vol. 4., No. 3, (2004), [7] A. Lauder and D. Wan, Counting points on varieties over finite fields of small characteristic, to appear in Algorithmic Number Theory, J.B. Buhler and P. Stevenhagen (eds), Cambridge University Press, [8] S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM Journal on Computing, 20(5) (1991), [9] J. von zur Gathen, M. Karpinski and I. Shparlinski, Counting curves and their projections, Computational Complexity, 6(1996), [10] D. Wan, Newton polygons and congruence decompositions of L- functions over finite fields, Contemporary Mathematics, 133(1992), [11] D. Wan, Computing zeta functions over finite fields, Contemporary Mathematics, 225(1999), [12] D. Wan, Algorithmic theory of zeta functions over finite fields, to appear in Algorithmic Number Theory, J.B. Buhler and P. Stevenhagen (eds), Cambridge University Press, [13] D. Wan, Mirror symmetry for zeta functions, in Mirror Symmetry IV, [14] A.C. Yao, On ACC and threshold circuits, in 31 st IEEE Symposium on Foundations of Computer Sciences (FOCS 90), 1990,
Arithmetic Mirror Symmetry
Arithmetic Mirror Symmetry Daqing Wan April 15, 2005 Institute of Mathematics, Chinese Academy of Sciences, Beijing, P.R. China Department of Mathematics, University of California, Irvine, CA 92697-3875
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationA talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun
A tal given at University of Wisconsin at Madison April 6, 2006. RECENT PROGRESS ON CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093,
More informationRATIONALITY OF ZETA FUNCTIONS OVER FINITE FIELDS
RATIONALITY OF ZETA FUNCTIONS OVER FINITE FIELDS SUN WOO PARK Abstract. The zeta function of an affine variety over a finite field contains comprehensive information on the number of points of the variety
More informationDivisibility Properties of Kloosterman Sums and Division Polynomials for Edwards Curves
Divisibility Properties of Kloosterman Sums and Division Polynomials for Edwards Curves by Richard Moloney A dissertation presented to University College Dublin in partial fulfillment of the requirements
More informationKUMMER S LEMMA KEITH CONRAD
KUMMER S LEMMA KEITH CONRAD Let p be an odd prime and ζ ζ p be a primitive pth root of unity In the ring Z[ζ], the pth power of every element is congruent to a rational integer mod p, since (c 0 + c 1
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationCombinatorial Congruences and ψ-operators
Combinatorial Congruences and ψ-operators Daqing Wan dwan@mathuciedu Department of Mathematics University of California, Irvine CA 92697-3875 September 27, 2005 Abstract The ψ-operator for (ϕ, Γ-modules
More informationHypersurfaces and the Weil conjectures
Hypersurfaces and the Weil conjectures Anthony J Scholl University of Cambridge 13 January 2010 1 / 21 Number theory What do number theorists most like to do? (try to) solve Diophantine equations x n +
More information1 Adeles over Q. 1.1 Absolute values
1 Adeles over Q 1.1 Absolute values Definition 1.1.1 (Absolute value) An absolute value on a field F is a nonnegative real valued function on F which satisfies the conditions: (i) x = 0 if and only if
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationarxiv:math/ v1 [math.nt] 14 Jun 2000
Partial Zeta Functions of Algebraic Varieties over Finite Fields arxiv:math/0006236v1 [math.nt] 14 Jun 2000 Daqing Wan Department of Mathematics University of California Irvine, CA 92697-3875 dwan@math.uci.edu
More informationAn introduction to the algorithmic of p-adic numbers
An introduction to the algorithmic of p-adic numbers David Lubicz 1 1 Universté de Rennes 1, Campus de Beaulieu, 35042 Rennes Cedex, France Outline Introduction 1 Introduction 2 3 4 5 6 7 8 When do we
More informationBoston College, Department of Mathematics, Chestnut Hill, MA , May 25, 2004
NON-VANISHING OF ALTERNANTS by Avner Ash Boston College, Department of Mathematics, Chestnut Hill, MA 02467-3806, ashav@bcedu May 25, 2004 Abstract Let p be prime, K a field of characteristic 0 Let (x
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationFactoring Polynomials with Rational Coecients. Kenneth Giuliani
Factoring Polynomials with Rational Coecients Kenneth Giuliani 17 April 1998 1 Introduction Factorization is a problem well-studied in mathematics. Of particular focus is factorization within unique factorization
More informationOn Probabilistic ACC Circuits. with an Exact-Threshold Output Gate. Richard Beigel. Department of Computer Science, Yale University
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate Richard Beigel Department of Computer Science, Yale University New Haven, CT 06520-2158, USA. beigel-richard@cs.yale.edu Jun Tarui y Department
More informationComputing Error Distance of Reed-Solomon Codes
Computing Error Distance of Reed-Solomon Codes Guizhen Zhu Institute For Advanced Study Tsinghua University, Beijing, 100084, PR China Email:zhugz08@mailstsinghuaeducn Daqing Wan Department of Mathematics
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationp-adic families of modular forms
April 3, 2009 Plan Background and Motivation Lecture 1 Background and Motivation Overconvergent p-adic modular forms The canonical subgroup and the U p operator Families of p-adic modular forms - Strategies
More informationArtin Conjecture for p-adic Galois Representations of Function Fields
Artin Conjecture for p-adic Galois Representations of Function Fields Ruochuan Liu Beijing International Center for Mathematical Research Peking University, Beijing, 100871 liuruochuan@math.pku.edu.cn
More informationDeterministic distinct-degree factorisation of polynomials over finite fields*
Article Submitted to Journal of Symbolic Computation Deterministic distinct-degree factorisation of polynomials over finite fields* Shuhong Gao 1, Erich Kaltofen 2 and Alan G.B. Lauder 3 1 Department of
More informationT-ADIC EXPONENTIAL SUMS OVER FINITE FIELDS
T-AIC EXPONENTIAL SUMS OVER FINITE FIELS CHUNLEI LIU AN AQING WAN Abstract. T -adic exponential sums associated to a Laurent polynomial f are introduced. They interpolate all classical p m -power order
More informationComputing zeta functions of certain varieties in larger characteristic
Computing zeta functions of certain varieties in larger characteristic New York University 16th March 2010 Effective methods in p-adic cohomology Mathematical Institute, University of Oxford Notation q
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationSuper congruences involving binomial coefficients and new series for famous constants
Tal at the 5th Pacific Rim Conf. on Math. (Stanford Univ., 2010 Super congruences involving binomial coefficients and new series for famous constants Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationAlgebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
More informationCHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA
CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA BJORN POONEN Abstract. We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential
More informationAN APPLICATION OF THE p-adic ANALYTIC CLASS NUMBER FORMULA
AN APPLICATION OF THE p-adic ANALYTIC CLASS NUMBER FORMULA CLAUS FIEKER AND YINAN ZHANG Abstract. We propose an algorithm to compute the p-part of the class number for a number field K, provided K is totally
More informationp-adic L-functions for Dirichlet characters
p-adic L-functions for Dirichlet characters Rebecca Bellovin 1 Notation and conventions Before we begin, we fix a bit of notation. We mae the following convention: for a fixed prime p, we set q = p if
More informationA BRIEF INTRODUCTION TO LOCAL FIELDS
A BRIEF INTRODUCTION TO LOCAL FIELDS TOM WESTON The purpose of these notes is to give a survey of the basic Galois theory of local fields and number fields. We cover much of the same material as [2, Chapters
More informationA Classical Introduction to Modern Number Theory
Kenneth Ireland Michael Rosen A Classical Introduction to Modern Number Theory Second Edition Springer Contents Preface to the Second Edition Preface v vii CHAPTER 1 Unique Factorization 1 1 Unique Factorization
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationA SIMPLE PROOF OF KRONECKER-WEBER THEOREM. 1. Introduction. The main theorem that we are going to prove in this paper is the following: Q ab = Q(ζ n )
A SIMPLE PROOF OF KRONECKER-WEBER THEOREM NIZAMEDDIN H. ORDULU 1. Introduction The main theorem that we are going to prove in this paper is the following: Theorem 1.1. Kronecker-Weber Theorem Let K/Q be
More informationGauss periods as low complexity normal bases
With M. Christopoulou, T. Garefalakis (Crete) and D. Panario (Carleton) July 16, 2009 Outline 1 Gauss periods as normal bases Normal bases Gauss periods 2 Traces of normal bases The trace of Gauss periods
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationFast Absolute Irreducibility Testing via Newton Polytopes
Fast Absolute Irreducibility Testing via Newton Polytopes Shuhong Gao and Alan G.B. Lauder Abstract We present a polytope method to test irreducibility of random sparse polynomials over an arbitrary field,
More informationChapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d
10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to
More informationThe Mathematica Journal p-adic Arithmetic
The Mathematica Journal p-adic Arithmetic Stany De Smedt The p-adic numbers were introduced by K. Hensel in 1908 in his book Theorie der algebraïschen Zahlen, Leipzig, 1908. In this article we present
More informationarxiv: v1 [math.nt] 1 Sep 2015
THE DISCRETE LAMBERT MAP arxiv:1509.0041v1 [math.nt] 1 Sep 015 ANNE WALDO AND CAIYUN ZHU July 9, 014 Abstract. The goal of this paper is to analyze the discrete Lambert map x xg x (mod p e ) which is important
More informationSOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.
SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A. 1. Introduction Today we are going to have a look at one of the simplest functions in
More informationLecture 8: The Field B dr
Lecture 8: The Field B dr October 29, 2018 Throughout this lecture, we fix a perfectoid field C of characteristic p, with valuation ring O C. Fix an element π C with 0 < π C < 1, and let B denote the completion
More informationa = mq + r where 0 r m 1.
8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.
More informationContents Lecture 1 2 Norms 2 Completeness 4 p-adic expansions 5 Exercises to lecture 1 6 Lecture 2 7 Completions 7 p-adic integers 7 Extensions of Q
p-adic ANALYSIS, p-adic ARITHMETIC Contents Lecture 1 2 Norms 2 Completeness 4 p-adic expansions 5 Exercises to lecture 1 6 Lecture 2 7 Completions 7 p-adic integers 7 Extensions of Q p 10 Exercises to
More informationarxiv: v2 [math.nt] 9 Feb 2015
ON A THEOREM OF AX AND KATZ HUI JUNE ZHU arxiv:1408.3224v2 [math.nt] 9 Feb 2015 Abstract. The well-known theorem of Ax and Katz gives a p-divisibility bound for the number of rational points on an algebraic
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationA TARGETED MARTINET SEARCH
A TARGETED MARTINET SEARCH ERIC D. DRIVER AND JOHN W. JONES Abstract. Constructing number fields with prescribed ramification is an important problem in computational number theory. In this paper, we consider
More informationZeta Functions of Toric Calabi-Yau Hypersurfaces
Zeta Functions of Toric Calabi-Yau Hypersurfaces Daqing Wan March 5, 2004 Contents 1 Toric Geometry 2 1.1 n-torus.............................. 2 1.2 Basic problem........................... 2 1.3 Projective
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationQUOTIENTS OF FIBONACCI NUMBERS
QUOTIENTS OF FIBONACCI NUMBERS STEPHAN RAMON GARCIA AND FLORIAN LUCA Abstract. There have been many articles in the Monthly on quotient sets over the years. We take a first step here into the p-adic setting,
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationMathematics of Cryptography
UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms
More informationA POSITIVE PROPORTION OF THUE EQUATIONS FAIL THE INTEGRAL HASSE PRINCIPLE
A POSITIVE PROPORTION OF THUE EQUATIONS FAIL THE INTEGRAL HASSE PRINCIPLE SHABNAM AKHTARI AND MANJUL BHARGAVA Abstract. For any nonzero h Z, we prove that a positive proportion of integral binary cubic
More informationHigher Hasse Witt matrices. Masha Vlasenko. June 1, 2016 UAM Poznań
Higher Hasse Witt matrices Masha Vlasenko June 1, 2016 UAM Poznań Motivation: zeta functions and periods X/F q smooth projective variety, q = p a zeta function of X: ( Z(X/F q ; T ) = exp m=1 #X(F q m)
More informationOld and new algorithms for computing Bernoulli numbers
Old and new algorithms for computing Bernoulli numbers University of New South Wales 25th September 2012, University of Ballarat Bernoulli numbers Rational numbers B 0, B 1,... defined by: x e x 1 = n
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationDetecting Rational Points on Hypersurfaces over Finite Fields
Detecting Rational Points on Hypersurfaces over Finite Fields Swastik Kopparty CSAIL, MIT swastik@mit.edu Sergey Yekhanin IAS yekhanin@ias.edu Abstract We study the complexity of deciding whether a given
More informationZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p
ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p BJORN POONEN 1. Statement of results Let K be a field of characteristic p > 0 equipped with a valuation v : K G taking values in an ordered
More informationTompa [7], von zur Gathen and Nocker [25], and Mnuk [16]. Recently, von zur Gathen and Shparlinski gave a lower bound of (log n) for the parallel time
A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation Jonathan P. Sorenson Department of Mathematics and Computer Science Butler University http://www.butler.edu/sorenson sorenson@butler.edu
More informationp-adic families of modular forms II
April 5, 2009 Leftovers from last time Lemma Proof. We have G k = (1 pk 1 V p )G k p d np d k 1 = p k 1 d n d k 1 So equality holds in all coefficients except possibly the constant. But then G k (1 pk
More informationE.J. Barbeau. Polynomials. With 36 Illustrations. Springer
E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication
More informationMath 210B: Algebra, Homework 6
Math 210B: Algebra, Homework 6 Ian Coley February 19, 2014 Problem 1. Let K/F be a field extension, α, β K. Show that if [F α) : F ] and [F β) : F ] are relatively prime, then [F α, β) : F ] = [F α) :
More informationJosé Felipe Voloch. Abstract: We discuss the problem of constructing elements of multiplicative high
On the order of points on curves over finite fields José Felipe Voloch Abstract: We discuss the problem of constructing elements of multiplicative high order in finite fields of large degree over their
More informationModern Computer Algebra
Modern Computer Algebra JOACHIM VON ZUR GATHEN and JURGEN GERHARD Universitat Paderborn CAMBRIDGE UNIVERSITY PRESS Contents Introduction 1 1 Cyclohexane, cryptography, codes, and computer algebra 9 1.1
More informationA mod p 3 analogue of a theorem of Gauss on binomial coefficients
A mod p 3 analogue of a theorem of Gauss on binomial coefficients Dalhousie University, Halifax, Canada ELAZ, Schloß Schney, August 16, 01 Joint work with John B. Cosgrave Dublin, Ireland We begin with
More informationGeneralization of Hensel lemma: nding of roots of p-adic Lipschitz functions
Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions (joint talk with Andrei Khrennikov) Dr. Ekaterina Yurova Axelsson Linnaeus University, Sweden September 8, 2015 Outline Denitions
More informationCYCLOTOMIC FIELDS CARL ERICKSON
CYCLOTOMIC FIELDS CARL ERICKSON Cyclotomic fields are an interesting laboratory for algebraic number theory because they are connected to fundamental problems - Fermat s Last Theorem for example - and
More informationFACTORIZATION OF POLYNOMIALS OVER FINITE FIELDS
FACTORIZATION OF POLYNOMIALS OVER FINITE FIELDS RICHARD G. SWAN Dickson [1, Ch. V, Th. 38] has given an interesting necessary condition for a polynomial over a finite field of odd characteristic to be
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationarxiv: v1 [math.nt] 8 Jan 2014
A NOTE ON p-adic VALUATIONS OF THE SCHENKER SUMS PIOTR MISKA arxiv:1401.1717v1 [math.nt] 8 Jan 2014 Abstract. A prime number p is called a Schenker prime if there exists such n N + that p nandp a n, wherea
More informationpart 2: detecting smoothness part 3: the number-field sieve
Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness Integer factorization, part 3: the number-field sieve D. J. Bernstein Problem: Factor 611. The Q sieve forms
More informationZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n
ZEROES OF INTEGER LINEAR RECURRENCES DANIEL LITT Consider the integer linear recurrence 1. Introduction x n = x n 1 + 2x n 2 + 3x n 3 with x 0 = x 1 = x 2 = 1. For which n is x n = 0? Answer: x n is never
More informationOn rational numbers associated with arithmetic functions evaluated at factorials
On rational numbers associated with arithmetic functions evaluated at factorials Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive
More informationEXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form
EXPLICIT EVALUATIONS OF SOME WEIL SUMS ROBERT S. COULTER 1. Introduction In this article we will explicitly evaluate exponential sums of the form χax p α +1 ) where χ is a non-trivial additive character
More informationALGORITHMS FOR ALGEBRAIC CURVES
ALGORITHMS FOR ALGEBRAIC CURVES SUMMARY OF LECTURE 7 I consider the problem of computing in Pic 0 (X) where X is a curve (absolutely integral, projective, smooth) over a field K. Typically K is a finite
More informationPeriods and generating functions in Algebraic Geometry
Periods and generating functions in Algebraic Geometry Hossein Movasati IMPA, Instituto de Matemática Pura e Aplicada, Brazil www.impa.br/ hossein/ Abstract In 1991 Candelas-de la Ossa-Green-Parkes predicted
More informationElliptic Curves Spring 2013 Lecture #8 03/05/2013
18.783 Elliptic Curves Spring 2013 Lecture #8 03/05/2013 8.1 Point counting We now consider the problem of determining the number of points on an elliptic curve E over a finite field F q. The most naïve
More informationABC Conjecture Implies Infinitely Many non-x-fibonacci-wieferich Primes A Linear Case of Dynamical Systems
ABC Conjecture Implies Infinitely Many non-x-fibonacci-wieferich Primes A Linear Case of Dynamical Systems Jun-Wen Wayne Peng Department of Mathematics, University of Rochester 3/21/2016 1/40 Motivation
More informationWORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE
WORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE JEFFREY B. FARR AND ROMAN PEARCE Abstract. We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationp-adic fields Chapter 7
Chapter 7 p-adic fields In this chapter, we study completions of number fields, and their ramification (in particular in the Galois case). We then look at extensions of the p-adic numbers Q p and classify
More informationOn the NP-Hardness of Bounded Distance Decoding of Reed-Solomon Codes
On the NP-Hardness of Bounded Distance Decoding of Reed-Solomon Codes Venkata Gandikota Purdue University vgandiko@purdue.edu Badih Ghazi MIT badih@mit.edu Elena Grigorescu Purdue University elena-g@purdue.edu
More informationNEWTON SLOPES FOR ARTIN-SCHREIER-WITT TOWERS
NEWTON SLOPES FOR ARTIN-SCHREIER-WITT TOWERS CHRISTOPHER DAVIS, DAQING WAN, AND LIANG XIAO Abstract. We fix a monic polynomial f(x) F q [x] over a finite field and consider the Artin-Schreier-Witt tower
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationGalois groups with restricted ramification
Galois groups with restricted ramification Romyar Sharifi Harvard University 1 Unique factorization: Let K be a number field, a finite extension of the rational numbers Q. The ring of integers O K of K
More informationSome Results on the Arithmetic Correlation of Sequences
Some Results on the Arithmetic Correlation of Sequences Mark Goresky Andrew Klapper Abstract In this paper we study various properties of arithmetic correlations of sequences. Arithmetic correlations are
More informationDeterministically Testing Sparse Polynomial Identities of Unbounded Degree
Deterministically Testing Sparse Polynomial Identities of Unbounded Degree Markus Bläser a Moritz Hardt b,,1 Richard J. Lipton c Nisheeth K. Vishnoi d a Saarland University, Saarbrücken, Germany. b Princeton
More informationCounting points on varieties over finite fields of small characteristic
Algorithmic Number Theory MSRI Publications Volume 44, 2008 Counting points on varieties over finite fields of small characteristic ALAN G. B. LAUDER AND DAQING WAN ABSTRACT. We present a deterministic
More informationVARGA S THEOREM IN NUMBER FIELDS
VARGA S THEOREM IN NUMBER FIELDS PETE L. CLARK AND LORI D. WATSON Abstract. We give a number field version of a recent result of Varga on solutions of polynomial equations with binary input variables and
More informationComputer Algebra: General Principles
Computer Algebra: General Principles For article on related subject see SYMBOL MANIPULATION. Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationp-regular functions and congruences for Bernoulli and Euler numbers
p-regular functions and congruences for Bernoulli and Euler numbers Zhi-Hong Sun( Huaiyin Normal University Huaian, Jiangsu 223001, PR China http://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers,
More information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This
More informationAre ζ-functions able to solve Diophantine equations?
Are ζ-functions able to solve Diophantine equations? An introduction to (non-commutative) Iwasawa theory Mathematical Institute University of Heidelberg CMS Winter 2007 Meeting Leibniz (1673) L-functions
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More information