610:. The only question was to find the right methods for proving it. As later developments showed, this belief was too naive. This just demonstrates that before their work nobody even came close to imagining the nature of the free Burnside group, or the extent to which subtle structures inevitably arose in any serious attempt to investigate it. In fact, there were no methods for proving inequalities in groups given by identities of the form
66:
168:
25:
680:
The solution of the
Burnside problem was certainly one of the most outstanding and deep mathematical results of the past century. At the same time, this result is one of the hardest theorems: just the inductive step of a complicated induction used in the proof took up a whole issue of volume 32 of
684:
In contrast to the Adian–Rabin theorem, the paper of Adian and
Novikov in no way ‘closed’ the Burnside problem. Moreover, over a long period of more than ten years Adian continued to improve and simplify the method they had created and also to adapt the method for solving some other fundamental
681:
Izvestiya, even lengthened by 30 pages. In many respects the work was literally carried to its conclusion by the exceptional persistence of Adian. In that regard it is worth recalling the words of
Novikov, who said that he had never met a mathematician more ‘penetrating’ than Adian.
535:
in number theory, Burnside’s problem has acted as a catalyst for research in group theory. The fascination exerted by a problem with an extremely simple formulation which then turns out to be extremely difficult has something irresistible about it to the mind of the mathematician.
688:
By the beginning of the 1980s, when other contributors appeared who mastered the
Novikov–Adian method, the theory already represented a powerful method for constructing and investigating new groups (both periodic and non-periodic) with interesting properties prescribed.
651:, Adian settled down to work on the Burnside problem. Completing the project took intensive efforts from both collaborators in the course of eight years, and in 1968 their famous paper appeared, containing a negative solution of the problem for all odd periods
646:
An approach to solving the problem in the negative was first outlined by P. S. Novikov in his note, which appeared in 1959. However, the concrete realization of his ideas encountered serious difficulties, and in 1960, at the insistence of
Novikov and his wife
515:. What distinguishes the first published work by Adian, is its completeness. In spite of numerous attempts, nobody has added anything fundamentally new to the results during the past 50 years. Adian's result was immediately used by
455:
and having discontinuities is dense in the plane. (Clearly, all continuous solutions of the equation are linear functions.) This result was not published at the time. About 25 years later the
American mathematician
467:
By the beginning of 1955, Adian had managed to prove the undecidability of practically all non-trivial invariant group properties, including the undecidability of being isomorphic to a fixed group
826:
588:
453:
796:
675:
641:
464:
gave preprints of some of his papers to Adian during a visit to MSU, one of which was devoted to exactly the same result, which was published by Hewitt much later.
388:
608:
505:
485:
781:
511:
thesis and his first published work. This is one of the most remarkable, beautiful, and general results in algorithmic group theory and is now known as the
801:
178:
816:
811:
262:
149:
52:
519:
in his proof of the algorithmic unsolvability of the classical problem of deciding when topological manifolds are homeomorphic.
791:
806:
732:
193:
87:
236:
130:
756:
83:
38:
208:
102:
821:
215:
109:
76:
831:
786:
461:
532:
512:
222:
116:
307:
204:
98:
590:
and the matrix groups. However, this did not hinder the belief in an affirmative answer for any period
315:
543:
393:
776:
771:
736:
350:
654:
516:
327:
283:
44:
613:
540:
Before the work of
Novikov and Adian an affirmative answer to the problem was known only for
648:
291:
364:
229:
123:
593:
490:
470:
765:
346:
457:
311:
361:
In his first work as a student in 1950, Adian proved that the graph of a function
342:
167:
65:
727:
752:
331:
335:
303:
742:
339:
508:
185:
705:
299:
161:
59:
18:
677:, and hence for all multiples of those odd integers as well.
746:
349:. He worked at Moscow State University (MSU) since 1965.
747:
2006 Moscow
Symposium on Logic, Algebra and Computation
189:
390:
of a real variable satisfying the functional equation
657:
616:
596:
546:
493:
473:
396:
367:
90:. Unsourced material may be challenged and removed.
731:– an article by L. D. Beklemishev, I. G. Lysenok,
669:
635:
602:
582:
499:
479:
447:
382:
827:Full Members of the Russian Academy of Sciences
8:
577:
553:
194:introducing citations to additional sources
53:Learn how and when to remove these messages
797:Academic staff of Moscow State University
656:
621:
615:
595:
545:
492:
472:
395:
366:
306:mathematician. He was a professor at the
263:Learn how and when to remove this message
150:Learn how and when to remove this message
184:Relevant discussion may be found on the
698:
298:; 1 January 1931 – 5 May 2020), was a
7:
88:adding citations to reliable sources
782:21st-century Russian mathematicians
743:Dedicated to Adian Sergei Ivanovich
739:, A. L. Semenov and V. A. Uspensky.
14:
802:Scientists from Ganja, Azerbaijan
34:This article has multiple issues.
16:Russian mathematician (1931–2020)
583:{\displaystyle n\in \{2,3,4,6\}}
507:. These results constituted his
448:{\displaystyle f(x+y)=f(x)+f(y)}
177:relies largely or entirely on a
166:
64:
23:
75:needs additional citations for
42:or discuss these issues on the
706:Скончался Сергей Иванович Адян
442:
436:
427:
421:
412:
400:
377:
371:
310:and was known for his work in
1:
757:Mathematics Genealogy Project
527:About the Burnside problem:
345:institutes. His advisor was
848:
817:Ethnic Armenian scientists
685:problems in group theory.
812:Ethnic Armenian academics
670:{\displaystyle n>4381}
353:was one of his students.
330:. He grew up there in an
295:
287:
462:University of Washington
636:{\displaystyle X^{n}=1}
308:Moscow State University
296:Серге́й Ива́нович Адя́н
792:Mathematical logicians
671:
637:
604:
584:
538:
501:
481:
449:
384:
334:family. He studied at
276:Sergei Ivanovich Adian
807:Soviet mathematicians
672:
638:
605:
585:
533:Fermat's Last Theorem
529:
502:
482:
450:
385:
288:Սերգեյ Իվանովիչ Ադյան
655:
614:
594:
544:
491:
471:
394:
383:{\displaystyle f(x)}
365:
326:Adian was born near
314:, especially on the
190:improve this article
84:improve this article
822:Armenian scientists
513:Adian–Rabin theorem
357:Mathematical career
667:
633:
600:
580:
497:
477:
445:
380:
351:Alexander Razborov
603:{\displaystyle n}
517:Andrey Markov Jr.
500:{\displaystyle G}
480:{\displaystyle G}
273:
272:
265:
255:
254:
240:
160:
159:
152:
134:
57:
839:
832:Soviet Armenians
735:, M. R. Pentus,
728:On 75th birthday
725:
711:
710:
703:
676:
674:
673:
668:
649:Lyudmila Keldysh
642:
640:
639:
634:
626:
625:
609:
607:
606:
601:
589:
587:
586:
581:
523:Burnside problem
506:
504:
503:
498:
487:, for any group
486:
484:
483:
478:
454:
452:
451:
446:
389:
387:
386:
381:
316:Burnside problem
297:
289:
268:
261:
250:
247:
241:
239:
198:
170:
162:
155:
148:
144:
141:
135:
133:
92:
68:
60:
49:
27:
26:
19:
847:
846:
842:
841:
840:
838:
837:
836:
787:Group theorists
762:
761:
723:
720:
715:
714:
708:
704:
700:
695:
653:
652:
617:
612:
611:
592:
591:
542:
541:
531:Very much like
525:
489:
488:
469:
468:
392:
391:
363:
362:
359:
324:
269:
258:
257:
256:
251:
245:
242:
199:
197:
183:
171:
156:
145:
139:
136:
93:
91:
81:
69:
28:
24:
17:
12:
11:
5:
845:
843:
835:
834:
829:
824:
819:
814:
809:
804:
799:
794:
789:
784:
779:
774:
764:
763:
760:
759:
750:
740:
737:A. A. Razborov
719:
718:External links
716:
713:
712:
697:
696:
694:
691:
666:
663:
660:
632:
629:
624:
620:
599:
579:
576:
573:
570:
567:
564:
561:
558:
555:
552:
549:
524:
521:
496:
476:
444:
441:
438:
435:
432:
429:
426:
423:
420:
417:
414:
411:
408:
405:
402:
399:
379:
376:
373:
370:
358:
355:
323:
320:
271:
270:
253:
252:
205:"Sergei Adian"
188:. Please help
174:
172:
165:
158:
157:
99:"Sergei Adian"
72:
70:
63:
58:
32:
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
844:
833:
830:
828:
825:
823:
820:
818:
815:
813:
810:
808:
805:
803:
800:
798:
795:
793:
790:
788:
785:
783:
780:
778:
775:
773:
770:
769:
767:
758:
754:
751:
748:
744:
741:
738:
734:
733:S. P. Novikov
730:
729:
722:
721:
717:
707:
702:
699:
692:
690:
686:
682:
678:
664:
661:
658:
650:
644:
630:
627:
622:
618:
597:
574:
571:
568:
565:
562:
559:
556:
550:
547:
537:
534:
528:
522:
520:
518:
514:
510:
494:
474:
465:
463:
459:
439:
433:
430:
424:
418:
415:
409:
406:
403:
397:
374:
368:
356:
354:
352:
348:
347:Pyotr Novikov
344:
341:
337:
333:
329:
321:
319:
317:
313:
309:
305:
301:
293:
285:
281:
277:
267:
264:
249:
238:
235:
231:
228:
224:
221:
217:
214:
210:
207: –
206:
202:
201:Find sources:
195:
191:
187:
181:
180:
179:single source
175:This article
173:
169:
164:
163:
154:
151:
143:
132:
129:
125:
122:
118:
115:
111:
108:
104:
101: –
100:
96:
95:Find sources:
89:
85:
79:
78:
73:This article
71:
67:
62:
61:
56:
54:
47:
46:
41:
40:
35:
30:
21:
20:
753:Sergei Adian
726:
724:(in Russian)
709:(in Russian)
701:
687:
683:
679:
645:
539:
530:
526:
466:
458:Edwin Hewitt
360:
325:
312:group theory
279:
275:
274:
259:
243:
233:
226:
219:
212:
200:
176:
146:
137:
127:
120:
113:
106:
94:
82:Please help
77:verification
74:
50:
43:
37:
36:Please help
33:
777:2020 deaths
772:1931 births
343:pedagogical
328:Elizavetpol
766:Categories
693:References
216:newspapers
110:newspapers
39:improve it
551:∈
460:from the
322:Biography
186:talk page
45:talk page
332:Armenian
304:Armenian
284:Armenian
246:May 2020
140:May 2020
755:at the
336:Yerevan
292:Russian
278:, also
230:scholar
124:scholar
340:Moscow
300:Soviet
232:
225:
218:
211:
203:
126:
119:
112:
105:
97:
509:Ph.D.
280:Adyan
237:JSTOR
223:books
131:JSTOR
117:books
665:4381
662:>
338:and
302:and
209:news
103:news
745:in
192:by
86:by
768::
643:.
318:.
294::
290:;
286::
48:.
749:.
659:n
631:1
628:=
623:n
619:X
598:n
578:}
575:6
572:,
569:4
566:,
563:3
560:,
557:2
554:{
548:n
495:G
475:G
443:)
440:y
437:(
434:f
431:+
428:)
425:x
422:(
419:f
416:=
413:)
410:y
407:+
404:x
401:(
398:f
378:)
375:x
372:(
369:f
282:(
266:)
260:(
248:)
244:(
234:·
227:·
220:·
213:·
196:.
182:.
153:)
147:(
142:)
138:(
128:·
121:·
114:·
107:·
80:.
55:)
51:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
