News from Hamilton College

Perkins Publishes Chip-Firing Research

SHARE THIS ARTICLE:
David Perkins
David Perkins
“The length distribution for burn-off chip-firing games on complete graphs,” co-authored by Visiting Assistant Professor of Computer Science David Perkins, was published in the September issue of the Bulletin of the Institute of Combinatorics and its Applications.
Complex systems that arise from the interactions of individual bits (such as traffic jams created by individual drivers) can be modeled by chip-firing games, in which piles of chips are moved around on a network of nodes and edges.
Perkins and co-author P. Mark Kayll of the University of Montana studied such games on complete graphs; in the process, they discovered a combinatorial proof of a complicated identity in probability.
“The identity has been proven before, but never by a method like ours,” Perkins said.

Comments

Post a Comment

Popular posts from this blog

The Combinatorics 2018 conference June 3 to 9, 2018 in Arco, Province of Trento, Italy

Image
Skip to content. | Skip to navigation Search Site Advanced Search… Site Map   Accessibility   Contact   Personal tools Log in This is SunRain Plone Theme Navigation Home About us Research Groups Conferences Area privata Combinatorics 2018       You are here:   Home   /  Combinatorics 2018 Combinatorics 2018 The Combinatorics 2018 conference will be organised by the research groups of the Universities of Brescia (Catholic and State Universities), Padova, and Verona. It will take place from June 3 to 9, 2018 in Arco, Province of Trento, Italy. It will be the 20th edition of this conference held in Italy--the first one in 1981, the second in 1982, and every two years ever since--with the participation of many experts in finite geometries and their applications from all over the world. The main themes of the conference will be Finite Geometries, Incidence Structures, Combinatorial Designs and Graph Theory. Arc
Read more

Conference announcement: FQ15 13-17 June 2022, Aubervilliers, France

 https://fq15.telecom-paris.fr/ International Conference on Finite Fields and Their Applications 2022 (Fq15) The conference  Fq15  will take place at Campus Condorcet, Aubervilliers, France (on line 12 of the Paris metro, at one station from the limit of Paris) during the week of June 13-17, 2022. Fq15  will continue the 30-year-old tradition of a forum for researchers on the mathematical aspects of finite fields and their applications.  Scientific Scope Topics of interest include, but are not limited to: Theory: structure of finite fields, primitive elements, normal bases, polynomials, number-theoretic aspects of finite fields, character sums, function fields, planar functions and almost perfect nonlinear functions, equations over finite fields. Computation: algorithms and complexity, polynomial factorization, decomposition, and irreducibility testing, sequences and functions. Applications: algebraic coding theory, cryptography, algebraic geometry over finite fields, finite incidence
Read more

Member in the news

Image
 https://news.viu.ca/5-questions-melissa-huggan 5 Questions with Melissa Huggan May 31, 2023 - 11:30am Dr. Melissa Huggan, a Vancouver Island University (VIU) Math Professor, received the 2022 Kirkman Medal from the Institute of Combinatorics and its Applications (ICA). The award recognizes excellent research by fellows or associate fellows of the ICA early in their research careers.  “She is a leader in her profession, distinguishing herself in organizing conferences, mathematical outreach and teaching excellence,” said the ICA in a release. Huggan joined VIU in August 2022. She completed her PhD in 2019 at Dalhousie University and was a Natural Sciences and Engineering Research Council of Canada post-doctoral fellow at Toronto Metropolitan University from 2019 to 2021. She was an Atlantic Association for Research in the Mathematical Sciences post-doctoral fellow at Mount Allison University from 2021 to 2022. Huggan’s research examines pursuit-evasion games, and her current research r
Read more