Searcharxiv⌕ Search

arXiv subjects

Martin Kassabov

Publications and source records attributed to Martin Kassabov.

At least 37 records · Page 2Linked to original sources
arXiv2013

Higher hairy graph homology

We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy graph homology coming from graphs with cyclic fundamental group as the dihedral homology of a related associative algebra with involution. For the operads Comm, Assoc and Lie we compute this algebra explicitly, enabling us to apply known results on dihedral homology to the computation of hairy graph homology. In addition we determine the image in hairy graph homology of the trace map defined in [CKV], as a symplectic representation. For the operad Lie assembling hairy graph cohomology classes yields all known non-trivial rational homology of Out(F_n). The hairy graph homology of Lie is also useful for constructing elements of the cokernel of the Johnson homomomorphism of a once-punctured surface.

math.AT↗
arXiv2012

Hairy graphs and the unstable homology of Mod(g,s), Out(F_n) and Aut(F_n)

We study a family of Lie algebras {hO} which are defined for cyclic operads O. Using his graph homology theory, Kontsevich identified the homology of two of these Lie algebras (corresponding to the Lie and associative operads) with the cohomology of outer automorphism groups of free groups and mapping class groups of punctured surfaces, respectively. In this paper we introduce a hairy graph homology theory for O. We show that the homology of hO embeds in hairy graph homology via a trace map which generalizes the trace map defined by S. Morita. For the Lie operad we use the trace map to find large new summands of the abelianization of hO which are related to classical modular forms for SL(2,Z). Using cusp forms we construct new cycles for the unstable homology of Out(F_n), and using Eisenstein series we find new cycles for Aut(F_n). For the associative operad we compute the first homology of the hairy graph complex by adapting an argument of Morita, Sakasai and Suzuki, who determined the complete abelianization of hO in the associative case.

math.AT↗
arXiv2011

Groups of Oscillating Intermediate Growth

We construct an uncountable family of finitely generated groups of intermediate growth, with growth functions of new type. These functions can have large oscillations between lower and upper bounds, both of which come from a wide class of functions. In particular, we can have growth oscillating between $e^{n^a}$ and any prescribed function, growing as rapidly as desired. Our construction is built on top of any of the Grigorchuk groups of intermediate growth, and is a variation on the limit of permutational wreath product.

math.GR↗
arXiv2011

Structure theorems for subgroups of homeomorphisms groups

In this partly expository paper, we study the set A of groups of orientation-preserving homeomorphisms of the circle S^1 which do not admit non-abelian free subgroups. We use classical results about homeomorphisms of the circle and elementary dynamical methods to derive various new and old results about the groups in A. Of the known results, we include some results from a family of results of Beklaryan and Malyutin, and we also give a new proof of a theorem of Margulis. Our primary new results include a detailed classification of the solvable subgroups of R. Thompson's group T .

math.GR↗
arXiv2011

Bounding the residual finiteness of free groups

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of size ~ n^{2/3} or less. This improves on a previous result of Bou-Rabee and McReynolds quantifying the lower bound of the residual finiteness of free groups.

math.GR↗
arXiv2011

The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit interval. The techniques we develop extend the ones used by Brin and Squier allowing us to compute roots and centralizers as well. Moreover, these techniques can be generalized to solve the same question in larger groups of piecewise-linear homeomorphisms.

math.GR↗
arXiv2011

The Dehn function of Baumslag's Metabelian Group

Baumslag's group is a finitely presented metabelian group with a Z \wr Z subgroup. There is an analogue with an additional torsion relation in which this subgroup becomes C_m \wr Z. We prove that Baumslag's group has an exponential Dehn function. This contrasts with the torsion analogues which have quadratic Dehn functions. v.2: version for publication, incorporating referee's suggestions.

math.GR↗
arXiv2009

Nonlinearity of matrix groups

The aim of this note is to answer a question by Guoliang Yu of whether the group $EL_3(Z )$, where $Z $ is the free (non-commutative) ring, has any faithful linear representations over a field. We prove, in particular, that for every (unitary associative) ring $R$, the group $EL_3(R)$ has a faithful finite dimensional complex representation if and only if $R$ has a finite index ideal that has a faithful finite dimensional complex representation.

math.GR↗
arXiv2008

Generation of polycyclic groups

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G. While not claiming anything new we believe that our argument is much simpler that the original one. Moreover our result gives some sufficient condition when d(G)=d(\hat G) which can be verified quite easily in the case when G is virtually abelian.

math.GR↗
arXiv2007

Presentations of finite simple groups: a quantitative approach

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n +\log q)$. As a corollary, we deduce a conjecture of Holt: there is a constant $C$ such that $\dim H^2(G,M)\leq C\dim M$ for every finite simple group $G$, every prime $p$ and every irreducible $F_p [G]$-module $M$.

math.GR↗
arXiv2007

Presentations of Finite Simple Groups: Profinite and Cohomological Approaches

We prove the following three closely related results. The first is that every finite simple group has a profinite presentation with 2 generators and at most 18 relations. The second is that if G is a finite simple group, F a field and M an FG-module, then the dimension of the second cohomology group of G with coefficients in M is at most 17.5 times the dimension of M. The third result is that we may replace 17.5 by 18.5 as long as M is faithful irreducible G-module. These last two results answer conjectures of Holt.

math.GR↗
arXiv2006

Cartesian products as profinite completions

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups under some natural restrictions.

math.GR↗
arXiv2005

Finite Simple Groups as Expanders

We prove that there exist $k\in N$ and $0<ε\in R$ such that every non-abelian finite simple group $G$, which is not a Suzuki group, has a set of $k$ generators for which the Cayley graph $\Cay(G; S)$ is an $ε$-expander.

math.GR↗
arXiv2005

Symmetric Groups and Expander Graphs

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times in the literature. These expanders have many applications in the theory of random walks on groups, card shuffling and other areas.

math.GR↗