Equidistribution in multiplicative subgroups of

Size: px
Start display at page:

Download "Equidistribution in multiplicative subgroups of"

Transcription

1 Equidistribution in multiplicative subgroups of F p S. Bringer Université Jean Monnet Tuesday 9th July 2013 S.Bringer (Univ Jean Monnet) Densities and their applications 1 / 14

2 Contents 1 Denitions S.Bringer (Univ Jean Monnet) Densities and their applications 2 / 14

3 Contents 1 Denitions 2 Equidistribution of multi-sets S.Bringer (Univ Jean Monnet) Densities and their applications 2 / 14

4 Contents 1 Denitions 2 Equidistribution of multi-sets 3 Further applications S.Bringer (Univ Jean Monnet) Densities and their applications 2 / 14

5 Notations Notations 1 An interval I of F p is dened by I = { ax +b mod p 0 x I 1 } for some a F p and b F p. 2 A multi-set of F p is a nite sequence of elements of F p. Focus on multi-sets of the form I.H = (xh x I,h H), where I and H are two subsets of F p. 3 The cardinality of a multi-set A is written A. S.Bringer (Univ Jean Monnet) Densities and their applications 3 / 14

6 Denitions ε-equidistribution Denition 2.1. Let ε > 0. Let p be a prime number. Let A be a multi-set of F p. A is ε-equidistributed modulo p if, for all interval I included in F p : A I A I p < ε. S.Bringer (Univ Jean Monnet) Densities and their applications 4 / 14

7 Denitions Counterexample Let p = 2 n 1 be a Mersenne prime and A = { 2 k, with k = 0,...,n 1 }. If I = { x + 2 n 1,x = 1,...,2 n 1 1 }, then A I =. Hence A is not ε-equidistributed modulo p for ε < 1 2. S.Bringer (Univ Jean Monnet) Densities and their applications 5 / 14

8 Denitions Another denition Denition 2.2. Let e p (x) = e 2iπx p. Let ε > 0. Let p be a prime number. Let A be a multi-set of F p. A is Sε 1 -equidistributed modulo p if : max x F p a A e p (ax) ε A. S.Bringer (Univ Jean Monnet) Densities and their applications 6 / 14

9 Denitions a Weyl-like criterion Proposition 2.1. Let A be a multi-set of F p. Let ε > 0, there exists f (ε) > 0 such that if A is S 1 -equidistributed modulo p, then A is ε-equidistributed f (ε) modulo p. Let η > 0, there exists g(η) > 0 such that if A is η-equidistributed modulo p then A is S 1 g(η) -equidistributed modulo p. S.Bringer (Univ Jean Monnet) Densities and their applications 7 / 14

10 Denitions Result by Bourgain-Glibichuk-Konyagin (2006) Theorem 2.1. Let p be a prime number, there exist positive constants C 1 and C 2 such that for any δ > 0, any subgroup G of F p with G pδ and γ = exp( C1 δ C 2 ), Corollary 2.1. max x F p ep(gx) G p γ. g G Let ε > 0, p be a prime number, there exist positive constants C 1 and C 2 such that, for any subgroup G of F p with 1 C ln G > C 2 lnp, 1 ( ) G is ε-equidistributed. 1 lnlnp lnln 1 C2 ε S.Bringer (Univ Jean Monnet) Densities and their applications 8 / 14

11 Equidistribution of multi-sets Result by Bourgain (2009) Let I.H = (xh x I,h H) be a multi-set. Theorem 3.1. For all ε > 0 and γ > 0, there exist p 0 (ε,γ) and (ε,γ) such that for any prime p p 0 : any multiplicative subgroup H of F p with H > (lnp), any interval I of F p with I > p γ, I.H is ε-equidistributed. S.Bringer (Univ Jean Monnet) Densities and their applications 9 / 14

12 Equidistribution of multi-sets Sketch of the proof Let I = { αx + β mod p 0 x I 1 } be an interval of F p. Goal : To bound max e a F p p (ahx). h H x I S.Bringer (Univ Jean Monnet) Densities and their applications 10 / 14

13 Equidistribution of multi-sets Sketch of the proof Let I = { αx + β mod p 0 x I 1 } be an interval of F p. Goal : To bound max e a F p p (ahx). h H x I ( e p (ahx) min I, aαh ) 1 p x I S.Bringer (Univ Jean Monnet) Densities and their applications 10 / 14

14 Equidistribution of multi-sets Sketch of the proof Let I = { αx + β mod p 0 x I 1 } be an interval of F p. Goal : To bound max e a F p p (ahx). h H x I ( e p (ahx) min I, aαh ) 1 p x I Result by Bourgain(2009) : { Let Ω aα,ξ = h H : aαh p < p 1 ξ}. If Ωaα,ξ > ρ H then H < (lnp). S.Bringer (Univ Jean Monnet) Densities and their applications 10 / 14

15 Further applications Result by Hegyvári and Hennecart (2010) Theorem 4.1. For all ε > 0 and γ > 0, for all positive integer d,there exist p 0 (ε,γ,d) and (ε,γ,d) such that for any prime p p 0, any subset H of F p with H.H < 2 H and H > (lnp), any interval I of F p with I > p γ, for all f F p [X ], with degree d, the multi-set f (I ).H is ε-equidistributed. S.Bringer (Univ Jean Monnet) Densities and their applications 11 / 14

16 Further applications H is an approximate multiplicative subgroup Theorem 4.2. For all ε > 0,γ > 0 and K > 0, for all positive integer d, there exist p 0 (ε,γ,k,d) and (ε,γ,k,d) such that for any prime p p 0, any subset H of F p with H.H < K H and H > (lnp), any interval I of F p with I > p γ, for all f F p [X ], with degree d, the multi-set f (I ).H is ε-equidistributed. S.Bringer (Univ Jean Monnet) Densities and their applications 12 / 14

17 Further applications I is almost an additive subgroup Theorem 4.3. For all ε > 0,γ > 0, K > 0, for all positive integers n and d, there exist p 0 (ε,γ,n,k,d) and (ε,γ,n,k,d) such that for any prime p p 0, any subset H of F p with H.H < K H and H > (lnp), any proper generalized arithmetic progression I = {r 0 +r 1 u r d u d : 0 u i U i 1} of F p, with r i F p and U i a positive integer for all i {1,...,d}, and I > p γ, for all f F p [X ], with degree n, the multi-set f (I ).H is ε-equidistributed. S.Bringer (Univ Jean Monnet) Densities and their applications 13 / 14

18 Further applications Prospect Conjecture. For all ε > 0,γ > 0, K > 0,K > 0, for all positive integer d, there exist p 0 (ε,γ,k,k,d) and (ε,γ,k,k,d) such that for any prime p p 0, any subset H of F p with H.H < K H and H > (lnp), any subset I of F p with I +I < K I, and I > p γ, for all f F p [X ], with degree d, the multi-set f (I ).H is ε-equidistributed. S.Bringer (Univ Jean Monnet) Densities and their applications 14 / 14

Part V. Chapter 19. Congruence of integers

Part V. Chapter 19. Congruence of integers Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277

More information

FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)

FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) Ana Zumalacárregui a.zumalacarregui@unsw.edu.au November 30, 2015 Contents 1 Operations on sets 1 2 Sum-product theorem

More information

Degrees of Regularity of Colorings of the Integers

Degrees of Regularity of Colorings of the Integers Degrees of Regularity of Colorings of the Integers Alan Zhou MIT PRIMES May 19, 2012 Alan Zhou (MIT PRIMES) Degree of Regularity May 19, 2012 1 / 15 Background Original problem: For a given homogeneous

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element. The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

More information

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno 3.1. The denition. 3. G Groups, as men, will be known by their actions. - Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h

More information

Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime

Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)

More information

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let γ(k, p) denote Waring s number (mod p) and δ(k, p) denote the ± Waring s number (mod p). We use

More information

Kevin James. MTHSC 412 Section 3.4 Cyclic Groups

Kevin James. MTHSC 412 Section 3.4 Cyclic Groups MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is

More information

Roots of Polynomials in Subgroups of F p and Applications to Congruences

Roots of Polynomials in Subgroups of F p and Applications to Congruences Roots of Polynomials in Subgroups of F p and Applications to Congruences Enrico Bombieri, Jean Bourgain, Sergei Konyagin IAS, Princeton, IAS Princeton, Moscow State University The decimation problem Let

More information

Wilson s Theorem and Fermat s Little Theorem

Wilson s Theorem and Fermat s Little Theorem Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =

More information

Roth s Theorem on Arithmetic Progressions

Roth s Theorem on Arithmetic Progressions September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper

More information

EXPONENTIAL SUMS EQUIDISTRIBUTION

EXPONENTIAL SUMS EQUIDISTRIBUTION EXPONENTIAL SUMS EQUIDISTRIBUTION PSEUDORANDOMNESS (1) Exponential sums over subgroups General philosophy: multiplicative subgroups are well-distributed even if they are very small Conjecture. (M-V-W)

More information

On Pronormal Subgroups of Finite Groups

On Pronormal Subgroups of Finite Groups On Pronormal Subgroups of Finite Groups Natalia V. Maslova Krasovskii Institute of Mathematics and Mechanics UB RAS and Ural Federal University This talk is based on joint papers with Wenbin Guo, Anatoly

More information

The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.

The number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!. The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class

More information

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

More information

arxiv:math/ v1 [math.nt] 20 Mar 2007

arxiv:math/ v1 [math.nt] 20 Mar 2007 arxiv:math/0703614v1 [math.nt] 20 Mar 2007 and A SLIGHT IMPROVEMENT TO GARAEV S SUM PRODUCT ESTIMATE Nets Hawk Katz and Chun-Yen Shen Indiana University 0 Introduction Let A be a subset of F p, the field

More information

Sums of Consecutive Perfect Powers is Seldom a Perfect Power

Sums of Consecutive Perfect Powers is Seldom a Perfect Power Sums of Consecutive Perfect Powers is Seldom a Perfect Power Journées Algophantiennes Bordelaises 2017, Université de Bordeaux June 7, 2017 A Diophantine Equation Question x k + (x + 1) k + + (x + d 1)

More information

On the elliptic curve analogue of the sum-product problem

On the elliptic curve analogue of the sum-product problem Finite Fields and Their Applications 14 (2008) 721 726 http://www.elsevier.com/locate/ffa On the elliptic curve analogue of the sum-product problem Igor Shparlinski Department of Computing, Macuarie University,

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

(i) Write down the elements of a subgroup of order 2. [1]

(i) Write down the elements of a subgroup of order 2. [1] FP3 Groups 1. June 010 qu. A multiplicative group with identity e contains distinct elements a and r, with the properties r 6 = e and = r 5 a. Prove that r = a. [] Prove, by induction or otherwise, that

More information

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99 ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements

More information

Homework 6 Solutions to Selected Problems

Homework 6 Solutions to Selected Problems Homework 6 Solutions to Selected Problems March 16, 2012 1 Chapter 7, Problem 6 (not graded) Note that H = {bn : b Z}. That is, H is the subgroup of multiples of n. To nd cosets, we look for an integer

More information

Sum-Product Problem: New Generalisations and Applications

Sum-Product Problem: New Generalisations and Applications Sum-Product Problem: New Generalisations and Applications Igor E. Shparlinski Macquarie University ENS, Chaire France Telecom pour la sécurité des réseaux de télécommunications igor@comp.mq.edu.au 1 Background

More information

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

More information

Les chiffres des nombres premiers. (Digits of prime numbers)

Les chiffres des nombres premiers. (Digits of prime numbers) Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet

More information

Section II.1. Free Abelian Groups

Section II.1. Free Abelian Groups II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof

More information

4. Congruence Classes

4. Congruence Classes 4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {

More information

Balanced subgroups of the multiplicative group

Balanced subgroups of the multiplicative group Balanced subgroups of the multiplicative group Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with D. Ulmer To motivate the topic, let s begin with elliptic curves. If

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric

More information

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM OVER FINITE FIELDS

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM OVER FINITE FIELDS #A68 INTEGERS 11 (011) SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM OVER FINITE FIELDS Todd Cochrane 1 Department of Mathematics, Kansas State University, Manhattan, Kansas cochrane@math.ksu.edu James

More information

Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing.

Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing. Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing. Trevor D. Wooley University of Bristol Oxford, 29th September 2014 Oxford, 29th September 2014 1 / 1. Introduction

More information

ITERATED COMPOSITIONS OF LINEAR OPERATIONS ON SETS OF POSITIVE UPPER DENSITY

ITERATED COMPOSITIONS OF LINEAR OPERATIONS ON SETS OF POSITIVE UPPER DENSITY ITERATED COMPOSITIONS OF LINEAR OPERATIONS ON SETS OF POSITIVE UPPER DENSITY NORBERT HEGYVÁRI, FRANÇOIS HENNECART, AND ALAIN PLAGNE Abstract. Starting from a result of Stewart, Tijdeman and Ruzsa on iterated

More information

Lacunary Polynomials over Finite Fields Course notes

Lacunary Polynomials over Finite Fields Course notes Lacunary Polynomials over Finite Fields Course notes Javier Herranz Abstract This is a summary of the course Lacunary Polynomials over Finite Fields, given by Simeon Ball, from the University of London,

More information

On sum-product representations in Z q

On sum-product representations in Z q J. Eur. Math. Soc. 8, 435 463 c European Mathematical Society 2006 Mei-Chu Chang On sum-product representations in Z q Received April 15, 2004 and in revised form July 14, 2005 Abstract. The purpose of

More information

17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8

17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8 Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................

More information

1 Structure of Finite Fields

1 Structure of Finite Fields T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained

More information

MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

More information

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice

More information

Corollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1

Corollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1 4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.

More information

Department of Mathematics University of California Riverside, CA

Department of Mathematics University of California Riverside, CA SOME PROBLEMS IN COMBINATORIAL NUMBER THEORY 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 92521 mcc@math.ucr.edu dedicated to Mel Nathanson on his 60th birthday Abstract

More information

ON SUM-PRODUCT REPRESENTATIONS IN Z q. Mei-Chu Chang

ON SUM-PRODUCT REPRESENTATIONS IN Z q. Mei-Chu Chang ON SUM-PRODUCT REPRESENTATIONS IN Z Mei-Chu Chang Abstract The purpose of this paper is to investigate efficient representations of the residue classes modulo, by performing sum and product set operations

More information

On the parity of k-th powers modulo p

On the parity of k-th powers modulo p On the parity of k-th powers modulo p Jennifer Paulhus Kansas State University paulhus@math.ksu.edu www.math.ksu.edu/ paulhus This is joint work with Todd Cochrane and Chris Pinner of Kansas State University

More information

Notes on the Bourgain-Katz-Tao theorem

Notes on the Bourgain-Katz-Tao theorem Notes on the Bourgain-Katz-Tao theorem February 28, 2011 1 Introduction NOTE: these notes are taken (and expanded) from two different notes of Ben Green on sum-product inequalities. The basic Bourgain-Katz-Tao

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

Chapter 1 : The language of mathematics.

Chapter 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 information

On the classication of algebras

On the classication of algebras Technische Universität Carolo-Wilhelmina Braunschweig Institut Computational Mathematics On the classication of algebras Morten Wesche September 19, 2016 Introduction Higman (1950) published the papers

More information

BURGESS INEQUALITY IN F p 2. Mei-Chu Chang

BURGESS INEQUALITY IN F p 2. Mei-Chu Chang BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,

More information

Strictly Positive Definite Functions on the Circle

Strictly Positive Definite Functions on the Circle the Circle Princeton University Missouri State REU 2012 Definition A continuous function f : [0, π] R is said to be positive definite on S 1 if, for every N N and every set of N points x 1,..., x N on

More information

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS #A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université

More information

LECTURE NOTES IN CRYPTOGRAPHY

LECTURE NOTES IN CRYPTOGRAPHY 1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

More information

FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS

FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ

More information

MTHSC 3190 Section 2.9 Sets a first look

MTHSC 3190 Section 2.9 Sets a first look MTHSC 3190 Section 2.9 Sets a first look Definition A set is a repetition free unordered collection of objects called elements. Definition A set is a repetition free unordered collection of objects called

More information

CHAPTER 14. Ideals and Factor Rings

CHAPTER 14. Ideals and Factor Rings CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements

More information

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.

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. 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 information

Left almost semigroups dened by a free algebra. 1. Introduction

Left almost semigroups dened by a free algebra. 1. Introduction Quasigroups and Related Systems 16 (2008), 69 76 Left almost semigroups dened by a free algebra Qaiser Mushtaq and Muhammad Inam Abstract We have constructed LA-semigroups through a free algebra, and the

More information

A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES. 1. Introduction

A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES. 1. Introduction A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES Y. O. HAMIDOUNE AND J. RUÉ Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained

More information

On The Weights of Binary Irreducible Cyclic Codes

On 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 information

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in

More information

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer? Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

More information

Distance sets on circles and Kneser s addition theorem

Distance sets on circles and Kneser s addition theorem Distance sets on circles and Kneser s addition theorem momihara@educkumamoto-uacjp joint work with Masashi Shinohara, Shiga University Distance sets on circles, to appear in Amer Math Monthly 27-May-2016

More information

Super-strong Approximation I

Super-strong Approximation I Super-strong Approximation I Emmanuel Breuillard Université Paris-Sud, Orsay, France IPAM, February 9th, 2015 Strong Approximation G = connected, simply connected, semisimple algebraic group defined over

More information

Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5. Modular arithmetic. 5.1 The modular ring Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

More information

Factoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors.

Factoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Factoring Algorithms Pollard s p 1 Method This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Input: n (to factor) and a limit B Output: a proper factor of

More information

Diophantine equations and semistable elliptic curves over totally real fields

Diophantine equations and semistable elliptic curves over totally real fields Diophantine equations and semistable elliptic curves over totally real fields Samuele Anni (IWR - Universität Heidelberg) joint with Samir Siksek (University of Warwick) Journées Algophantiennes Bordelaises

More information

AN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER

AN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER AN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER JAVIER CILLERUELO AND ANA ZUMALACÁRREGUI Abstract. For a given finite field F q, we study sufficient conditions

More information

A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction

A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO 1 ERNIE CROOT NEIL LYALL ALEX RICE Abstract. Using purely combinatorial means we obtain results on simultaneous Diophantine

More information

Some Open Problems Arising from my Recent Finite Field Research

Some Open Problems Arising from my Recent Finite Field Research Some Open Problems Arising from my Recent Finite Field Research Gary L. Mullen Penn State University mullen@math.psu.edu July 13, 2015 Some Open Problems Arising from myrecent Finite Field Research July

More information

On non-hamiltonian circulant digraphs of outdegree three

On non-hamiltonian circulant digraphs of outdegree three On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA

More information

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in

More information

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay 1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together

More information

arxiv: v2 [math.nt] 23 Sep 2011

arxiv: v2 [math.nt] 23 Sep 2011 ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences

More information

Dependent Fields have no Artin-Schreier Extensions

Dependent Fields have no Artin-Schreier Extensions have no Artin-Schreier Extensions La Roche-en-Ardenne Itay Kaplan Joint work with Thomas Scanlon Hebrew University of Jerusalem and Université Claude Bernard Lyon 1 21 April 2008 In [5], Macintyre showed

More information

Ergodic aspects of modern dynamics. Prime numbers in two bases

Ergodic aspects of modern dynamics. Prime numbers in two bases Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373

More information

Johns Hopkins Math Tournament 2018 Proof Round: Sequences

Johns Hopkins Math Tournament 2018 Proof Round: Sequences Johns Hopkins Math Tournament 2018 Proof Round: Sequences February 17, 2018 Section Total Points Score 1 5 2 20 3 15 4 25 Instructions The exam is worth 60 points; each part s point value is given in brackets

More information

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008

The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 The uniform uncertainty principle and compressed sensing Harmonic analysis and related topics, Seville December 5, 2008 Emmanuel Candés (Caltech), Terence Tao (UCLA) 1 Uncertainty principles A basic principle

More information

SOME EFFECTIVE RESULTS FOR a b

SOME EFFECTIVE RESULTS FOR a b SOME EFFECTIVE RESULTS FOR a b JEAN BOURGAIN, ELON LINDENSTRAUSS, PHILIPPE MICHEL AND AKSHAY VENKATESH In memory of Bill Parry 1. Introduction 1.1. Let a, b > 1 be multiplicatively independent integers

More information

Carmichael numbers and the sieve

Carmichael numbers and the sieve June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little

More information

Bull. Korean Math. Soc. 38 (2001), No. 1, pp. 149{156 A STUDY ON ADDITIVE ENDOMORPHISMS OF RINGS Yong Uk Cho Abstract. In this paper, we initiate the

Bull. Korean Math. Soc. 38 (2001), No. 1, pp. 149{156 A STUDY ON ADDITIVE ENDOMORPHISMS OF RINGS Yong Uk Cho Abstract. In this paper, we initiate the Bull. Korean Math. Soc. 38 (21), No. 1, pp. 149{156 A STUDY ON ADDITIVE ENDOMORPHISMS OF RINGS Yong Uk Cho Abstract. In this paper, we initiate the investigation of rings in which all the additive endomorphisms

More information

Modular Arithmetic Instructor: Marizza Bailey Name:

Modular Arithmetic Instructor: Marizza Bailey Name: Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find

More information

R. Kwashira 1, 2 Work with J.C. Mba 3 ( 1 Birmingham, (CoE-MaSS), South Africa, 3 University of Johannesburg, South Africa

R. Kwashira 1, 2 Work with J.C. Mba 3 ( 1 Birmingham, (CoE-MaSS), South Africa, 3 University of Johannesburg, South Africa Groups, St Andrews 2017 Non-cancellation group of a direct product R. Kwashira 1, 2 Work with J.C. Mba 3 1 University of the Witwatersrand, South Africa, 2 DST-NRF Centre of Excellence in Mathematical

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs

More information

arxiv:math/ v1 [math.nt] 17 Apr 2006

arxiv:math/ v1 [math.nt] 17 Apr 2006 THE CARMICHAEL NUMBERS UP TO 10 18 arxiv:math/0604376v1 [math.nt] 17 Apr 2006 RICHARD G.E. PINCH Abstract. We extend our previous computations to show that there are 1401644 Carmichael numbers up to 10

More information

1 i<j k (g ih j g j h i ) 0.

1 i<j k (g ih j g j h i ) 0. CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown

More information

Math 109 September 1, 2016

Math 109 September 1, 2016 Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,

More information

Equidistributions in arithmetic geometry

Equidistributions in arithmetic geometry Equidistributions in arithmetic geometry Edgar Costa Dartmouth College 14th January 2016 Dartmouth College 1 / 29 Edgar Costa Equidistributions in arithmetic geometry Motivation: Randomness Principle Rigidity/Randomness

More information

Chapter-2 Relations and Functions. Miscellaneous

Chapter-2 Relations and Functions. Miscellaneous 1 Chapter-2 Relations and Functions Miscellaneous Question 1: The relation f is defined by The relation g is defined by Show that f is a function and g is not a function. The relation f is defined as It

More information

Quasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract

Quasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract Quasigroups and Related Systems 9 (2002), 1 17 Quasigroup power sets and cyclic Ssystems Galina B. Belyavskaya Abstract We give new constructions of power sets of quasigroups (latin squares) based on pairwise

More information

Roth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013

Roth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013 Roth s theorem on 3-arithmetic progressions CIPA Research school Shillong 2013 Anne de Roton Institut Elie Cartan Université de Lorraine France 2 1. Introduction. In 1953, K. Roth [6] proved the following

More information

Karol Cwalina. A linear bound on the dimension in Green-Ruzsa s Theorem. Uniwersytet Warszawski. Praca semestralna nr 1 (semestr zimowy 2010/11)

Karol Cwalina. A linear bound on the dimension in Green-Ruzsa s Theorem. Uniwersytet Warszawski. Praca semestralna nr 1 (semestr zimowy 2010/11) Karol Cwalina Uniwersytet Warszawski A linear bound on the dimension in Green-Ruzsa s Theorem Praca semestralna nr 1 (semestr zimowy 2010/11) Opiekun pracy: Tomasz Schoen A LINEAR BOUND ON THE DIMENSION

More information

Jean Bourgain Institute for Advanced Study Princeton, NJ 08540

Jean Bourgain Institute for Advanced Study Princeton, NJ 08540 Jean Bourgain Institute for Advanced Study Princeton, NJ 08540 1 ADDITIVE COMBINATORICS SUM-PRODUCT PHENOMENA Applications to: Exponential sums Expanders and spectral gaps Invariant measures Pseudo-randomness

More information

Arithmetic progressions in sumsets

Arithmetic progressions in sumsets ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains

More information

Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction

Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI 2011, Ljubljana, Slovenia

More information

Group actions, the Mattila integral and continuous sum-product problems

Group actions, the Mattila integral and continuous sum-product problems Group actions, the Mattila integral and continuous sum-product problems Bochen Liu University of Rochester Acknowledgment: This work is done when the author was a research assistant in the Chinese University

More information

Introduction to Modern Cryptography Recitation 3. Orit Moskovich Tel Aviv University November 16, 2016

Introduction to Modern Cryptography Recitation 3. Orit Moskovich Tel Aviv University November 16, 2016 Introduction to Modern Cryptography Recitation 3 Orit Moskovich Tel Aviv University November 16, 2016 The group: Z N Let N 2 be an integer The set Z N = a 1,, N 1 gcd a, N = 1 with respect to multiplication

More information

MATH 420 FINAL EXAM J. Beachy, 5/7/97

MATH 420 FINAL EXAM J. Beachy, 5/7/97 MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric

More information

Decoupling Lecture 1

Decoupling Lecture 1 18.118 Decoupling Lecture 1 Instructor: Larry Guth Trans. : Sarah Tammen September 7, 2017 Decoupling theory is a branch of Fourier analysis that is recent in origin and that has many applications to problems

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

G. Sburlati RANDOM VARIABLES RELATED TO DISTRIBUTIONS OF SUMS MODULO AN INTEGER

G. Sburlati RANDOM VARIABLES RELATED TO DISTRIBUTIONS OF SUMS MODULO AN INTEGER Rend. Sem. Mat. Univ. Pol. Torino Vol. 60, 3 (2002) G. Sburlati RANDOM VARIABLES RELATED TO DISTRIBUTIONS OF SUMS MODULO AN INTEGER Abstract. Starting from known results concerning distributions of sums

More information