U.S. vs. Russian Math: Two Views

Science News ◽  
1980 ◽  
Vol 118 (3) ◽  
pp. 35
Author(s):  
David Phoebus ◽  
L. F. Goeller Jr.
Keyword(s):  
Russian Math

scholarly journals Realization of analytic moduli for parabolic Dulac germs

2021 ◽  
pp. 1-55
Author(s):  
PAVAO MARDEŠIĆ ◽  
MAJA RESMAN
Keyword(s):  
Return Maps ◽  
Analytic Classification ◽  
First Return Maps ◽  
Russian Math

Abstract In a previous paper [P. Mardešić and M. Resman. Analytic moduli for parabolic Dulac germs. Russian Math. Surveys, to appear, 2021, arXiv:1910.06129v2.] we determined analytic invariants, that is, moduli of analytic classification, for parabolic generalized Dulac germs. This class contains parabolic Dulac (almost regular) germs, which appear as first-return maps of hyperbolic polycycles. Here we solve the problem of realization of these moduli.

Some properties of an odd-dimensional space

2020 ◽  
Vol 27 (2) ◽  
pp. 321-330
Author(s):  
Vakhtang Tsagareishvili
Keyword(s):  
Fourier Series ◽  
Absolute Convergence ◽  
Dimensional Space ◽  
Multiple Fourier Series ◽  
Partial Derivatives ◽  
Several Variables ◽  
The Absolute ◽  
Series Of Functions ◽  
Russian Math

AbstractIn this paper, we investigate the absolute convergence of Fourier series of functions in several variables for an odd-dimensional space when these functions have continuous partial derivatives. It should be noted that similar properties for an even-dimensional space were given in [L. D. Gogoladze and V. S. Tsagareishvili, On absolute convergence of multiple Fourier series (in Russian), Izv. Vyssh. Uchebn. Zaved. Mat. 2015, 9, 12–21; translation in Russian Math. (Iz. VUZ) 59 (2015), no. 9, 9–17]. The obtained results are the best possible in a certain sense.

scholarly journals Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves

2014 ◽  
Vol 23 (05) ◽  
pp. 1450023
Author(s):  
Tatsuo Ando ◽  
Chuichiro Hayashi ◽  
Yuki Nishikawa
Keyword(s):  
Upper Bound ◽  
Knot Theory ◽  
Finite Sequence ◽  
Reidemeister Moves ◽  
Recognition Algorithms ◽  
Russian Math

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by Dynnikov in [Arc-presentations of links: Monotone simplification, Fund. Math. 190 (2006) 29–76; Recognition algorithms in knot theory, Uspekhi Mat. Nauk 58 (2003) 45–92. Translation in Russian Math. Surveys 58 (2003) 1093–1139]. Using this, Henrich and Kauffman gave in [Unknotting unknots, preprint (2011), arXiv:1006.4176v4 [math.GT]] an upper bound for the number of Reidemeister moves needed for unknotting a knot diagram of the trivial knot. However, exchange or merge moves on the top and bottom pairs of edges of rectangular diagrams are not considered in [Unknotting unknots, preprint (2011), arXiv:1006.4176v4 [math.GT]]. In this paper, we show that there is a rectangular diagram of the trivial knot which needs such an exchange move for being unknotted, and study upper bound of the number of Reidemeister moves needed for realizing such an exchange or merge move.

Sign in / Sign up

Export Citation Format

Share Document