Sep 23. Ben Steinberg (CCNY) Title: Homological and topological finiteness conditions for monoids Abstract: Homological and topological finiteness properties of groups has long been of interest in connection with topology. Interest in homological finiteness conditions for monoids began with the Anick-Squier-Groves-Kobayashi theorem which says that a monoid with a finite complete rewriting system is of type $FP_{\infty}$. Starting in the early nineties Pride, Otto, Kobayashi and Guba began to investigate homological finiteness properties of monoids in connection with complete rewriting systems (there is also some work of Ivanov and of Sapir). In group theory, one normally studies homological properties via topology by using Eilenberg-MacLane spaces. For monoids, the work has been almost entirely algebraic in nature and for this reason progress on understanding finiteness conditions for such basic operations as free product with amalgamation has been slow. In this talk, we introduce the topological finiteness condition $F_n$ for monoids. It extends the usual notion for groups and seems to be surprisingly robust. We can then extend Ken Brown's topological proof of the Anick-Squier-Groves-Kobayashi theorem to monoids and we have made new progress on understanding finiteness properties of amalgamations, HNN extensions and HNN-like extensions (in the sense of Otto and Pride). In the process we develop some very rudimentary Bass-Serre theory for monoids. This is joint work with Bob Gray. ^{th} Hilbert problem in group rings and how equations in groups are related to equations in the group rings. The talk is based on joint results with O.Kharlampovich. Ada Peluso Visiting Professor, Hunter College, CUNY The study of random algebraic objects sheds a different light on these objects, which complements the algebraic, but also the algorithmic points of view. I will discuss random finitely generated subgroups of free groups from several perspectives: when they are given by a random tuple of generators (of reduced words), and when they are given by a random Stallings graph. The Stallings graph of a subgroup H is a finite labeled graph uniquely associated with H, from which one can efficiently compute invariants of H. It is an interesting combinatorial object in and of itself, whose structure must be understood to enumerate and randomly generate Stallings graphs and subgroups. While both approaches to random subgroups, generators and Stallings graphs, are natural, they yield different distributions, and a different view of what ‘most subgroups’ look like. Title: Lamplighter groups and (bi)reversible automata from affine transformations of $\mathbb Z_p[[t]]$.Abstract: The ring $\mathbb Z_p[[t]]$ of formal power series over $\Z_p$ can be naturally identified with the boundary of $p$-ary rooted tree $T_p$. For each $a(t),b(t)\in\mathbb Z_p[[t]]$ with $b(t)$ being a unit, we consider the affine transformations of $\mathbb Z_p[[t]]$ defined by $f(t)\mapsto a(t)+f(t)\cdot b(t)$. This transformation defines automorphisms of $T_p$ that can be explicitly described by an automaton that is finite if and only if both $a(t)$ and $b(t)$ are rational power series. We prove that the multiplication by a power series corresponding to a rational function $p(t)/q(t)\in\mathbb Z_p(t)$ is defined by a finite automaton that is reversible if and only if $\deg p\leq \deg q$. In particular, if $\deg p=\deg q$ the corresponding automaton is bireversible. This covers several examples that were studied earlier. We also describe algebraic structure of corresponding self-similar groups generated by such automata and show that they are isomorphic to lamplighter groups of various ranks. This is a joint result with Ievgen Bondarenko. Speaker: Denis Ovchinnikov (Stevens Institute) Abstract: Notion of a random (finitely presented) group gives a well-established approach to think about the question "what most groups look like". In standard models (few relator and density models), with probability 1 (or, more precisely, asymptotically almost surely), these groups turn out to be either hyperbolic or trivial. This way, if one desires to study the question "what most groups in class N look like", for some class of non-hyperbolic groups N, classical model cannot be applied directly. I will discuss the question above for the class of (finitely generated) nilpotent groups, provide an outline of known approaches to define a random nilpotent group, and present our results about typical groups in some of these models. The talk is based on joint work with Albert Garreta-Fontelles and Alexei Miasnikov. Title: Small Representations of finite classical groups.Abstract: Suppose you have a finite group G and you want to study certain related structures (random walks, expander graphs, word maps, etc.). In many cases, this might be done using sums over the characters of G. A serious obstacle in applying these formulas seemed to be lack of knowledge over the low dimensional representations of G. In fact, the “small" representations tend to contribute the largest terms to these sums, so a systematic knowledge of them might lead to proofs of some important conjectures. The “standard" method to construct representations of finite classical group is due to Deligne and Lusztig (1976). However, it seems that their approach has relatively little to say about the small representations. This talk will discuss a joint project with Roger Howe (Yale), where we introduce a language to define, and a new method for systematically construct, the small representations of finite classical groups. I will demonstrate our theory with concrete motivations and numerical data obtained with John Cannon (MAGMA, Sydney) and Steve Goldstein (Scientific computing, Madison). Rachel Skipper (Binghamton University), Title: The congruence subgroup problem for a family of branch groups Abstract: A group, G, acting on a regular rooted tree has the congruence subgroup property (CSP) if every subgroup of finite index contains the stabilizer of a level of the tree. When the subgroup structure of G resembles that of the full automorphism group of the tree, additional tools are available for determining if G has the CSP. In this talk, we look at the Hanoi towers group which has fails to have the CSP in a particular way. Then we will generalize this construction to a new family of groups and discuss the CSP for them. Gromov (NYU, IHES), isoperimetric inequalities in group algebras |