Accepted Elasticity in Local Arithmetic Congruence Monoids



Similar documents
MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Applications of Fermat s Little Theorem and Congruences

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Math 319 Problem Set #3 Solution 21 February 2002

SUM OF TWO SQUARES JAHNAVI BHASKAR

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)


FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

Overview of Number Theory Basics. Divisibility

FACTORING AFTER DEDEKIND

Introduction to Finite Fields (cont.)

Homework until Test #2

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)


Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov

All trees contain a large induced subgraph having all degrees 1 (mod k)

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

Non-unique factorization of polynomials over residue class rings of the integers

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

HYPERELLIPTIC CURVE METHOD FOR FACTORING INTEGERS. 1. Thoery and Algorithm

CS 173, Spring 2015 Examlet 2, Part A

Number Theory and Cryptography using PARI/GP

4.5 Finite Mathematical Systems

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

3 1. Note that all cubes solve it; therefore, there are no more

mod 10 = mod 10 = 49 mod 10 = 9.

MATH 289 PROBLEM SET 4: NUMBER THEORY

2 Primality and Compositeness Tests

A Course on Number Theory. Peter J. Cameron

Lecture 13: Factoring Integers

The cyclotomic polynomials

11 Ideals Revisiting Z

Primality - Factorization

Computer and Network Security

Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system

On the largest prime factor of x 2 1

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

Carmichael numbers and pseudoprimes

V Quantitative Reasoning: Computers, Number Theory and Cryptography

ON UNIQUE FACTORIZATION DOMAINS

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION

Center for Teacher Certification Austin Community College

CONTRIBUTIONS TO ZERO SUM PROBLEMS

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES

A Study on the Necessary Conditions for Odd Perfect Numbers

How To Know If A Message Is From A Person Or A Machine

Elementary Number Theory

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

Mathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information

An Approach to Shorten Digital Signature Length

Two Binary Algorithms for Calculating the Jacobi Symbol and a Fast Systolic Implementation in Hardware


FACTORING. n = fall in the arithmetic sequence

Chapter 13: Basic ring theory

8 Divisibility and prime numbers

Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

On Generalized Fermat Numbers 3 2n +1

Factoring & Primality

Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Just the Factors, Ma am

k, then n = p2α 1 1 pα k

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

Faster deterministic integer factorisation

Number Theory and the RSA Public Key Cryptosystem

Today s Topics. Primes & Greatest Common Divisors

How To Understand The Relation Between Quadratic And Binary Forms

FACTORING SPARSE POLYNOMIALS

8 Primes and Modular Arithmetic

Quotient Rings and Field Extensions

Stupid Divisibility Tricks

Die ganzen zahlen hat Gott gemacht

Klaus Hansen, Troels Larsen and Kim Olsen Department of Computer Science University of Copenhagen Copenhagen, Denmark

RSA and Primality Testing

Finding Carmichael numbers

Computing exponents modulo a number: Repeated squaring

San Jose Math Circle April 25 - May 2, 2009 ANGLE BISECTORS

On the number-theoretic functions ν(n) and Ω(n)

How To Factor In Prime Numbers

ODD PERFECT NUMBERS HAVE AT LEAST NINE DISTINCT PRIME FACTORS

Our Primitive Roots. Chris Lyons

THE CONGRUENT NUMBER PROBLEM

Doug Ravenel. October 15, 2008

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

Maths delivers! A guide for teachers Years 11 and 12. RSA Encryption

STUDY ON ELLIPTIC AND HYPERELLIPTIC CURVE METHODS FOR INTEGER FACTORIZATION. Takayuki Yato. A Senior Thesis. Submitted to

Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic. Theoretical Underpinnings of Modern Cryptography

7. Some irreducible polynomials

Short Programs for functions on Curves

Recent Breakthrough in Primality Testing

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

Transcription:

Accepted Elasticity in Local Arithmetic Congruence Monoids Vadim Ponomarenko Department of Mathematics and Statistics San Diego State University Joint Math Meetings January 15, 2014 http://www-rohan.sdsu.edu/~vadim/ accepted-talk.pdf

Shameless advertising Please encourage your students to apply to the San Diego State University Mathematics REU. http://www.sci.sdsu.edu/math-reu/index.html This work was done in Summer 2012, jointly with undergraduates Lorin Crawford, Jason Steinberg, and Marla Williams.

Arithmetic Congruence Monoids Fix a, b N with a 2 a (mod b). Set S = {x N : x a (mod b)} {1}. S is a multiplicative submonoid of N called an ACM. Famous example: a = 1, b = 4, Hilbert monoid Several recent papers have studied ACM arithmetic. This work considers one property, in the one class not yet understood, called local. gcd(a, b) = p α i.e. a = p α ξ, b = p α n, with gcd(ξ, n) = gcd(p, n) = 1.

Arithmetic Congruence Monoids Fix a, b N with a 2 a (mod b). Set S = {x N : x a (mod b)} {1}. S is a multiplicative submonoid of N called an ACM. Famous example: a = 1, b = 4, Hilbert monoid Several recent papers have studied ACM arithmetic. This work considers one property, in the one class not yet understood, called local. gcd(a, b) = p α i.e. a = p α ξ, b = p α n, with gcd(ξ, n) = gcd(p, n) = 1.

Accepted Elasticity For ACM S, and x S \ {1}, we may write x = x 1 x k, where x k are irreducible. We call k the length of this factorization into irreducibles. We call the elasticity of x the ratio of the maximum possible length to the minimum possible length. We say S has accepted elasticity if there is some x S whose elasticity is maximal, over all elements of S. Does a given ACM have accepted elasticity?

Accepted Elasticity For ACM S, and x S \ {1}, we may write x = x 1 x k, where x k are irreducible. We call k the length of this factorization into irreducibles. We call the elasticity of x the ratio of the maximum possible length to the minimum possible length. We say S has accepted elasticity if there is some x S whose elasticity is maximal, over all elements of S. Does a given ACM have accepted elasticity?

Accepted Elasticity For ACM S, and x S \ {1}, we may write x = x 1 x k, where x k are irreducible. We call k the length of this factorization into irreducibles. We call the elasticity of x the ratio of the maximum possible length to the minimum possible length. We say S has accepted elasticity if there is some x S whose elasticity is maximal, over all elements of S. Does a given ACM have accepted elasticity?

General Approach Recall S = {x N : x p α ξ (mod p α n)} {1}. It is very useful to consider the group of units (Z/nZ). What are p, p α congruent to? How big is α? What is α congruent to, modulo φ(n)? Note: p α ξ 1 (mod n), so ξ is vestigial.

Main Theorem Recall S = {x N : x p α ξ (mod p α n)} {1}. This has accepted elasticity for all p and for all sufficiently large α if: 1. n {1, 2, 8, 12}, or 2. One of {qrs, 4qr, 8q} divides n, or 3. n {q s r t, 2q s r t } with gcd(q 1, r 1) > 2. (q, r, s odd primes) Otherwise, many p have accepted elasticity for all suff. large α, and many p do not, for many α.

Main Theorem Recall S = {x N : x p α ξ (mod p α n)} {1}. This has accepted elasticity for all p and for all sufficiently large α if: 1. n {1, 2, 8, 12}, or 2. One of {qrs, 4qr, 8q} divides n, or 3. n {q s r t, 2q s r t } with gcd(q 1, r 1) > 2. (q, r, s odd primes) Otherwise, many p have accepted elasticity for all suff. large α, and many p do not, for many α.

For Further Reading P. Baginski, S. Chapman Arithmetic Congruence Monoids: A Survey (under review) L. Crawford, VP, J. Steinberg, M. Wlliams Accepted Elasticity in Local ACMs (under review) M. Jenssen, D. Montealegre, VP Irreducible Factorization Lengths and the Elasticity Problem Within N, American Math Monthly 120 (4) 2013, pp. 322-328. A. Fujiwara, J. Gibson, M. Jenssen, D. Montealegre, VP, Ari Tenzer Arithmetic of Congruence Monoids (under review) C. Allen, VP, W. Radil, R. Rankin, H. Williams Full Elasticity in Local ACMs (in preparation)