Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
Tome 14 (2021)
no. 5
Précédent
Suivant
Volume 14 (2021) no. 5
Sommaire
On some decompositions of matrices over algebraically closed and finite fields
Peter Danchev
p. 547-553
Energy method for the elliptic boundary value problems with asymmetric operators in a spherical layer
Valery V. Denisenko
;
Semen A. Nesterov
p. 554-565
On reductants of two groups
Dmitry P. Fedchenko
;
Vitaly A. Stepanenko
;
Rustam V. Bikmurzin
;
Victoria V. Isaeva
p. 566-572
On estimation of the convergence rate to invariant measures in Markov branching processes with possibly infinite variance and immigration
Azam A. Imomov
p. 573-583
Iterations and groups of formal transformations
Oleg V. Kaptsov
p. 584-588
Laurent-Hua Loo-Keng series with respect to the matrix ball from space
${{\mathbb{C}}^{n}}\left[ m\times m \right]$
Gulmirza Kh. Khudayberganov
;
Jonibek Sh. Abdullayev
p. 589-598
On the zeta-function of zeros of an entire function
Vyacheslav I. Kuzovatov
;
Alexander M. Kytmanov
;
Azimbai Sadullaev
p. 599-603
On pairs of additive subgroups associated with intermediate subgroups of groups of Lie type over nonperfect fields
Yakov N. Nuzhin
p. 604-610
Features in the resonance behavior of magnetization in arrays of triangular and square nanodots
Vitaly A. Orlov
;
Roman Yu. Rudenko
;
Vladimir S. Prokopenko
;
Irina N. Orlova
p. 611-623
A list of integral representations for diagonals of power series of rational functions
Artem V. Senashov
p. 624-631
Modeling of anisotropy dynamics of the proton pitch angle distribution in the Earth's magnetosphere
Sergei V. Smolin
p. 632-637
On problem of finding all maximal induced bicliques of hypergraph
Aleksandr A. Soldatenko
;
Daria V. Semenova
p. 638-646
Connecting homomorphism and separating cycles
Roman V. Ulvert
p. 647-658
On an inverse problem for a stationary equation with boundary condition of the third kind
Alexander V. Velisevich
p. 659-666
Satisfiability in Boolean logic (SAT problem) is polynomial
Vladimir V. Rybakov
p. 667-671