Binghamton University Graduate Conference in Algebra and Topology

November 14th and 15th, 2015

Keynote Speaker
Mark Feighn
Rutgers University

Folding in the Free Group

AbstractFrom a finite set of generators for a subgroup H of a free group, can we find a basis for H? In the early 1980s John Stallings introduced a simple idea called folding that easily answers this question. Folding is now ubiquitous in the study of free groups and their automorphisms. The goal of the talk is to explain this simple idea and give some applications. The talk will be elementary. For example, it will start by recalling the definition of a free group.

Keynote Speaker
Bob Morse
University of Evansville

Computational Group Theory for the Working Mathematician

Abstract: Computational systems such as the GAP (Groups, Algorithms and Programming) system for computational algebra and discrete mathematics provide functionality for very sophisticated calculations with both finite and infinite groups and a plethora of related and supporting algebraic objects. Moreover, this functionality can be composed by the user to create even more sophisticated functionality that then can be applied to the user’s specific research needs.

The focus of this talk is to describe what systems like GAP can do and strategies for using such systems to enhance and aid in our research. Examples will be from my own research experience in group theory and algebraic topology. The ideas and methods presented are general and can be applied to other computational systems and areas of mathematics.