USNA Mathematics Department

GROUP THEORY DAY
Conference

Monday November 10, 1997

cayley graph

 

All talks are to be held in Chauvenet Hall, room 116 (Magnus software demo in Rickover Hall, room 119)


Professor Efim Zelmanov


Yale Univ

 

Time: noon

Title:

On some open problems related to the Burnside problem

 

Abstract: We will discuss some cases of the Burnside problem which still remain open.


 

Professor Gilbert Baumslag


Distinguished Professor at CUNY

 

Time: 3:45pm

Title:

Reflections on metabelian groups and lie rings

 

Abstract: I will talk about subgroups and sub-lie rings respectively, of finitely generated metabelian groups and lie rings, raising, as time permits, some related problems.


 

Professor Alexei Myasnikov


CUNY

 

Time: 5:00pm

Title:

Algorithmic problems over free groups, just how complicated are they?

 

Abstract:

"A free group is not a group, it is just a collection of words".
(Classic joke)

If you take this joke seriously , then every algorithmic problem is a problem over a free group. It does not look very promising, does it?

Instead, one can focus just on the problems which arise naturally "inside" a free group. I will discuss a hierarchy of such problems and compare different levels of this hierarchy with respect to their complexity.


 

Time: 8:30pm

Room: Rickover 119

Magnus software demo


 

 

There are plans for a dinner with the speakers Sunday night, November 9th. Time and place to be announced. (Tentatively, Cafe Normandie on Main Street in Annapolis, around 6pm.)


Email questions about the conference to:
Tony Gaglione or David Joyner

Last updated 11-7-97