296 reputation
19
bio website saveitep.org
location Moscow, Russia
age 40
visits member for 3 years
seen Oct 24 at 18:05

Mathematician

http://ru.linkedin.com/pub/alexander-chervov/57/447/a93

http://mathoverflow.net/users/10446/alexander-chervov

http://arxiv.org/find/all/1/all:+chervov/0/1/0/all/0/1

http://saveitep.org
Started as A.A. Kirillov's student in rerpresentation theory in Moscow State University. Got PhD in 1999. Worked in ITEP Moscow for 10 years somewhere in between representation theory, integrable systems and algebraic geometry, in particular geometric Lanlgands and its connection to Hitchin-Gaudin integrable systems. Currently in industry: quantitative finance, previosly in wireless telecommunication doing applied math.: information theory, error-correcting codes, statistical estimation theory, numerical algorithms. Deeply worried about the ITEP very unfortunate situation: http://saveitep.org http://n-vetlitskaya.livejournal.com/241846.html Leading Russian research center is in danger. More than 850 scientists signed letter to president and prime-minister asking for help. Fields medalists M. Atiyah, L. Lafforgue, E. Witten, Nobel Prize winner D. Gross, mathematicians A. Beilinson, I. Cherednik, B. Dubrovin, P. Etingof, B. Feigin, A. Kirillov, I. Krichever, N. Reshetikhin, E. Vinberg, physicists J. Cardy (Oxford), M. Douglas, J. Froehlich, J. Maldacen (IAS), N. Nekrasov(IHES, ITEP), B. de Wit, are among them. You can join support letter here: https://sites.google.com/site/itep2012/english

Nature, 27.01.2012 , Geoff Brumfiel 'Russian physicists protest government consolidation' http://www.nature.com/news/russian-physicists-protest-government-consolidation-1.9921


Mar
31
awarded  Popular Question
Jun
30
comment Reference request for the law of the stopping time in the gambler's ruin problem
mathoverflow.net/questions/133399/… related
Jun
29
awarded  Yearling
Jan
1
comment What is the trellis diagram for a linear block code?
@JyrkiLahtonen Lahtonen Notifier: May I kindly ask you to look at mathoverflow.net/questions/117505/… PS Happy new year !
Dec
22
awarded  Announcer
Sep
26
comment Irreps of $S_3=GL(2,2)$. Who is cuspidal?
Let be a normal subgroup of a finite group . Let belonging to be a conjugacy class of elements in , and assume that belongs to . Prove that is a union of conjugacy classes in , all having the same cardinality, where equals the index of the group generated by and the centralizer in of and element belonging to . math.stackexchange.com/questions/5614/…
Sep
26
comment Irreps of $S_3=GL(2,2)$. Who is cuspidal?
math.stackexchange.com/questions/153381/… Estimates on conjugacy classes of a finite group. Theorem: Let A be a normal subgroup of G such that A is the centralizer of every non-trivial element in A. If further G/A is abelian, then G has |G:A| linear characters, and (|A|−1)/|G:A| non-linear irreducible characters of degree =|G:A| which vanish off A. math.stackexchange.com/questions/117500/…
Sep
26
comment Irreps of $S_3=GL(2,2)$. Who is cuspidal?
Side remark: Have a look at Weintraub - "Representation theory of finite group" in the section Mackey Machine math.stackexchange.com/questions/38571/… What is the relationship between Mackey's theorem in character theory and Mackey's theorem in transfer theory? math.stackexchange.com/questions/189430/…
Sep
15
comment Conjugacy classes in group extensions
Thank you !... .
Sep
11
comment Conjugacy classes in group extensions
May I ask you? Is more strong thing holds : preimage of conj class in G/N is not more than k(N) conj. classes ? Then inequality follows obviously, if we have G = N x G/N then it is of course so, for preimage "id" it is also of course so
Aug
15
comment Irreps of $S_3=GL(2,2)$. Who is cuspidal?
Thank you very much!
Aug
15
accepted Irreps of $S_3=GL(2,2)$. Who is cuspidal?
Aug
15
comment Kindle as a Tool for Mathematicians?
May I kindly ask you to look at my question: math.stackexchange.com/questions/182724/… this is notifier I will delete it later.
Aug
15
asked Irreps of $S_3=GL(2,2)$. Who is cuspidal?
Aug
13
comment Construction of representations
@PeteL.Clark What is the list of other examples known ? Where can I take it ? I am googling for quite a long, but do not see comprehensive answer :(
Aug
1
comment Voyager mission polynomials. Prove that for any $p(x)$ $|p(x)(1+x+x^3+x^4+x^6)|+|p(x)(1+x^3+x^4+x^5+x^6)|\geq10$, where $|\cdot|$ number of monoms
@DilipSarwate Thank you for yours comments ! Probably a part of my question is complicated and may be NP, but there is the following YES/NO sub-question: Is it true that Max_{f,g, deg = n} MinDist(f,g) > n ? I think yes, what is sharper bound ? may be n +log(n) or n+sqrt(n) ? What is known about it ?
Aug
1
comment Voyager mission polynomials. Prove that for any $p(x)$ $|p(x)(1+x+x^3+x^4+x^6)|+|p(x)(1+x^3+x^4+x^5+x^6)|\geq10$, where $|\cdot|$ number of monoms
@DilipSarwate Thank you for yours comment. May be you right, exercise a bad word, may be complicated puzzle is better... What is not quite clear for me about "no easy answers or proofs, and no useful bounds " is that - is it known that any bound will be complicated or just this is open problem to find good bound ? E.g. may I ask you to look at mathoverflow.net/questions/103497/… any comments are welcome !
Aug
1
comment Voyager mission polynomials. Prove that for any $p(x)$ $|p(x)(1+x+x^3+x^4+x^6)|+|p(x)(1+x^3+x^4+x^5+x^6)|\geq10$, where $|\cdot|$ number of monoms
@joriki Thank you ! It is more clear now.
Aug
1
comment Voyager mission polynomials. Prove that for any $p(x)$ $|p(x)(1+x+x^3+x^4+x^6)|+|p(x)(1+x^3+x^4+x^5+x^6)|\geq10$, where $|\cdot|$ number of monoms
@joriki so do you mean that you do not a'priori know that you alg. will stop at finite time ? "The search tree only has leaves, at a maximal depth of " is this outcome of algorithm or you know this a'priory ?
Aug
1
comment Voyager mission polynomials. Prove that for any $p(x)$ $|p(x)(1+x+x^3+x^4+x^6)|+|p(x)(1+x^3+x^4+x^5+x^6)|\geq10$, where $|\cdot|$ number of monoms
Thank you for answer ! No need for excuse any idea is welcome. But I do not quite understand. How do you restrict the search to finite number ? What means "We can then search the decision tree of coefficients of increasing powers; each decision about a... " . Please can you comment that your method will NOT work in case we ask same question about only "f" or "g" , I mean there exists p: |pf|<|f|.