Equality of Dedekind sums: experimental data and theory

Similar documents
A Generating-Function Approach for Reciprocity Formulae of Dedekind-like Sums

Computing the continuous discretely: The magic quest for a volume

Enumerating integer points in polytopes: applications to number theory. Matthias Beck San Francisco State University math.sfsu.

Dedekind sums: a combinatorial-geometric viewpoint

Dedekind Sums with Equal Values

Ehrhart polynomial for lattice squares, cubes, and hypercubes

Letter to J. Mozzochi on Linking Numbers of Modular Geodesics

Implications of hyperbolic geometry to operator K-theory of arithmetic groups

CSE 311: Foundations of Computing. Lecture 12: Two s Complement, Primes, GCD

CONGRUENCES FOR BROKEN k-diamond PARTITIONS

Spherical varieties and arc spaces

CSE 311 Lecture 13: Primes and GCD. Emina Torlak and Kevin Zatloukal

Finite Fields. Mike Reiter

Generalized Dedekind sums.

Lattices for Communication Engineers

Arithmetic Properties for a Certain Family of Knot Diagrams

PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND (2k + 1) CORES

LATTICE PLATONIC SOLIDS AND THEIR EHRHART POLYNOMIAL

The partial-fractions method for counting solutions to integral linear systems

HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.

Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.

Polynomial analogues of Ramanujan congruences for Han s hooklength formula

Probabilistic Group Theory

Ch 4.2 Divisibility Properties

The Geometrization Theorem

Some distance functions in knot theory

MATH 361: NUMBER THEORY FOURTH LECTURE

ON THE POSITIVITY OF THE NUMBER OF t CORE PARTITIONS. Ken Ono. 1. Introduction

cse 311: foundations of computing Fall 2015 Lecture 12: Primes, GCD, applications

THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany

Modular Arithmetic and Elementary Algebra

MATH FINAL EXAM REVIEW HINTS

REPRESENTATIONS OF INTEGERS AS SUMS OF SQUARES. Ken Ono. Dedicated to the memory of Robert Rankin.

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

Equivalent trace sets for arithmetic Fuchsian groups

TITLES & ABSTRACTS OF TALKS

Probabilistic Aspects of the Integer-Polynomial Analogy

AN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION

Lecture 4: Examples of automorphic forms on the unitary group U(3)

CSE 20 DISCRETE MATH. Winter

Elementary Number Theory Review. Franz Luef

Mathematical Foundations of Cryptography

A Note on the Transcendence of Zeros of a Certain Family of Weakly Holomorphic Forms

On the topology of H(2)

Projects on elliptic curves and modular forms

With Question/Answer Animations. Chapter 4

198 VOLUME 46/47, NUMBER 3

3 The fundamentals: Algorithms, the integers, and matrices

Integer knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College

Part II. Number Theory. Year

The commutator subgroup and the index formula of the Hecke group H 5

ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.

Mathematics for Cryptography

FOURIER COEFFICIENTS OF A CLASS OF ETA QUOTIENTS

Hilbert s problems, Gödel, and the limits of computation

Lecture Notes. Advanced Discrete Structures COT S

Rings and modular arithmetic

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

Abstract Algebra Study Sheet

DIAMETER OF RAMANUJAN GRAPHS AND RANDOM CAYLEY GRAPHS

INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3

Foundations of Cryptography

Math 581 Problem Set 9

Number theory. Myrto Arapinis School of Informatics University of Edinburgh. October 9, /29

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Elementary Number Theory. Franz Luef

Kevin James. MTHSC 412 Section 3.4 Cyclic Groups

CONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

On non-hamiltonian circulant digraphs of outdegree three

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

A Guide to Arithmetic

STABLY FREE MODULES KEITH CONRAD

Name: Solutions Final Exam

Conic Theta Functions and their relations to classical theta functions

Lattice polygons. P : lattice polygon in R 2 (vertices Z 2, no self-intersections)

8 Primes and Modular Arithmetic

Simple groups and the classification of finite groups

2. THE EUCLIDEAN ALGORITHM More ring essentials

cse 311: foundations of computing Spring 2015 Lecture 12: Primes, GCD, applications

arxiv: v1 [math.gr] 8 Dec 2014

Constructive algebra. Thierry Coquand. May 2018

For your quiz in recitation this week, refer to these exercise generators:

Mod p Galois representations attached to modular forms

Total 100

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Factorization in Integral Domains II

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

ELEMENTARY LINEAR ALGEBRA

AN ARITHMETIC FORMULA FOR THE PARTITION FUNCTION

arxiv:math/ v2 [math.gt] 27 Feb 2004

Mahler s Polynomials and the Roots of Unity

CPSC 467: Cryptography and Computer Security

A Geometric Approach to Carlitz-Dedekind Sums

CHAPTER 14. Ideals and Factor Rings

Algebra for error control codes

FOURIER COEFFICIENTS OF VECTOR-VALUED MODULAR FORMS OF DIMENSION 2

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.

CLASSIFICATION OF TORSION-FREE GENUS ZERO CONGRUENCE GROUPS

Transcription:

Equality of Dedekind sums: experimental data and theory Challenges in 21st Century Experimental Mathematical Computation Sinai Robins Nanyang Technological University ICERM Brown University

What are Dedekind sums?

What are Dedekind sums? 1. They are natural extensions of the gcd function. 2. They give the characters of SL 2 (Z) (via the Rademacher function). 3. They are the building blocks for integer point enumeration in polytopes. 4. They are the variance of congruential pseudo-random number generators. 5. They are necessary in the transformation law of Dedekind s eta function. 6. They give the linking number between some knots 7. They provide correction terms for the Heegaard-Floer homology

Definition. We define the first periodic Bernoulli polynomial by ( 1 x [x] B(x) := 2 if x/2 Z 0 if x 2 Z.

Definition. We define the first periodic Bernoulli polynomial by ( 1 x [x] B(x) := 2 if x/2 Z 0 if x 2 Z. Given any two relatively prime integers a and b, wedefine the Dedekind sum by

Definition. We define the first periodic Bernoulli polynomial by ( 1 x [x] B(x) := 2 if x/2 Z 0 if x 2 Z. Given any two relatively prime integers a and b, wedefine the Dedekind sum by s(a, b) := P b k=1 B( k b )B( ka b ).

Definition. We define the first periodic Bernoulli polynomial by ( 1 x [x] B(x) := 2 if x/2 Z 0 if x 2 Z. Given any two relatively prime integers a and b, wedefine the Dedekind sum by s(a, b) := P b k=1 B( k b )B( ka b ). Another expression for the Dedekind sum, as an infinite series, is somewhat better:

4 2 b s(a, b) = P 0 (m,n)2z 2 1 m(am+bn), where the dash in the summation denotes omission of the two discrete lines m = 0 and am + bn = 0. This representation gives an easy proof of the important RECIPROCITY LAW FOR DEDEKIND SUMS:

4 2 b s(a, b) = P 0 (m,n)2z 2 1 m(am+bn), where the dash in the summation denotes omission of the two discrete lines m = 0 and am + bn = 0. This representation gives an easy proof of the important RECIPROCITY LAW FOR DEDEKIND SUMS: Reciprocity Law for Dedekind Sums. (R. Dedekind, 1892) For any two relatively prime integers a and b, wehave

4 2 b s(a, b) = P 0 (m,n)2z 2 1 m(am+bn), where the dash in the summation denotes omission of the two discrete lines m = 0 and am + bn = 0. This representation gives an easy proof of the important RECIPROCITY LAW FOR DEDEKIND SUMS: Reciprocity Law for Dedekind Sums. (R. Dedekind, 1892) For any two relatively prime integers a and b, wehave s(a, b)+s(b, a) = 1 12 a b + b a + 1 ab 1 4.

Periodicity of the Dedekind Sum: s(a, b) =s(a + mb, b), for all integers m.

Periodicity of the Dedekind Sum: s(a, b) =s(a + mb, b), for all integers m. With these two properties, we can mimic the Euclidean algorithm for the gcd(a, b), and we can therefore very e ciently compute s(a, b) in roughly log( a ) + log( b ) time!

Periodicity of the Dedekind Sum: s(a, b) =s(a + mb, b), for all integers m. With these two properties, we can mimic the Euclidean algorithm for the gcd(a, b), and we can therefore very e ciently compute s(a, b) in roughly log( a ) + log( b ) time! Thus, we see that this classical Dedekind sum behaves precisely like the gcd function, as far as computational complexity.

Plot of (a, s(a, 101)), for a =0,...,101.

smoother? Plot of (a, s(a, 60)), for a =0,...,60.

Integer point enumeration in polytopes More generally, we have the Eisenstein-Dedekind sums, defined by: s(v 1, v 2,...,v d ):= det V (2 i) d P 0 m2z d e 2 ihm,ui d k=1 hv k,mi,

Integer point enumeration in polytopes More generally, we have the Eisenstein-Dedekind sums, defined by: s(v 1, v 2,...,v d ):= det V (2 i) d P 0 m2z d e 2 ihm,ui d k=1 hv k,mi, where V is the d by d matrix with v j s as its columns, and u 2 (0, 1] d.

Integer point enumeration in polytopes More generally, we have the Eisenstein-Dedekind sums, defined by: s(v 1, v 2,...,v d ):= det V (2 i) d P 0 m2z d e 2 ihm,ui d k=1 hv k,mi, where V is the d by d matrix with v j s as its columns, and u 2 (0, 1] d. These Eisenstein-Dedekind sums arise naturally from polyhedral cones whose edge vectors are v 1,...,v d.

Integer point enumeration in polytopes More generally, we have the Eisenstein-Dedekind sums, defined by: s(v 1, v 2,...,v d ):= det V (2 i) d P 0 m2z d e 2 ihm,ui d k=1 hv k,mi, where V is the d by d matrix with v j s as its columns, and u 2 (0, 1] d. These Eisenstein-Dedekind sums arise naturally from polyhedral cones whose edge vectors are v 1,...,v d. One might wonder if these general Dedekind-type sums also have reciprocity laws, and indeed they do, as given by Gunnells and Sczech.

Integer point enumeration in polytopes More generally, we have the Eisenstein-Dedekind sums, defined by: s(v 1, v 2,...,v d ):= det V (2 i) d P 0 m2z d e 2 ihm,ui d k=1 hv k,mi, where V is the d by d matrix with v j s as its columns, and u 2 (0, 1] d. These Eisenstein-Dedekind sums arise naturally from polyhedral cones whose edge vectors are v 1,...,v d. One might wonder if these general Dedekind-type sums also have reciprocity laws, and indeed they do, as given by Gunnells and Sczech. Paul Gunnells and Robert Sczech, Evaluation of Dedekind sums, Eisenstein cocycles, and special values of L-functions, Duke Math. J. 118 (2003), no. 2, 229 260.

Integer point enumeration in polytopes Given a polytope P whose vertices belong to the integer lattice Z d, it is very natural to ask for its discrete volume tp \ Z d.

Integer point enumeration in polytopes Given a polytope P whose vertices belong to the integer lattice Z d, it is very natural to ask for its discrete volume tp \ Z d. Theorem. (Ehrhart, 1957) tp \ Z d is a polynomial in t 2 Z >0, given by tp \ Z d = vol(p)t d + c d 1 t d 1 + + c 1 t + 1.

Integer point enumeration in polytopes Given a polytope P whose vertices belong to the integer lattice Z d, it is very natural to ask for its discrete volume tp \ Z d. Theorem. (Ehrhart, 1957) tp \ Z d is a polynomial in t 2 Z >0, given by tp \ Z d = vol(p)t d + c d 1 t d 1 + + c 1 t + 1. The coe cients c j have as their building blocks the Dedekind sums and their higher-dimensional analogues. Pommersheim, James E. Toric varieties, lattice points and Dedekind sums. Math. Ann. 295 (1993), no. 1, 1 24. Diaz, Ricardo; Robins, Sinai The Ehrhart polynomial of a lattice polytope. Ann. of Math. (2) 145 (1997),no. 3, 503 518.

Characters of SL 2 (Z) and the Rademacher function apple a b Fix any matrix M := c d 2 SL 2(Z). Then the Rademacher function is defined by:

Characters of SL 2 (Z) and the Rademacher function apple a b Fix any matrix M := c d 2 SL 2(Z). Then the Rademacher function is defined by: R(M) := ( a+d c 12(sign c)s(d, c ) for c 6= 0, b d for c =0.

Characters of SL 2 (Z) and the Rademacher function apple a b Fix any matrix M := c d 2 SL 2(Z). Then the Rademacher function is defined by: R(M) := ( a+d c 12(sign c)s(d, c ) for c 6= 0, b d for c =0. It is a fact that R maps SL 2 (Z) into the integers, and that furthermore given any three unimodular matrices M 1,M 2,M 3 2 SL 2 (Z) which enjoy the relation M 3 := M 1 M 2,wehave R(M 3 )=R(M 1 )+R(M 2 ) 3 sign(c 1 c 2 c 3 ).

Characters of SL 2 (Z) and the Rademacher function The Rademacher function is useful in the structural study of SL 2 (Z) and its subgroups.

Characters of SL 2 (Z) and the Rademacher function The Rademacher function is useful in the structural study of SL 2 (Z) and its subgroups. Indeed, for each fixed c 2 Z, the following map is a character of SL 2 (Z): M := apple a c b d! e 2 ir(m) 24,

Characters of SL 2 (Z) and the Rademacher function The Rademacher function is useful in the structural study of SL 2 (Z) and its subgroups. Indeed, for each fixed c 2 Z, the following map is a character of SL 2 (Z): M := apple a c b d! e 2 ir(m) 24, and it is known that all the characters of SL 2 (Z) may be obtained in this manner, forming the group Z/12Z. (The commutator subgroup of SL 2 (Z) has index 12 in SL 2 (Z))

Modular forms: the Dedekind Eta function For each in the complex upper half plane, the Dedekind -function is defined by: ( ) :=q 1 24 1Y (1 q n ), n=1 where q := e 2 i. Richard Dedekind (1892) appleproved the general transformation law a b under any element M := c d 2 SL 2(Z):

Modular forms: the Dedekind Eta function Theorem (R. Dedekind) a + b c + d := e 2 ir(m) 24 r c + d ( ), i for all in the complex upper half plane. We also see the appearance of a character in this transformation law. Surprisingly many modular forms may be built up by taking products and quotients of this function.

The Linking Number of knots Each hyperbolic matrix M 2 PSL 2 (Z) defines a closed curve k M in the complement of the trefoil knot. Theorem. (Étienne Ghys) The linking number between k M and the trefoil knot is equal to the Rademacher function R(M).

The Linking Number of knots Ref: http://perso.ens-lyon.fr/ghys/articles/icm.pdf

Open Problem. When are two Dedekind sums equal? We are interested in the question of finding all integers 1 apple a 1,a 2 apple b 1 for which s(a 1,b)=s(a 2,b).

Open Problem. When are two Dedekind sums equal? We are interested in the question of finding all integers 1 apple a 1,a 2 apple b 1 for which s(a 1,b)=s(a 2,b). Theorem. (Jabuka, Robins, Wang, 2011) Let b be a positive integer, and a 1,a 2 any two integers that are relatively prime to b. Ifs(a 1,b)=s(a 2,b), then b (1 a 1 a 2 )(a 1 a 2 ).

Open Problem. When are two Dedekind sums equal? We are interested in the question of finding all integers 1 apple a 1,a 2 apple b 1 for which s(a 1,b)=s(a 2,b). Theorem. (Jabuka, Robins, Wang, 2011) Let b be a positive integer, and a 1,a 2 any two integers that are relatively prime to b. Ifs(a 1,b)=s(a 2,b), then b (1 a 1 a 2 )(a 1 a 2 ). The converse is, in general, false.

Open Problem. When are two Dedekind sums equal? We are interested in the question of finding all integers 1 apple a 1,a 2 apple b 1 for which s(a 1,b)=s(a 2,b). Theorem. (Jabuka, Robins, Wang, 2011) Let b be a positive integer, and a 1,a 2 any two integers that are relatively prime to b. Ifs(a 1,b)=s(a 2,b), then b (1 a 1 a 2 )(a 1 a 2 ). The converse is, in general, false. Jabuka, Stanislav; Robins, Sinai; Wang, Xinli When are two Dedekind sums equal? Int. J. Number Theory 7 (2011), no. 8, 2197 2202. Jabuka, Stanislav; Robins, Sinai; Wang, Xinli Heegaard Floer correction terms and Dedekind-Rademacher sums. Int. Math. Res. Not. IMRN 2013, no. 1, 170 183. 57R58 Girstmair, Kurt A criterion for the equality of Dedekind sums mod Z, Int. J. Number Theory 10 (2014),no. 3, 565 568.

When are two Dedekind sums equal? As a corollary, when b = p is a prime, we have that s(a 1,p)=s(a 2,p) if and only if a 1 a 2 mod p or a 1 a 2 1 mod p.

When are two Dedekind sums equal? As a corollary, when b = p is a prime, we have that s(a 1,p)=s(a 2,p) if and only if a 1 a 2 mod p or a 1 a 2 1 mod p. Open problem (special case). For b = pq, wherep, q are primes, find all pairs of integers a 1,a 2 such that s(a 1,pq)=s(a 2,pq).

More motivation This question may be motivated by Heegaard-Floer homology correction terms, but it may be motivated in an elementary way as follows.

More motivation This question may be motivated by Heegaard-Floer homology correction terms, but it may be motivated in an elementary way as follows. Suppose we wish to study the number of inversions of the following permutation. For each a relatively prime to b, we define the permutation: a := 1 2 3 b 1 a 2a 3a (b 1)a

More motivation This question may be motivated by Heegaard-Floer homology correction terms, but it may be motivated in an elementary way as follows. Suppose we wish to study the number of inversions of the following permutation. For each a relatively prime to b, we define the permutation: a := 1 2 3 b 1 a 2a 3a (b 1)a For each such permutation a,weletinv( a ) be the number of inversions of the permutation a, i.e. the number of times that a larger integer precedes a smaller integer in this permutation.

Theorem. (Zolotare, 1872) For each a relatively prime to b, wehave Inv( a )= 3b s(a, b)+ 1 (b 1)(b 2). 4 Rademacher, Hans; Grosswald, Emil Dedekind sums. The Carus Mathematical Monographs, No. 16.The Mathematical Association of America, Washington, D.C., 1972. xvi+102 pp.

Another motivation is the distribution of the di erence between a unit mod b and its inverse mod b: a a 1 12b s(a, b) mod b, where a 1 is the inverse of a mod b. Empirically, we can see equality of Dedekind sums S(a i,b) for long arithmetic progressions of a i mod b, some of which is currently provable, and some of which is currently conjectural.

Thank You