AMS Sectional Meeting AMS Special Session

Current as of Monday, July 10, 2017 10:14:34

---

Program  ·  Deadlines  ·  Registration/Housing/Etc.
Special Event or Lecture  ·  Inquiries: meet@ams.org

---

Spring Eastern Sectional Meeting
Hunter College, City University of New York, New York, NY
May 6-7, 2017 (Saturday - Sunday)
Meeting #1129

Associate secretaries:

Steven H Weintraub, AMS shw2@lehigh.edu

---

Special Session on Computational and Algorithmic Group Theory

• Saturday May 6, 2017, 8:30 a.m.-10:20 a.m.
  Special Session on Computational and Algorithmic Group Theory, I
  Glass Cafe, 3rd Floor, Hunter West
  Organizers:
  Denis Serbin, Stevens Institute of Technology dserbin@stevens.edu
  Alexander Ushakov, Stevens Institute of Technology
  

  • 8:30 a.m.
    Conjugacy search problem and the Andrews--Curtis conjecture.
    Dmitry Panteleev*, Stevens Institute Of Technology
    Alexander Ushakov, Stevens Institute Of Technology
    (1129-20-424)
  • 9:00 a.m.
    Algorithmic problems in metabelian groups.
    Alexei Miasnikov*, Stevens Institute of Technology
    (1129-20-153)
  • 10:00 a.m.
    Low complexity algorithmic problems in groups.
    Svetla Vassileva*, Champlain College, St-Lambert, QC, Canada
    (1129-20-191)
• Saturday May 6, 2017, 3:00 p.m.-4:20 p.m.
  Special Session on Computational and Algorithmic Group Theory, II
  HW412, Hunter West
  Organizers:
  Denis Serbin, Stevens Institute of Technology dserbin@stevens.edu
  Alexander Ushakov, Stevens Institute of Technology
  

  • 3:00 p.m.
    Geometry of limit groups is definable in their group algebras.
    Olga Kharlampovich*, Hunter College CUNY
    (1129-20-295)
  • 4:00 p.m.
    Homological finiteness conditions for one-relator monoids and related monoids.
    Robert Gray, University of East Anglia
    Benjamin Steinberg*, City College of New York
    (1129-20-226)
• Sunday May 7, 2017, 8:30 a.m.-10:45 a.m.
  Special Session on Computational and Algorithmic Group Theory, III
  Glass Cafe, 3rd Floor, Hunter West
  Organizers:
  Denis Serbin, Stevens Institute of Technology dserbin@stevens.edu
  Alexander Ushakov, Stevens Institute of Technology
  

  • 8:30 a.m.
    Word and conjugacy problems in Lacunary Hyperbolic Groups.
    Arman Darbinyan*, Nashville
    (1129-20-56)
  • 9:00 a.m.
    A graph-based method to randomly generate subgroups of free groups.
    Pascal Weil*, LaBRI, CNRS and Univ. Bordeaux
    (1129-20-296)
  • 10:00 a.m.
    On finite presentations of inverse semigroups having polynomial growth.
    Lev M Shneerson*, Hunter College of CUNY
    (1129-03-310)
• Sunday May 7, 2017, 2:00 p.m.-4:45 p.m.
  Special Session on Computational and Algorithmic Group Theory, IV
  Glass Cafe, 3rd Floor, Hunter West
  Organizers:
  Denis Serbin, Stevens Institute of Technology dserbin@stevens.edu
  Alexander Ushakov, Stevens Institute of Technology
  

  • 2:00 p.m.
    The generic complexity of coset enumeration.
    Robert H Gilman*, Stevens Institute of Technology
    (1129-20-305)
  • 3:00 p.m.
    Logspace computations in groups.
    Jeremy Macdonald*, Concordia University
    (1129-20-378)
  • 3:30 p.m.
    Transformation groups and discrete structures in continuum description of defective crystals.
    Maxim Zyskin*, University of Nottingham
    (1129-20-515)
  • 4:00 p.m.
    Geodesics of Outer Space in an Algorithmic Setting.
    Catherine Eva Pfaff*, University of California Santa Barbara
    (1129-20-298)

Inquiries: meet@ams.org

---