a gumbo with hints of partitions modular forms special
play

A gumbo with hints of partitions, modular forms, special integer - PowerPoint PPT Presentation

A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Number Theory Seminar University of Illinois at Urbana-Champaign Armin Straub Mar 16, 2017 University of South Alabama A gumbo with hints of


  1. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Number Theory Seminar University of Illinois at Urbana-Champaign Armin Straub Mar 16, 2017 University of South Alabama A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 1 / 33

  2. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  3. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: • To each cell u in the diagram is assigned its hook. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  4. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: • To each cell u in the diagram is assigned its hook. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  5. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: 8 6 5 2 1 5 3 2 4 2 1 1 • To each cell u in the diagram is assigned its hook. • The hook length of u is the number of cells in its hook. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  6. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: 8 6 5 2 1 5 3 2 4 2 1 1 • To each cell u in the diagram is assigned its hook. • The hook length of u is the number of cells in its hook. • A partition is t -core if no cell has hook length t . For instance, the above partition is 7 -core. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  7. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: 8 6 5 2 1 5 3 2 4 2 1 1 • To each cell u in the diagram is assigned its hook. • The hook length of u is the number of cells in its hook. • A partition is t -core if no cell has hook length t . For instance, the above partition is 7 -core. • A partition is p s, t q -core if it is both s -core and t -core. A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  8. Core partitions • The integer partition p 5 , 3 , 3 , 1 q has Young diagram: 8 6 5 2 1 5 3 2 4 2 1 1 • To each cell u in the diagram is assigned its hook. • The hook length of u is the number of cells in its hook. • A partition is t -core if no cell has hook length t . For instance, the above partition is 7 -core. • A partition is p s, t q -core if it is both s -core and t -core. If a partition is t -core, then it is also rt -core for r “ 1 , 2 , 3 . . . LEM A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 2 / 33

  9. The number of core partitions • Using the theory of modular forms, Granville and Ono (1996) showed: (The case t “ p of this completed the classification of simple groups with defect zero Brauer p -blocks.) For any n ě 0 there exists a t -core partition of n whenever t ě 4 . THM A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 3 / 33

  10. The number of core partitions • Using the theory of modular forms, Granville and Ono (1996) showed: (The case t “ p of this completed the classification of simple groups with defect zero Brauer p -blocks.) For any n ě 0 there exists a t -core partition of n whenever t ě 4 . THM • If c t p n q is the number of t -core partitions of n , then 8 8 ÿ ź p 1 ´ q tn q t c t p n q q n “ . 1 ´ q n n “ 0 n “ 1 ÿ 8 ÿ 8 ÿ 8 c 2 p n q q n “ 1 c 3 p n q q n “ 1 ` q ` 2 q 2 ` 2 q 4 ` q 5 ` 2 q 6 ` q 8 ` . . . 2 n p n ` 1 q , q n “ 0 n “ 0 n “ 0 A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 3 / 33

  11. The number of core partitions • Using the theory of modular forms, Granville and Ono (1996) showed: (The case t “ p of this completed the classification of simple groups with defect zero Brauer p -blocks.) For any n ě 0 there exists a t -core partition of n whenever t ě 4 . THM • If c t p n q is the number of t -core partitions of n , then 8 8 ÿ ź p 1 ´ q tn q t c t p n q q n “ . 1 ´ q n n “ 0 n “ 1 ÿ 8 ÿ 8 ÿ 8 c 2 p n q q n “ 1 c 3 p n q q n “ 1 ` q ` 2 q 2 ` 2 q 4 ` q 5 ` 2 q 6 ` q 8 ` . . . 2 n p n ` 1 q , q n “ 0 n “ 0 n “ 0 Can we give a combinatorial proof of the Granville–Ono result? Q A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 3 / 33

  12. The number of core partitions • Using the theory of modular forms, Granville and Ono (1996) showed: (The case t “ p of this completed the classification of simple groups with defect zero Brauer p -blocks.) For any n ě 0 there exists a t -core partition of n whenever t ě 4 . THM • If c t p n q is the number of t -core partitions of n , then 8 8 ÿ ź p 1 ´ q tn q t c t p n q q n “ . 1 ´ q n n “ 0 n “ 1 ÿ 8 ÿ 8 ÿ 8 c 2 p n q q n “ 1 c 3 p n q q n “ 1 ` q ` 2 q 2 ` 2 q 4 ` q 5 ` 2 q 6 ` q 8 ` . . . 2 n p n ` 1 q , q n “ 0 n “ 0 n “ 0 Can we give a combinatorial proof of the Granville–Ono result? Q The total number of t -core partitions is infinite. COR Though this is probably the most complicated way possible to see that. . . A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 3 / 33

  13. Counting core partitions THM The number of p s, t q -core partitions is finite if and only if s and Anderson t are coprime. 2002 A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 4 / 33

  14. Counting core partitions THM The number of p s, t q -core partitions is finite if and only if s and Anderson t are coprime. In that case, this number is 2002 ˆ s ` t ˙ 1 . s ` t s A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 4 / 33

  15. Counting core partitions THM The number of p s, t q -core partitions is finite if and only if s and Anderson t are coprime. In that case, this number is 2002 ˆ s ` t ˙ 1 . s ` t s 24 p s 2 ´ 1 qp t 2 ´ 1 q . • Olsson and Stanton (2007): the largest size of such partitions is 1 A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 4 / 33

  16. Counting core partitions THM The number of p s, t q -core partitions is finite if and only if s and Anderson t are coprime. In that case, this number is 2002 ˆ s ` t ˙ 1 . s ` t s 24 p s 2 ´ 1 qp t 2 ´ 1 q . • Olsson and Stanton (2007): the largest size of such partitions is 1 • Note that the number of p s, s ` 1 q -core partitions is the Catalan number ˜ ¸ ˜ ¸ 2 s 2 s ` 1 1 1 C s “ “ . s ` 1 s 2 s ` 1 s A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 4 / 33

  17. Counting core partitions THM The number of p s, t q -core partitions is finite if and only if s and Anderson t are coprime. In that case, this number is 2002 ˆ s ` t ˙ 1 . s ` t s 24 p s 2 ´ 1 qp t 2 ´ 1 q . • Olsson and Stanton (2007): the largest size of such partitions is 1 • Note that the number of p s, s ` 1 q -core partitions is the Catalan number ˜ ¸ ˜ ¸ 2 s 2 s ` 1 1 1 C s “ “ . s ` 1 s 2 s ` 1 s • Ford, Mai and Sze (2009) show that the number of self-conjugate p s, t q -core partitions is ˜ ¸ t s { 2 u ` t t { 2 u . t s { 2 u A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 4 / 33

  18. Core partitions into distinct parts • Amdeberhan raises the interesting problem of counting the number of special partitions which are t -core for certain values of t . CONJ The number of p s, s ` 1 q -core partitions into distinct parts equals the Fibonacci number F s ` 1 . A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 5 / 33

  19. Core partitions into distinct parts • Amdeberhan raises the interesting problem of counting the number of special partitions which are t -core for certain values of t . CONJ The number of p s, s ` 1 q -core partitions into distinct parts equals the Fibonacci number F s ` 1 . • He further conjectured that the largest possible size of an p s, s ` 1 q -core partition into distinct parts is t s p s ` 1 q{ 6 u , and that there is a unique such largest partition unless s ” 1 modulo 3 , in which case there are two partitions of maximum size. • Amdeberhan also conjectured that the total size of these partitions is ÿ F i F j F k . i ` j ` k “ s ` 1 A gumbo with hints of partitions, modular forms, special integer sequences and supercongruences Armin Straub 5 / 33

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend