2,134 reputation
825
bio website halgebra.math.msu.su/staff/…
location Moscow
age
visits member for 3 years, 1 month
seen 6 hours ago

20h
comment Group with finite outer automorphism group and large center
I added some details.
20h
revised Group with finite outer automorphism group and large center
added 980 characters in body
Jul
4
awarded  gr.group-theory
Jul
3
answered Group with finite outer automorphism group and large center
Jul
2
comment Group with finite outer automorphism group and large center
Yves, "transposition" should read contrgradient ($X\mapsto (X^t)^{-1}$). Also, $\mbox{Aut}(Z(G))$ should read $\mbox{Aut}(G/Z(G))$.
Jun
28
reviewed Approve What is deforming this non-complete intersection like?
Jun
2
awarded  Yearling
Feb
4
awarded  Announcer
Dec
9
reviewed Approve Local fractional Sobolev inequality
Dec
8
awarded  Civic Duty
Dec
7
reviewed Approve Is any connected fibre of a fibration of a sphere also a sphere?
Dec
6
comment Is the free abstract group residually of rank d > 2?
This rank was introduced by Malcev and is called special rank. Namely, The special rank of a group $G$ is the minimal $d$ such that every finitely generated subgroup of $G$ can be generated by $d$ elements.
Dec
4
comment Is the free abstract group residually of rank d > 2?
And why there are no such words $w(x,y)\in F_2$?
Dec
3
reviewed Approve Question regarding to approximate continuity
Dec
3
reviewed Reject Reference on representations of knot groups
Nov
30
reviewed Approve Topological K-theory for commutative C*-algebras
Nov
27
comment Realizing a monoid as $\mathrm{End}(G)$ for some graph $G$
Actually, their theorem states this under some cardinality constraints: gdz.sub.uni-goettingen.de/…
Nov
27
comment Realizing a monoid as $\mathrm{End}(G)$ for some graph $G$
Are loops allowed?
Nov
27
comment Powers of finite simple groups
Oh, I see: mathoverflow.net/a/53162/24165
Nov
23
comment Powers of finite simple groups
The automorphism groups of finite simple groups are well known. So, we have to calculate the (non-reduced) Euler function $\phi_n(G)$ (ie. the number of generating n-tuples). In Section 1.1, Collins describes a technique of such calculations that allowed Hall (in 1936) to calculate, e.g., $\phi_2(A_5)=19\cdot 120$ (ie. $h_2(A_5)=19$).