Charles V. Schaefer, Jr. School of Engineering and Science
 
 
ACC Top Page » Algebra and Cryptology Center » ACC Seminar

ACC Seminar

Spring 2018
Monday, Feb 5 Speaker: Alexander Ushakov (Stevens)
Title: "Simultaneous conjugacy separation search problem: attack on Algebraic Eraser"

Abstract: I will discuss Algebraic Eraser key-agreement protocol proposed in the paper I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux. Key agreement, the algebraic eraser, and lightweight cryptography. In Algebraic Methods in Cryptography, volume 418 of Contemporary Mathematics, pages 1--34. American Mathematical Society, 2006. I will define Algebraic Eraser, discuss history of attacks and present a new attack that has 100% success on VERY LONG keys.
Monday, Feb 12 Speaker: Johanna Franklin (Hofstra)
Title: "Algorithmically random points"

Abstract: I will use computability theory to characterize randomness in the Cantor space using three different intuitive approaches: unpredictability, incompressibility, and a lack of distinguishing properties. After developing this basic framework, I will present different formalizations that result in different classes of random points and discuss the relationships between these classes and naturally occurring classes in other areas of mathematics.
Monday, Feb 24 Speaker: Igor Lysenok (Stevens and the Russian Academy of Sciences , Moscow · Steklov Mathematical Institute)
Title: "Small cancellation theory and Burnside groups"

Abstract: This is brief overview of iterated small cancellation theory that can be applied to Burnside groups of odd exponents n with moderate bound n > 2000.
Monday, Mar 5 Speaker: Rizos Sklinos (Stevens)
Title: "Forking in the free group"

Abstract: The first-order theory of nonabelian free groups attracted much attention when Kharlampovich-Miasnikov and Sela answered in the positive Tarski's question on whether nonabelian free groups share the same common first-order theory.

In addition, Sela proved the astonishing result that this common first-order theory is stable, making it possibly the most interesting example of a stable group.

Roughly speaking, a first order theory is stable when one can find a "nice" independence relation in all of its models. Prototypical examples being linear independence in vector spaces and algebraic independence in algebraically closed fields. Stability had been discovered by Shelah in his famous and successful classification program where he classified first-order theories according to the number of non-isomorphic models they have in every cardinality.

In joint work with C. Perin we give a natural geometric interpretation of this independence relation in nonabelian free groups.
Monday, Mar 19 Speaker: Alexander Ushakov (Stevens)
Title: "The Kayawood protocol"

Abstract: Kayawood is a two party Diffie-Hellman type protocol recently proposed by Iris Anshel, Derek Atkins, Dorian Goldfeld, and Paul E. Gunnells. The paper is available here: https://eprint.iacr.org/2017/1162 In my talk I will define the protocol, discuss its security features, and show how to reduce a passive attack challenge to a certain search problem over braid groups.
Monday, Mar 26 Speaker: Alexander Ushakov (Stevens)
Title: "Walnut DSA"

Abstract: The next in a series of talks on cryptanalysis. Walnut DSA is a new digital signature algorithm proposed by SecureRF that uses action of braids on a finite set (aka e-multiplication). See https://eprint.iacr.org/2017/058.pdf .
Monday, Apr 2 Speaker: Yuri Gurevich (University of Michigan)
Title: "What's quantum computing anyway?"

Abstract: Using the example of the function inversion problem, we illustrate the power and limitations of quantum computing. No knowledge of quantum computing is assumed..
Monday, Apr 16 Speaker: Alexei Miasnikov (Stevens)
Title: "First Order Paradise"

Abstract: A long time ago Malcev asked about definable subgroups in free groups. It turned out that the obvious ones are the only definable subgroups there. A similar question can be asked about any group, or semigroup, or ring. I am interested in groups where all reasonable subgroups are first-order definable. In fact, are there such “non-trivial and interesting” groups or rings? Surprisingly, the answer is YES.

I will talk about classical algebraic structures (groups, rings, and such) where "anything you reasonably want" is first-order definable. I will explain what does this mean precisely and show some results.
Monday, Apr 23 Speaker: Alexei Miasnikov (Stevens)
Title: "First Order Paradise (continued)"

Monday, May 7 Speaker: Alexei Miasnikov (Stevens)
Title: "Algorithmic Group Theory and Cryptography"

Monday, May 13 Speaker: Anand Pillay, University of Notre Dame
Title: "Pseudofinite groups and combinatorics"

Abstract: I will discuss some joint work with Gabriel Conant and Caroline Terry. This concerns Szemeredi-type theorems in the contexts of finite groups G equipped with a distinguished subset A. Under various conditions on the relation x∙y ∈ A we give asymptotic descriptions of A and its translates in G. The methods involve local stability and local NIP theorems for pseudofinite groups. I will discuss some joint work with Gabriel Conant and Caroline Terry. This concerns Szemeredi-type theorems in the contexts of finite groups G equipped with a distinguished subset A. Under various conditions on the relation x∙y ∈ A we give asymptotic descriptions of A and its translates in G. The methods involve local stability and local NIP theorems for pseudofinite groups.
Fall 2017
Monday, Sept 18 Speaker: Alexei Mishchenko (Sobolev Institute of Mathematics)
Title: " Canonical and existentially closed groups in universal classes of abelian groups"
Monday, Sept 25 Speaker: Sasha Treyer (Stevens)
Title: "The knapsack problem for nilpotent groups and Baumslag-Solitar groups"
Monday, Oct 2 Speaker: Florian Walsh (University of Passau)
Title: "Computation of Idempotents in Rings using Primary Decomposition"
Monday, Oct 16 Speaker: Igor Lysenok ( Stevens and the Russian Academy of Sciences , Moscow · Steklov Mathematical Institute)
Title: "The Commutator width of the Grigorchuk group"
Monday, Oct 30 ACC Organizational Meeting
Monday, Nov 6 Speaker: Alina Vdovina (Newcastle University and Hunter College)
Title: "Buildings and K-theory of C*-algebras"

Abstract: Explicit constructions of C*-algebras and computing their K-theory are believed to be useful for quantum computing. We will give constructions of C*- algebras using Ballmann-Brin geometric approach to buildings and polygonal presentations introduced by the speaker in early 2000s. It gives very explicit combinatorial ways to compute the K-theory of our C*-algebras which can not be achieved by the standard methods of Operator theory.
Monday, Nov 13 Speaker: Olga Kharlampovich (Hunter College, CUNY)
Title: "Random Burnside groups"

Abstract: I will discuss Gromov-Delzant-Coulon construction of infinite Burnside groups and different models of random Burnside groups.
Monday, Nov 20 Speaker: Vladimir Shpilrain (City College, CUNY)
Title: "Fully homomorphic encryption on rings"

Monday, Dec 4 Speaker: Rizos Sklinos (Stevens)
Title: "Some model theory of nonabelian free groups"

Abstract: Around 1946 Tarski asked whether nonabelian free groups share the same common theory. Many mathematicians, Mal’cev, Lyndon, Makanin to name a few, have approached the problem and contributed to it. Despite their efforts the problem seemed very hard to tackle and only after more than fifty years, in 2001, a positive answer was given by Kharlampovich-Myasnikov and Sela independently.

Since then, the common theory of nonabelian free groups has attracted a lot of attention from the community of model theorists and group theorists. The positive solution to Tarski’s question is considered one of the deepest results in the model theory of groups.

In this talk I am going to survey the results that are currently known about this first-order theory and pose problems that are still open.
Fall 2016
Monday, Oct 24 Speaker: Jan Cannizzo (Stevens)
Title: "New trends in education"
Monday, Nov 7 Speaker: Michael Shapiro (Tufts University)
Title: "Generalized Dehn's algorithms"

Abstract: Early last century, Dehn articulated the three problems which we now call the word problem, the conjugacy problem and the isomorphism problem. He then solved the word problem for surface groups. For example, consider
G = ⟨x1, y1, x2, y2 | ℜ := [x1, y1][x2, y2] = 1⟩
Dehn observes that any non-trivial word for the identity contains more than half of a cyclic permutation of ℜ or ℜ-1. This gives a finite set of length-decreasing substitutions which produces the empty word if and only if the original word is the identity. We call such a set of relations a Dehn's algorithm.
Cannon showed that any group acting co-compactly, discretely by isometries on Hn has a Dehn's algorithm. Indeed, a group is hyperbolic if and only if it has a Dehn's algorithm.
What happens if we are allowed to make substitutions using letters which are not elements of the group? In joint work with Oliver Goodman, inspired by Cannon, we show that this new class of groups includes finitely generated nilpotent groups and relatively hyperbolic groups with nilpotent peripheral sub- groups. We can also show that some groups (for example solve geometry, F × Z, Thomsen's groups) do not have generalized Dehn's algorithms.
Monday, Nov 14 Speaker: Consuelo Martinez Lopez (Universidad de Oviedo)
Title: "Ellipticity of Words in Groups and Algebras"

Abstract: In this talk we will deal with words w of the free pro-p-group F and we will try to show classes of groups in which every such word w is elliptic. Keeping in mind the linearization process in algebras, we will define a notion of multilinear word w in F and we will show some stronger result for the case of multilinear words. We will consider also the notion of ellipticity in Lie algebras.
Monday, Nov 21 Speaker: Alexey Ovchinnikov (Queens College, CUNY)
Title: "Bounds in algebraic differential equations"

Abstract: Differential Nullstellensatz is a fundamental fact in the algebraic theory of differential equations. It states that, if a system of algebraic differential equations does not have a solution in any extension of the coefficient field, then 1 can be written as a polynomial linear combination of the derivatives of the equations of the original system up to some order. Thus, due to the classical effective polynomial Nullstellensatz, finding bounds for this order is a key ingredient in understanding the complexity of the problem. We will present a new and improved bound for the effective version of the differential Nulstellensatz. Our approach is based on using triangular sets in the prolongation-projection method.
Monday, Nov 28 Speaker: Sam Van Gool (The City College, CUNY)
Title: "Pro-aperiodic monoids via saturated models"

Abstract: The class of aperiodic monoids has long played a fundamental role in finite semigroup theory and automata theory. In this work we apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words. Model theory provides us with saturated words in each such class, i.e., words in which all possible factorizations are realized. We give several applications of this new approach.
This talk is on joint work with Ben Steinberg (CCNY), see our preprint here.
Spring 2016
Monday, Feb 8 Speaker: Alexander Ushakov (Stevens)
Title: "The quantum Fourier transform"
Monday, Feb 22 Speaker: Igor Lysenok (Stevens)
Title: "Solving quadratic equations in metablelian groups"
Monday, Feb 29 Speaker: Dmitry Panteleev (Stevens)
Title: "The conjugacy search problem and the Andrews-Curtis conjecture"
Monday, Mar 14 Speaker: Nicholas Touikan (Stevens)
Title: "Report on Young Geometric Group Theorists V"
Monday, Mar 28 Speaker: Khalid Bou-Rabee (The City College, CUNY)
Title: "Intersection growths of groups"

Abstract: Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. We motivate studying this growth and explore some examples with a focus on nilpotent groups and zeta functions. This covers joint work with Ian Biringer, Martin Kassabov, and Francesco Matucci.
Monday, Apr 4 Speaker: Eric Allender (Rutgers University)
Title: "Zero Knowledge and Circuit Minimization"

Abstract: For roughly four decades, two of the best-studied problems in NP that are not known to be in P or to be NP complete have been:
* Graph Isomorphism, and
* MCSP (the Minimum Circuit Size Problem).
Yet there had been no theorem, relating the complexity of these two problems to each other. Until recently. We give a simple argument - drawing on the connection between MCSP and time-bounded Kolmogorov complexity - showing that not only Graph Isomorphism, but every problem in the complexity class SZK (Statistical Zero Knowledge) is BPP reducible to MCSP (joint work with Bireswar Das).
If there is time, I'll also discuss more recent work on a related topic (joint with Josh Grochow and Cris Moore).
Monday, Apr 11 Speaker: Doron Puder (Institute for Advanced Study)
Title: "Word Measures on Unitary Groups"

Abstract: This is joint work with Michael Magee. We combine concepts from random matrix theory and free probability together with ideas from geometric group theory, and establish new connections between the two. More particularly, we study measures induced by free words on the unitary groups U(n). For example, if w is a word in F2 = ⟨x,y⟩, sample at random two elements from U(n), A for x and B for y, and evaluate w(A,B). The measure of this random element is called the w-measure on U(n). We study the expected trace (and other statistics) of a random unitary matrix sampled from U(n) according to the w-measure, and find surprising algebraic properties of w that determine these quantities.
If time permits, I will also describe one of the main ingredients from the proof: a finite simplicial complex which is an Eilenberg-MacLane space for certain subgroups of the mapping class group of a compact surface with boundary.
Monday, May 2 Speaker: Nikolay Romanovskiy (Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia)
Title: "Splittings of groups over abelian normal subgroups"

Abstract: Let A be an abelian normal subgroup of a group G. Let G = G / A, g = gA for g ∈ G. We can consider A as a right ZG-module, by defining an action of u = α1 g1 + … + αn gn ∈ ZG on a ∈ A as au = (ag1)α1 ⋅ … ⋅ (agn)αn, where (agi)αi = gi-1 a gi. Denote by ΘZG(A) the annihilator of A in the group ring ZG, and put R = ZG / ΘZG(A). A is also an R-module. We study when there is an R-splitting of G over A.
Monday, May 9 Speaker: Alexander Treyer (Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Omsk, Russia)
Title: "Subset sum problem in wreath products of groups"

Abstract: It will be shown that SSP is strongly NP-complete for Lampligher group. This result will be extended to more general cases of wreath products.
Fall 2015
Monday, Sep 27 Speaker: Nicholas Touikan (Stevens)
Title: "Finding surface subgroups in graphs of free groups: looking back on 5 years of failure."

Abstract: I will report on my work in progress with Inna Bumagin on the construction of Makanin-Razborov diagrams for relatively hyperbolic groups with possibly non-abelian parabolics and possibly with torsion. The approach is a generalization of previous methods. I hope to touch upon some of the innovations in (delta-hyperbolic metric) geometry, as well as in algebraic geometry needed to get the claimed result.
Monday, Oct 19 Speaker: Igor Lysenok (Stevens)
Title: "A discrete curvature approach to finitely presented groups"

Abstract: We consider a sufficient condition on a finite presentation of a group which guarantees its hyperbolicity. The condition is formulated in terms of negative value of a certain discrete analog of curvature of Lyndon-van Kampen diagrams over the presentation. There are examples of computer implemented proof of hyperbolicity of some finitely presented groups though no general algorithm has been elaborated.
Monday, Oct 26 Speaker: Yuri Gurevich (Microsoft Research)
Title: "Logic in computer science and software enginering"

Abstract: Eugene P. Wigner and Richard W. Hamming wrote about the “unreasonable effectiveness” of mathematics in the natural sciences. This inspired Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, and Victor Vianu to write about the “unusual effectiveness” of logic in computer science. Moshe Vardi gives talks about a “logic revolution” in computer science and, to an extent, software engineering.
We are a bit less jubilant about the role that logic and logicians have been playing in science and engineering. Logic had the greatest prestige in the first part of the 20th century. Today, its role could be - and should be - bigger, especially in software engineering. Software engineers studied calculus but rarely, if ever, use it. They did not study formal logic but use day in and day out, even though many of them do not realize that. We will try to illustrate why formal logic is so relevant for software engineers, and why it is hard for them to pick it up.
Monday, Nov 2 Speaker: Gretchen Ostheimer (Hofstra University)
Title: "Decomposability of finitely generated torsion-free nilpotent groups"

Abstract: We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
This is joint work with Gilbert Baumslag and Chuck Miller.
Monday, Nov 16 Speaker: Armin Weiß (Universität Stuttgart, Stuttgart, Germany)
Title: "QuickMergesort: Efficient Sorting with n log n - 1.399n + o(n) Comparisons on Average"
Abstract: Sorting a sequence of elements of some totally ordered universe is one of the most frequent tasks carried out by computers. Classical algorithms for this problem are Quicksort, Heapsort, or Mergesort. In 2000, Cantone and Cincotti described QuickHeapsort -- a hybrid algorithm combining of Quicksort and Heapsort. We generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some sorting algorithm X which uses external memory, QuickXsort yields an internal sorting algorithm if X satisfies certain natural conditions. With QuickWeakHeapsort and QuickMergesort we present two examples for the QuickXsort-construction. Both are efficient algorithms that incur approximately n log n - 1.26n + o(n) comparisons on the average. A worst case of n log n + O(n) comparisons can be achieved without significantly affecting the average case. QuickMergesort shows a good performance on practical inputs: when sorting integers it is slower by only 15% to STL-Introsort. Moreover, by sorting small sub-arrays with MergeInsertion, we establish a worst-case efficient internal sorting algorithm calling for n log n - 1.399n+o(n) comparisons on average - thus, coming close to the information theoretic lower bound.
Monday, Nov 30 Speaker: Michael Zabarankin (Stevens)
Title: "Support vector machines"
Spring 2015
Tuesday, Feb 3 Speaker: Johannes A. Buchmann (Technische Universität Darmstadt, Germany)
Title: "Post-Quantum-Cryptography - an overview"

Abstract: In this talk we explain the idea and relevance of public-key cryptography. We explain that quantum computers will be able to break all public-key cryptography that is used today. We will give an overview over the most promising approaches to come up with quantum-safe public-key cryptography.
Tuesday, Mar 10 Speaker: Olga Kharlampovich (Hunter College, CUNY)
Title: "Elementary classification questions for algebras and group rings"

Abstract: We consider some fundamental model-theoretic questions that can be asked about a given algebraic structure (a group, a ring, etc.), or a class of structures, to understand its principal algebraic and logical properties. These Tarski type questions include: elementary classification and decidability of the first-order theory.
In the case of free groups we proved that two non-abelian free groups of different ranks are elementarily equivalent, classified finitely generated groups elementarily equivalent to a finitely generated free group (also done by Sela) and proved decidability of the first-order theory.
We describe partial solutions to Tarski's problems in the class of free associative, free Lie algebras of finite rank and group algebras, and some open problems. In particular, we will show that unlike free groups, two free associative algebras of finite rank over the same field are elementarily equivalent if and only if they are isomorphic. Two free associative algebras of finite rank over different infinite fields are elementarily equivalent if and only if the fields are equivalent in the weak second order logic, and the ranks are the same. We will also show that for an infinite field the theory of a free associative algebra is undecidable.
These are joint results with A. Miasnikov.
Tuesday, Mar 31 Speaker: Nikolay Romanovskiy (Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia)
Title: "Q-completions of free solvable groups"
Tuesday, Apr 14 Speaker: Simon Smith (New York City College of Technology, CUNY)
Title: "Totally disconnected locally compact groups and groups acting on locally finite graphs"

Abstract: The study of locally compact groups divides naturally into investigating those which are connected, and those which are totally disconnected. Since the solution of Hilbert's Fifth Problem, connected locally compact groups are known to be projective limits of connected Lie groups, and because of this their structure is now relatively well-understood. On the other hand, the class of totally disconnected locally compact (tdlc) groups contains all discrete groups (and therefore all groups) and so it was thought that very little in general could be said about their structure. This changed in 1994 when George Willis proved that tdlc groups admit a scale function. The scale function on a tdlc group G measures the translation length of elements in G acting by conjugation on the set of compact open subgroups of G.
Roggi Moller recovered Willis' work by looking only at groups acting on locally finite graphs, and it is this approach that I will describe in my talk. Thinking about tdlc groups in terms of groups acting on locally finite graphs is a natural way for those who work primarily with finitely generated groups to begin thinking about the theory of tdlc groups. This new way of looking at tdlc groups offers insight into their structure, and has led to the solution of a number of open problems, one of which I will talk about in detail.
Tuesday, Apr 21 Speaker: Nelly Fazio (The City College, CUNY)
Title: "TBA"
Tuesday, Apr 28 Speaker: Eugene Plotkin (Bar Ilan University, Israel)
Title: "Similarity of geometries over algebras"

Abstract: We will discuss thoroughly how to define closeness of geometries over algebras of the same variety. We will show that there is a kind of rigidity theorem for a number of varieties. All the necessary notions will be defined.
Fall 2014
Monday, Sep 22 Speaker: Alexei Miasnikov (Stevens)
Title: "Tarski problems in free groups"
Monday, Sep 22 Speaker: Bob Gilman (Stevens)
Title: "On the Andrews-Curtis Conjecture"
Monday, Oct 5 Speaker: Nicholas Touikan (Stevens)
Title: "Makanin-Razborov diagrams for relatively hyperbolic groups"

Abstract: I will report on my work in progress with Inna Bumagin on the construction of Makanin-Razborov diagrams for relatively hyperbolic groups with possibly non-abelian parabolics and possibly with torsion. The approach is a generalization of previous methods. I hope to touch upon some of the innovations in (delta-hyperbolic metric) geometry, as well as in algebraic geometry needed to get the claimed result.
Tuesday, Oct 14 Speaker: Artem Shevlyakov (Omsk State University)
Title: "Semigroups with inversion: equations and algebraic sets"

Abstract: I consider equations over inverse, completely simple and completely regular semigroups. The disjunction of two solution sets of an equation is not necessarily equal to a solution set of an appropriate system of equations. We describe the semigroups from the classes above, where ANY disjunction of the solution sets is algebraic (i.e. it equals to a solution set of some system of equations).
Monday, Oct 20 Speaker: Antonio Nicolosi (Stevens)
Title: "Hard learning problems over non-commutative groups"
Monday, Oct 27 Speaker: Artem Shevlyakov (Omsk State University)
Title: "Equations and logical classes of left regular bands"

Abstract: The semigroup class of left regular bands (LRB) is defined by the identities xx=x, xyx=xy, and it has many applications in mathematics. Precisely, such semigroups are used in matroid theory, random walks and hyperplane arrangements. The general motivation of my study was a logical classification of matroids. Namely, I tried to understand the matroids which are close to the free matroid using LRB-s. This problem compelled me to develop algebraic geometry over LRB-s. In this talk I give a classification of LRB-s relative to their equational properties.
Monday, Nov 3 No seminar
Monday, Nov 10 Speaker: Xiaohu Li (Stevens)
Title: "Algebraic statistics"

Speaker: Alexei Mishchenko and Sasha Treyer (Omsk State University)
Title: "Generic theories of abelian groups"
Monday, Nov 17 Speaker: Ben Steinberg (The City College, CUNY)
Title: "A universal syntactic invariant of flow equivalence of symbolic dynamical systems"
Abstract: A symbolic dynamical system (or shift space) is a shift-invariant closed subspace of a Cantor space AZ. Flow equivalence is a classical coarsening of the notion of conjugacy (or isomorphism). Since AZ is the space of all bi-infinite words over the alphabet A, shift spaces are determined by their languages of finite factors, and flow equivalence can be described syntactically in terms of sliding block codes and symbol expansions, it is natural to try to derive syntactic invariants of flow equivalence from their associated languages.
In this talk we introduce a new syntactic invariant, called the Karoubi envelope, of a symbolic dynamical system. We indicate how under mild hypotheses it classifies the Markov-Dyck and Markov-Motzkin shifts associated to graphs by W. Krieger. It turns out to be a finer invariant than essentially all syntactic invariants that we are aware of in the literature (including some that were only known to be conjugacy invariants). We also have that the Karoubi envelope is a universal syntactic invariant for sofic shifts in the sense that any flow equivalence invariant for sofic shifts that agrees on all sofic shifts with isomorphic syntactic semigroups automatically agrees on all shifts with equivalent Karoubi envelopes.
I will not assume for this talk the audience has any prior contact with symbolic dynamic. All notions will be introduced from scratch and worked with combinatorially. I hope the talk will be accessible to graduate students.
This is a report on joint work with Alfredo Costa (Coimbra).
Monday, Nov 24 Speaker: Jan Cannizzo (Stevens)
Title: "Invariant random subgroups: background, results, and open problems"

Abstract: I'll give an introduction to the theory of invariant random subgroups, which has recently attracted a lot of attention. I'll aim to survey a number of results, including my own work (some of which is joint with Vadim Kaimanovich), and indicate open problems and new directions.
Monday, Dec 1 Speaker: Funda Gul (Stevens)
Title: "Some algorithmic properties of Magnus embedding and generalization of Auslander-Lyndon theorem"