Meetings & Conferences of The

Total Page:16

File Type:pdf, Size:1020Kb

Meetings & Conferences of The Meetings && Conferences of thethe AMSAMS IMPORTANT INFORMATION REGARDING MEETINGS PROGRAMS: AMS Sectional Meeting programs do not appear in the print version of the Notices. However, comprehensive and continually updated meeting and program information with links to the abstract for each talk can be found on the AMS website. See http://www.ams.org/meetings/. Final programs for Sectional Meetings will be archived on the AMS website accessible from the stated URL and in an electronic issue of the Notices as noted below for each meeting. Shelly Harvey, Rice University, 4-dimensional equiva- Winston-Salem, lence relations on knots. Allen Knutson, Cornell University, Modern develop- North Carolina ments in Schubert calculus. Seth M. Sullivant, North Carolina State University, Wake Forest University Algebraic statistics. September 24–25, 2011 Special Sessions Saturday – Sunday Algebraic and Geometric Aspects of Matroids, Hoda Bidkhori, Alex Fink, and Seth Sullivant, North Carolina Meeting #1073 State University. Southeastern Section Applications of Difference and Differential Equations to Associate secretary: Matthew Miller Biology, Anna Mummert, Marshall University, and Richard Announcement issue of Notices: June 2011 C. Schugart, Western Kentucky University. Program first available on AMS website: August 11, 2011 Combinatorial Algebraic Geometry, W. Frank Moore, Program issue of electronic Notices: September 2011 Wake Forest University and Cornell University, and Allen Issue of Abstracts: Volume 32, Issue 4 Knutson, Cornell University. Deadlines Extremal Combinatorics, Tao Jiang, Miami University, and Linyuan Lu, University of South Carolina. For organizers: Expired Geometric Knot Theory and its Applications, Yuanan For consideration of contributed papers in Special Ses- sions: Expired Diao, University of North Carolina at Charlotte, Jason For abstracts: Expired Parsley, Wake Forest University, and Eric Rawdon, Uni- versity of St. Thomas. The scientific information listed below may be dated. Low-Dimensional Topology and Geometry, Shelly Har- For the latest information, see www.ams.org/amsmtgs/ vey, Rice University, and John Etnyre, Georgia Institute sectional.html. of Technology. Modular Forms, Elliptic Curves, and Related Topics, Mat- Invited Addresses thew Boylan, University of South Carolina, and Jeremy Benjamin B. Brubaker, Massachusetts Institute of Rouse, Wake Forest University. Technology, Square ice, symmetric functions, and their New Developments in Graph Theory, Joshua Cooper connections to automorphic forms. and Kevin Milans, University of South Carolina, and Carlos 1348 NOTICES OF THE AMS VOLUME 58, NUMBER 9 Meetings & Conferences Nicolas and Clifford Smyth, University of North Carolina Special Sessions at Greensboro. Algebraic Geometry and Graded Commutative Alge- Noncommutative Algebra, Ellen E. Kirkman and James bra, Susan Cooper and Brian Harbourne, University of J. Kuzmanovich, Wake Forest University. Nebraska-Lincoln. Nonlinear Boundary Value Problems, Maya Chhetri, Algorithmic and Geometric Properties of Groups and University of North Carolina at Greensboro, and Stephen Semigroups, Susan Hermiller and John Meakin, University B. Robinson, Wake Forest University. of Nebraska-Lincoln. Nonlinear Dispersive Equations, Sarah Raynor, Wake Association Schemes and Related Topics, Sung Y. Song, Forest University, Jeremy Marzuola, University of North Iowa State University, and , University of Carolina at Chapel Hill, and Gideon Simpson, University Paul Terwilliger of Toronto. Wisconsin Madison. Recent Advances in Infectious Disease Modeling, Fred Asymptotic Behavior and Regularity for Nonlinear Chen and Miaohua Jiang, Wake Forest University. Evolution Equations, Petronela Radu and Lorena Bociu, Set Theoretic Topology, Peter Nyikos, University of University of Nebraska-Lincoln. South Carolina. Coding Theory, Christine Kelley and Judy Walker, Symmetric Functions, Symmetric Group Characters, University of Nebraska-Lincoln. and Their Generalizations, Sarah Mason, Wake Forest Commutative Algebra, Christina Eubanks-Turner, Uni- University, Aaron Lauve, Loyola University-Chicago, and versity of Louisiana at Lafayette, and Aihua Li, Montclair Ed Allen, Wake Forest University. State University. Computational and Applied Mathematics, Ludwig Ko- haupt, Beuth University of Technology Berlin, Germany, Lincoln, Nebraska and Yan Wu, Georgia Southern University. Continuous and Numerical Analysis in the Control of University of Nebraska-Lincoln PDE’s, George Avalos, Mohammad Rammaha, and Daniel October 14–16, 2011 Toundykov, University of Nebraska-Lincoln. Discrete Methods and Models in Biomathematics, Dora Friday – Sunday Matache and Jim Rogers, University of Nebraska-Omaha, Meeting #1074 and Alan Veliz-Cuba, University of Nebraska-Lincoln. Central Section Dynamic Systems on Time Scales with Applications, Associate secretary: Georgia Benkart Lynn Erbe and Allan Peterson, University of Nebraska- Announcement issue of Notices: August 2011 Lincoln. Program first available on AMS website: September 1, 2011 Dynamical Systems and Operator Algebras, Lewis Program issue of electronic Notices: October 2011 Bowen, Texas A&M University, and David Kerr, Texas A&M Issue of Abstracts: Volume 32, Issue 4 University at Galveston. Extremal and Probabilistic Combinatorics, Stephen Deadlines Hartke and Jamie Radcliffe, University of Nebraska- For organizers: Expired Lincoln. For consideration of contributed papers in Special Ses- Invariants in Knot Theory and Low-dimensional Topol- sions: Expired ogy, Mark Brittenham, University of Nebraska-Lincoln, and For abstracts: Expired Robert Todd, University of Nebraska-Omaha. Local Commutative Algebra, H. Ananthnarayan, Uni- The scientific information listed below may be dated. versity of Nebraska-Lincoln, Inês B. Henriques, University For the latest information, see www.ams.org/amsmtgs/ of California Riverside, and Hamid Rahmati, Syracuse sectional.html. University. Invited Addresses Matrices and Graphs, In-Jae Kim, Minnesota State Uni- versity, Adam Berliner, St. Olaf College, Leslie Hogben, Lewis P. Bowen, Texas A&M University, Entropy theory Iowa State University, and Bryan Shader, University of for actions of sofic groups. Emmanuel Candes, Stanford University, Recovering the Wyoming. unseen: Some recent advances in low-rank matrix recon- Quantum Groups and Representation Theory, Jonathan struction (Erdo˝s Memorial Lecture). Kujawa, University of Oklahoma, and Natasha Rozhkovs- Alina Cojocaru, University of Illinois at Chicago and kaya, Kansas State University. Mathematics Institute of the Romanian Academy, Ques- Recent Directions in Number Theory, Alina Cojocaru, tions about the reductions modulo primes of an elliptic University of Illinois at Chicago, and Michael Zieve, Uni- curve. versity of Michigan. Michael Zieve, University of Michigan, The happy mar- Recent Progress in Operator Algebras, Allan P. Donsig riage between arithmetic geometry and dynamical systems. and David R. Pitts, University of Nebraska-Lincoln. OCTOBER 2011 NOTICES OF THE AMS 1349 Meetings & Conferences Geometric, Combinatorial, and Computational Group Salt Lake City, Utah Theory, Eric Freden, Southern Utah University, and Eric Swenson, Brigham Young University. University of Utah Harmonic Analysis and Dispersive Partial Differential October 22–23, 2011 Equations, Xiaoyi Zhang, University of Iowa, and Monica Visan and Betsy Stovall, University of California Los Saturday – Sunday Angeles. Meeting #1075 Hypergeometric Functions and Differential Equations, Western Section Laura F. Matusevich, Texas A&M University, and Christine Associate secretary: Michel L. Lapidus Berkesch, Stockholm University. Announcement issue of Notices: August 2011 Inverse Problems and Homogenization, Elena Cherkaev Program first available on AMS website: September 8, 2011 and Fernando Guevara Vasquez, University of Utah. Program issue of electronic Notices: October 2011 Noncommutative Geometry and Algebra, Kenneth R. Issue of Abstracts: Volume 32, Issue 4 Goodearl, University of California Santa Barbara, and Milen Yakimov, Louisiana State University. Deadlines Nonlinear Waves, Zhi-Qiang Wang and Nghiem Nguyen, For organizers: Expired Utah State University. For consideration of contributed papers in Special Ses- Recent Progress in Numerical Partial Differential Equa- sions: Expired tions, Jichun Li, University of Nevada, Las Vegas, and For abstracts: Expired Shue-Sum Chow, Brigham Young University. Reductive Groups and Hecke Algebras, Dan Ciubotaru, The scientific information listed below may be dated. For the latest information, see www.ams.org/amsmtgs/ University of Utah, Cathy Kriloff, Idaho State University, sectional.html. and Peter Trapa, University of Utah. Understanding Bio-fluids via Modeling, Simulation and Invited Addresses Analysis, Christel Hohenegger, University of Utah. Graeme Milton, University of Utah, Metamaterials: High contrast composites with unusual properties. Lei Ni, University of California San Diego, Gap theorems Port Elizabeth, on Kähler manifolds. Igor Pak, University of California Los Angeles, The future of combinatorial bijections. Republic of South Monica Visan, University of California Los Angeles, Dis- persive partial differential equations at critical regularity. Africa Special Sessions Nelson Mandela Metropolitan University Algebraic Geometry, Tommaso de Fernex and Chris- November 29 – December 3, 2011 topher Hacon, University of Utah. Applied Analysis, Marian Bocea, North Dakota State Tuesday – Saturday University, and Mihai
Recommended publications
  • MODULAR MAGIC SUDOKU 1. Introduction 1.1. Terminology And
    MODULAR MAGIC SUDOKU JOHN LORCH AND ELLEN WELD Abstract. A modular magic sudoku solution is a sudoku solution with symbols in f0; 1; :::; 8g such that rows, columns, and diagonals of each subsquare add to zero modulo nine. We count these sudoku solutions by using the action of a suitable symmetry group and we also describe maximal mutually orthogonal families. 1. Introduction 1.1. Terminology and goals. Upon completing a newspaper sudoku puzzle one obtains a sudoku solution of order nine, namely, a nine-by-nine array in which all of the symbols f0; 1;:::; 8g occupy each row, column, and subsquare. For example, both 7 2 3 1 8 5 4 6 0 1 8 0 7 5 6 4 2 3 4 0 5 3 2 6 1 8 7 2 3 4 8 0 1 5 6 7 6 1 8 4 0 7 2 3 5 6 7 5 3 4 2 0 1 8 1 7 0 6 3 2 5 4 8 8 4 6 5 1 3 2 7 0 (1) 5 4 6 8 1 0 7 2 3 and 7 0 2 4 6 8 1 3 5 8 3 2 7 5 4 0 1 6 3 5 1 0 2 7 6 8 4 2 6 4 0 7 8 3 5 1 5 1 3 2 7 0 8 4 6 3 5 7 2 6 1 8 0 4 4 6 8 1 3 5 7 0 2 0 8 1 5 4 3 6 7 2 0 2 7 6 8 4 3 5 1 are sudoku solutions.
    [Show full text]
  • Mathematics of Sudoku I
    Mathematics of Sudoku I Bertram Felgenhauer Frazer Jarvis∗ January 25, 2006 Introduction Sudoku puzzles became extremely popular in Britain from late 2004. Sudoku, or Su Doku, is a Japanese word (or phrase) meaning something like Number Place. The idea of the puzzle is extremely simple; the solver is faced with a 9 × 9 grid, divided into nine 3 × 3 blocks: In some of these boxes, the setter puts some of the digits 1–9; the aim of the solver is to complete the grid by filling in a digit in every box in such a way that each row, each column, and each 3 × 3 box contains each of the digits 1–9 exactly once. It is a very natural question to ask how many Sudoku grids there can be. That is, in how many ways can we fill in the grid above so that each row, column and box contains the digits 1–9 exactly once. In this note, we explain how we first computed this number. This was the first computation of this number; we should point out that it has been subsequently confirmed using other (faster!) methods. First, let us notice that Sudoku grids are simply special cases of Latin squares; remember that a Latin square of order n is an n × n square containing each of the digits 1,...,n in every row and column. The calculation of the number of Latin squares is itself a difficult problem, with no general formula known. The number of Latin squares of sizes up to 11 × 11 have been worked out (see references [1], [2] and [3] for the 9 × 9, 10 × 10 and 11 × 11 squares), and the methods are broadly brute force calculations, much like the approach we sketch for Sudoku grids below.
    [Show full text]
  • 2019 Symposium Schedule of Events and Abstracts
    2019 AWM Research Symposium Schedule Rice University, Houston Texas Friday, April 5, 2019 5:00-8:00pm Informal Opening Reception Outside Valhalla Hall | Rice University Saturday, April 6, 2019 8:00-8:30am Registration and Continental Breakfast (Duncan Hall) ​ 8:30-8.45am Welcoming Remarks: Ruth Haas, AWM President, and Ami Radunskaya, AWM ​ Past-President (McMurtry Auditorium, Duncan Hall) 8:45-9:30am Plenary Lecture: Chelsea Walton, University of Illinois ​ Title: Quantum Symmetry Location: McMurtry Auditorium, Duncan Hall 9:30-10:15 Exhibits and Coffee (Martel Atrium, Duncan Hall) ​ 10:15-12:15 Research Sessions (expanded below) ACxx: Women in Algebraic Combinatorics, I (Keck 105) Analysis and Numerical Methods for Kinetic Transport and Related Models, I (Duncan Hall 1046) Applied and Computational Harmonic Analysis, I (Duncan Hall 1075) Combinatorial Commutative Algebra, I (Hermann Brown 227) WICA: Women in Commutative Algebra, I (Herzstein 212) Education Partnerships: University Mathematics Faculty and K-12 Mathematics Teachers (Herzstein 210) New Advances in Symplectic and Contact Topology, I (Hermann Brown 423) Topology of 3- and 4-Manifolds, I (Hermann Brown 427) WIC: Women in Control, I (Duncan Hall 1042) WIMM: Women in Mathematics of Materials, I (Herzstein 211) WINASC: Women in Numerical Analysis and Scientific Computing, I (Duncan Hall 1064) WinCompTop: Women in Computational Topology, I (Keck 100) WINART: Women in Noncommutative Algebra and Representation Theory, I (Keck 107) WIN: Women in Numbers, I (Herman Brown 453) WiSh:
    [Show full text]
  • How Do YOU Solve Sudoku? a Group-Theoretic Approach to Human Solving Strategies
    How Do YOU Solve Sudoku? A Group-theoretic Approach to Human Solving Strategies Elizabeth A. Arnold 1 James Madison University Harrisonburg, VA 22807 Harrison C. Chapman Bowdoin College Brunswick, ME 04011 Malcolm E. Rupert Western Washington University Bellingham, WA 98225 7 6 8 1 4 5 5 6 8 1 2 3 9 4 1 7 3 3 5 3 4 1 9 7 5 6 3 2 Sudoku Puzzle P How would you solve this Sudoku puzzle? Unless you have been living in a cave for the past 10 years, you are probably familiar with this popular number game. The goal is to fill in the numbers 1 through 9 in such a way that there is exactly one of each digit in each row, column and 3 × 3 block. Like most other humans, you probably look at the first row (or column or 3 × 3 block) and say, \Let's see.... there is no 3 in the first row. The third, 1Corresponding author: [email protected] 1 sixth and seventh cell are empty. But the third column already has a 3, and the top right block already contains a 3. Therefore, the 3 must go in the sixth cell." We call this a Human Solving Strategy (HSS for short). This particular strategy has a name, called the \Hidden Single" Strategy. (For more information on solving strategies see [8].) Next, you may look at the cell in the second row, second column. This cell can't contain 5, 6 or 8 since these numbers are already in the second row.
    [Show full text]
  • Program of the Sessions San Diego, California, January 9–12, 2013
    Program of the Sessions San Diego, California, January 9–12, 2013 AMS Short Course on Random Matrices, Part Monday, January 7 I MAA Short Course on Conceptual Climate Models, Part I 9:00 AM –3:45PM Room 4, Upper Level, San Diego Convention Center 8:30 AM –5:30PM Room 5B, Upper Level, San Diego Convention Center Organizer: Van Vu,YaleUniversity Organizers: Esther Widiasih,University of Arizona 8:00AM Registration outside Room 5A, SDCC Mary Lou Zeeman,Bowdoin upper level. College 9:00AM Random Matrices: The Universality James Walsh, Oberlin (5) phenomenon for Wigner ensemble. College Preliminary report. 7:30AM Registration outside Room 5A, SDCC Terence Tao, University of California Los upper level. Angles 8:30AM Zero-dimensional energy balance models. 10:45AM Universality of random matrices and (1) Hans Kaper, Georgetown University (6) Dyson Brownian Motion. Preliminary 10:30AM Hands-on Session: Dynamics of energy report. (2) balance models, I. Laszlo Erdos, LMU, Munich Anna Barry*, Institute for Math and Its Applications, and Samantha 2:30PM Free probability and Random matrices. Oestreicher*, University of Minnesota (7) Preliminary report. Alice Guionnet, Massachusetts Institute 2:00PM One-dimensional energy balance models. of Technology (3) Hans Kaper, Georgetown University 4:00PM Hands-on Session: Dynamics of energy NSF-EHR Grant Proposal Writing Workshop (4) balance models, II. Anna Barry*, Institute for Math and Its Applications, and Samantha 3:00 PM –6:00PM Marina Ballroom Oestreicher*, University of Minnesota F, 3rd Floor, Marriott The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 34, Issue 1 of Abstracts is ten minutes.
    [Show full text]
  • Bastian Michel, "Mathematics of NRC-Sudoku,"
    Mathematics of NRC-Sudoku Bastian Michel December 5, 2007 Abstract In this article we give an overview of mathematical techniques used to count the number of validly completed 9 × 9 sudokus and the number of essentially different such, with respect to some symmetries. We answer the same questions for NRC-sudokus. Our main result is that there are 68239994 essentially different NRC-sudokus, a result that was unknown up to this day. In dit artikel geven we een overzicht van wiskundige technieken om het aantal geldig inge- vulde 9×9 sudokus en het aantal van essentieel verschillende zulke sudokus, onder een klasse van symmetrie¨en,te tellen. Wij geven antwoorden voor dezelfde vragen met betrekking tot NRC-sudoku's. Ons hoofdresultaat is dat er 68239994 essentieel verschillende NRC-sudoku's zijn, een resultaat dat tot op heden onbekend was. Dit artikel is ontstaan als Kleine Scriptie in het kader van de studie Wiskunde en Statistiek aan de Universiteit Utrecht. De begeleidende docent was dr. W. van der Kallen. Contents 1 Introduction 3 1.1 Mathematics of sudoku . .3 1.2 Aim of this paper . .4 1.3 Terminology . .4 1.4 Sudoku as a graph colouring problem . .5 1.5 Computerised solving by backtracking . .5 2 Ordinary sudoku 6 2.1 Symmetries . .6 2.2 How many different sudokus are there? . .7 2.3 Ad hoc counting by Felgenhauer and Jarvis . .7 2.4 Counting by band generators . .8 2.5 Essentially different sudokus . .9 3 NRC-sudokus 10 3.1 An initial observation concerning NRC-sudokus . 10 3.2 Valid transformations of NRC-sudokus .
    [Show full text]
  • Math and Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, and Combinatorics
    Portland State University PDXScholar Student Research Symposium Student Research Symposium 2016 May 4th, 1:30 PM - 3:00 PM Math and Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, and Combinatorics Kyle Oddson Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/studentsymposium Part of the Algebra Commons, Discrete Mathematics and Combinatorics Commons, and the Other Mathematics Commons Let us know how access to this document benefits ou.y Oddson, Kyle, "Math and Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, and Combinatorics" (2016). Student Research Symposium. 4. https://pdxscholar.library.pdx.edu/studentsymposium/2016/Presentations/4 This Oral Presentation is brought to you for free and open access. It has been accepted for inclusion in Student Research Symposium by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Math and Sudoku Exploring Sudoku boards through graph theory, group theory, and combinatorics Kyle Oddson Under the direction of Dr. John Caughman Math 401 Portland State University Winter 2016 Abstract Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards. Introduction Sudoku is a logic-based puzzle game relating to Latin squares [4]. In the most common size, 9x9, each row, column, and marked 3x3 block must contain the numbers 1 through 9.
    [Show full text]
  • Minimal Complete Shidoku Symmetry Groups
    MINIMAL COMPLETE SHIDOKU SYMMETRY GROUPS ELIZABETH ARNOLD, REBECCA FIELD, STEPHEN LUCAS, AND LAURA TAALMAN ABSTRACT. Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particu- lar, the relationship between relabeling symmetries and positional symmetries such as row/column swaps is complicated. In this paper we focus first on the smaller Shidoku case and show first by computation and then by using connec- tivity properties of simple graphs that the usual symmetry group can in fact be reduced to various minimal subgroups that induce the same action. This is the first step in finding a similar reduction in the larger Sudoku case and for other variants of Sudoku. 1. INTRODUCTION:SUDOKU AND SHIDOKU A growing body of mathematical research has demonstrated that one of the most popular logic puzzles in the world, Sudoku, has a rich underlying structure. In Sudoku, one places the digits from one to nine in a nine by nine grid with the constraint that no number is repeated in any row, column, or smaller three by three block. We call these groups of nine elements regions, and the completed grid a Sudoku board. A subset of a Sudoku board that uniquely determines the rest of the board is a Sudoku puzzle, as illustrated in Figure 1, taken from [8]. Note that this puzzle contains only eighteen starting clues, which is the conjectured minimum number of clues for a 180-degree rotationally symmetric Sudoku puzzle.
    [Show full text]
  • 2021 September-October Newsletter
    Newsletter VOLUME 51, NO. 5 • SEPTEMBER–OCTOBER 2021 PRESIDENT’S REPORT This is a fun report to write, where I can share news of AWM’s recent award recognitions. Sometimes hearing about the accomplishments of others can make The purpose of the Association for Women in Mathematics is us feel like we are not good enough. I hope that we can instead feel inspired by the work these people have produced and energized to continue the good work we • to encourage women and girls to ourselves are doing. study and to have active careers in the mathematical sciences, and We’ve honored exemplary Student Chapters. Virginia Tech received the • to promote equal opportunity and award for Scientific Achievement for offering three different research-focused the equal treatment of women and programs during a pandemic year. UC San Diego received the award for Professional girls in the mathematical sciences. Development for offering multiple events related to recruitment and success in the mathematical sciences. Kutztown University received the award for Com- munity Engagement for a series of events making math accessible to a broad community. Finally, Rutgers University received the Fundraising award for their creative fundraising ideas. Congratulations to all your members! AWM is grateful for your work to support our mission. The AWM Research Awards honor excellence in specific research areas. Yaiza Canzani was selected for the AWM-Sadosky Research Prize in Analysis for her work in spectral geometry. Jennifer Balakrishnan was selected for the AWM- Microsoft Research Prize in Algebra and Number Theory for her work in computa- tional number theory.
    [Show full text]
  • President's Report
    Newsletter Volume 48, No. 3 • mAY–JuNe 2018 PRESIDENT’S REPORT Dear AWM Friends, In the past few months, as the AWM has been transitioning to a new management company under our new Executive Director, I have had the oppor- The purpose of the Association tunity to appreciate all that we do as an organization. We have over 150 volunteers for Women in Mathematics is working on 47 committees to support our many programs and activities. It has • to encourage women and girls to led me to reflect on the value of belonging. study and to have active careers Ages ago, when I was about to get my PhD, I received a call that I had in the mathematical sciences, and • to promote equal opportunity and been awarded a university-wide teaching award, which would be recognized at the the equal treatment of women and commencement ceremony. The caller wanted to make sure that I would be there girls in the mathematical sciences. with the appropriate attire (a valid concern). I was elated, of course, and I was very grateful to the people who had nominated me and fought for me to win that award. But it wasn’t until years later that I fully realized how much that effort costs, and how easy it is to assume that the system will recognize those who deserve recognition. In fact, being recognized did make me feel that I belonged to the community: I had something to offer, and that was noticed. The AWM currently administers 21 groups of awards: grants, prizes, special lectures, and other recognitions.
    [Show full text]
  • Minimal Complete Shidoku Symmetry Groups
    MINIMAL COMPLETE SHIDOKU SYMMETRY GROUPS ELIZABETH ARNOLD, REBECCA FIELD, STEPHEN LUCAS, AND LAURA TAALMAN ABSTRACT. Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particu- lar, the relationship between relabeling symmetries and positional symmetries such as row/column swaps is complicated. In this paper we focus first on the smaller Shidoku case and show first by computation and then by using connec- tivity properties of simple graphs that the usual symmetry group can in fact be reduced to various minimal subgroups that induce the same action. This is the first step in finding a similar reduction in the larger Sudoku case and for other variants of Sudoku. 1. INTRODUCTION:SUDOKU AND SHIDOKU A growing body of mathematical research has demonstrated that one of the most popular logic puzzles in the world, Sudoku, has a rich underlying structure. In Sudoku, one places the digits from one to nine in a nine by nine grid with the constraint that no number is repeated in any row, column, or smaller three by three block. We call these groups of nine elements regions, and the completed grid a Sudoku board. A subset of a Sudoku board that uniquely determines the rest of the board is a Sudoku puzzle, as illustrated in Figure 1, taken from [8]. Note that this puzzle contains only eighteen starting clues, which is the conjectured minimum number of clues for a 180-degree rotationally symmetric Sudoku puzzle.
    [Show full text]
  • The Mathematics of Sudoku Tom Davis [email protected] (Preliminary) June 5, 2006
    The Mathematics of Sudoku Tom Davis [email protected] http://www.geometer.org/mathcircles (Preliminary) June 5, 2006 1 Introduction Sudoku is a (sometimes addictive) puzzle presented on a square grid that is usually 9 × 9, but is sometimes 16 × 16 or other sizes. We will consider here only the 9 × 9 case, although most of what follows can be extended to larger puzzles. Sudoku puzzles can be found in many daily newspapers, and there are thousands of references to it on the internet. Most puzzles are ranked as to difficulty, but the rankings vary from puzzle designer to puzzle designer. Sudoku is an abbreviation for a Japanese phrase meaning ”the digits must remain single”, and it was in Japan that the puzzle first became popular. The puzzle is also known as ”Number Place”. Sudoku (although it was not originally called that) was apparently invented by Howard Garns in 1979. It was first published by Dell Magazines (which continues to do so), but now is available in hundreds of publications. At the time of publication of this article, sudoku 1 2 3 4 5 6 7 8 9 is very popular, but it is of course difficult to predict whether it will remain so. It does have a 4 8 many features of puzzles that remain popular: b puzzles are available of all degrees of difficulty, 9 4 6 7 the rules are very simple, your ability to solve c 5 6 1 4 them improves with time, and it is the sort of puzzle where the person solving it makes con- d 2 1 6 5 tinuous progress toward a solution, as is the case e 5 8 7 9 4 1 with crossword puzzles.
    [Show full text]