Saint Petersburg, 199178, Russia, Line 14th (Vasilyevsky Island), 29
(812) 363-68-71, (812) 363-68-72
ru en

Публикации студентов

  1. Monakov, G. V.; Tikhomirov, S. B.; Yakovlev, A. A.; Displacement of Viscous Fluids in a Set of Parallel Pipes. Comput. Math. Math. Phys. 60 (2020), no. 3, 484–497.
  2. Enin, A.; Perstneva, P.; Tikhomirov, S.; Periodic solutions of parabolic equations with hysteresis in dimension 1. (Russian) Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 489 (2020), Kraevye Zadachi Matematicheskoĭ Fiziki i Smezhnye Voprosy Teorii Funktsiĭ. 48, 36–54.
  3. Y. Alekseev, D. Grigoriev, E. A. Hirsch, I. Tzameret. Semi-Algebraic Proofs, IPS Lower Bounds and the \tau-Conjecture: Can a
    Natural Number be Negative? Proceedings of STOC-2020, pp.54-67.
  4. Danil Akhtiamov, Homologies of inverse limits of groups, preprint.
  5. Danil Akhtiamov, Sergei O. Ivanov, Fedor Pavutnitskiy, Right exact localizations of groups.
  6. Ivan Bochkov, Alex Davydow, Nikita Gaevoy, Sergey I. Nikolenko, New Competitiveness Bounds for the Shared Memory Switch.
  7. Ivan Bochkov, Polynomial birth–death processes and the second conjecture of Valent, to appear in International Mathematic Research Notices.
  8. I. Bochkov, F. V. Petrov, The bounds for the number of linear extensions via chain and antichain coverings.
  9. Евтушевский В. Ю., Перечисление путей в графе Юнга—Фибоначчи. «Записки научных семинаров ПОМИ, том 481 «Теория представлений, динамические системы, комбинаторные методы. XXX», стр. 39-62.
  10. Elena Arseneva, John Iacono, Greg Koumoutsos, Stefan Langerman, Boris Zolotov, Sublinear Explicit Incremental Planar Voronoi Diagrams, In proceedings of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games, September 2019
  11. Elena Arseneva, Stefan Langerman, Boris Zolotov, A complete list of all convex polyhedra made by gluing regular pentagons, In proceedings of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games, September 2019
  12. Yurii Belov, Alexander Borichev, Alexander Kuznetsov, Upper and lower densities of Gabor Gaussian Systems, to appear in Applied and Computational Harmonic Analysis
  13. A. Kulikov, A contractive Hardy-Littlewood inequality.
  14. A. Kulikov, On the Heins theorem, to appear in Studia Mathematica.
  15.  A. Kulikov, Fourier interpolation and time-frequency localization.
  16. Ilya Losev, Jacobi matrices with lacunary spectrum.
  17. V. Makarov, A. Okhotin, On the expressive power of GF(2)-grammars, SOFSEM 2019: Theory and Practice of Computer Science (Novy Smokovec, Slovakia, 27-30 January 2019), LNCS 11376, 310-323.
  18. N. Vavilov, P. Gvozdevsky, D. Mamaev, Recent results on intermediate subgroups of classical groups, Proceedings of the 4BIGTC2017, pp. 44–46.
  19. D. Mamaev, Oriented Area as a Morse Function on Polygon Spaces, Ars Mathematica Contemporanea, vol. 19, No 1 (2020), 155–171
  20.  A. Nordskova, Y.Volkov, Faithful actions of braid groups by twists along ADE-configurations of spherical objects.
  21. S. V. Kislyakov, P. S. Perstneva, Indicator functions with uniformly bounded Fourier sums and large gaps in the spectrum.
  22. Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, Bounded-depth Frege complexity of Tseitin formulas for all graphs, MFCS 2019: 49:1–49:15
  23. F. Petrov, A. Tarasov, Uniqueness of a three-dimensional ellipsoid with given intrinsic volumes, Arnold Math. J. 6 (2), 163-171. (2020)
  24. Tatiana Moseeva, Alexander Tarasov, Dmitry Zaporozhets, Random sections of spherical convex bodies.
  25. Н. Филонов, П. А. Ходунов, Неединственность решения Лерэ–Хопфа для диадической модели, Алгебра и анализ, 32:2 (2020), 229–253
  26. Daniel Lenz, Timon Weinmann, Melchior Wirth, Self-Adjoint Extensions of Bipartite Hamiltonians together with Daniel Lenz and Melchior Wirth.
  27. E. Bakinova, A. Basharin, I. Batmanov, K. Lyubort, A. Okhotin, E. Sazhneva, Formal languages over GF(2), Language and Automata Theory and Applications (LATA 2018, Bar-Ilan near Tel Aviv, Israel, 9-11 April 2018), LNCS 10792, 68-79.
  28. A. Okhotin, E. Sazhneva, State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages, Descriptional Complexity of Formal Systems (DCFS 2019, Kosice, Slovakia, 17—19 July 2019), LNCS 11612, 248—259.
  29. E. Dobronravov, N. Dobronravov, A. Okhotin, On the length of shortest strings accepted by two-way finite automata, Developments in Language Theory, (DLT 2019, Warsaw, Poland, 5—9 August 2019), LNCS 11647, 88—99.
  30. A. Okhotin, I. Olkhovsky, On the transformation of LL(k)-linear grammars to LL(1)-linear, Computer Science in Russia (CSR 2020, Ekaterinburg, Russia, 29 June—3 July 2020), LNCS 12159, 328—340.
  31. Tatiana Moseeva, Distribution of the Volume of Weighted Gaussian Simplex.
  32. Youri Davydov, Svyatoslav Novikov, Remarks on asymptotic independence.
  33. Alekseev, I., Magdiev R., The language of geodesics for the discrete Heisenberg group.
  34. Alekseev, I., & Mamedov, G., On minimal crossing number braid diagrams and homogeneous braids.
  35. Dementiev Y., Ignatiev A., Sidelnik V., Smal A., Ushakov M. (2021) New Bounds on the Half-Duplex Communication Complexity. In: Bureš T. et al. (eds) SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science, vol 12607. Springer, Cham.
  36. M. I. Belishev, N. D. Filonov, S. T. Krymskiy & A. F. Vakulenko (2020) On uniqueness of continuation for polynomials of solutions to second-order elliptic PDE, Applicable Analysis, DOI: 10.1080/00036811.2019.1703959
  37. Krymski S., Okhotin A. (2020) Longer Shortest Strings in Two-Way Finite Automata. In: Jirásková G., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2020. Lecture Notes in Computer Science, vol 12442. Springer, Cham. https://doi.org/10.1007/978-3-030-62536-8_9
  38. Stanislav Krymski, Michael Levitin, Leonid Parnovski, Iosif Polterovich, David A Sher, Inverse Steklov Spectral Problem for Curvilinear Polygons, International Mathematics Research Notices, Volume 2021, Issue 1, January 2021, Pages 1–37, https://doi.org/10.1093/imrn/rnaa200
  39. G. Veprev, «Non-existence of a universal zero entropy system for non-periodic amenable group actions», preprint
  40. G. Veprev, “Scaling entropy of unstable systems”, Зап. научн. сем. ПОМИ, 498 (2020), 5–17
  41. Veprev, G.A. Estimating the Asymptotic Behavior of the Entropy of an Invariant Sequence of Partitions of the Infinite-Dimensional Cube. J Math Sci 247, 641–645 (2020). https://doi.org/10.1007/s10958-020-04826-w
  42. Ilya Alekseev, «New classes of minimal knot diagrams», preprint
  43. K. V. Chelpanov, «Alternative proof of upper bound of spanning trees in a graph», preprint
  44. Востоков С.В., Шашков Т.Ю., Афанасьева С.С. Интеграл Шнирельмана и аналог интегральной теоремы Коши для двумерных локальных полей. Чебышевский сборник. 2020;21(3):39-58. https://doi.org/0.22405/2226-8383-2020-21-3-39-58
  45. Anastasia Sofronova, Dmitry Sokolov, «Branching Programs with Bounded Repetitions and Flow Formulas», preprint
  46. Заляпин, В.И., Шалгин В.С. Метод интегральных уравнений для векторной обратной задачи / Вестник Южно-Уральского государственного университета. Серия «Математика. Механика. Физика». 2020, Т. 12, № 4, С. 19–27. http://dx.doi.org/10.14529/mmph200402
  47. М. П. Иванов, «Точная оценка на количество правильных 3-раскрасок рёбер связного кубического графа», Зап. научн. сем. ПОМИ, 497 (2020), стр. 26-52
  48. Tatiana Belova, Ivan Bliznets, Algorithms for (n,3)-MAXSAT and parameterization above the all-true assignment, Theoretical Computer Science, Volume 803, 2020, Pages 222-233. https://doi.org/10.1016/j.tcs.2019.11.033
  49. Блинова Д. И., Лифшиц М. А., Энергия натянутых струн, сопровождающих винеровский процесс, и случайное блуждание в полосе переменной ширины. «Записки научных семинаров ПОМИ, том 495 «Вероятность и статистика. 29», стр. 64-86.
  50. Mrykhin M., Okhotin A. (2021) On Hardest Languages for One-Dimensional Cellular Automata. In: Leporati A., Martín-Vide C., Shapira D., Zandron C. (eds) Language and Automata Theory and Applications. LATA 2021. Lecture Notes in Computer Science, vol 12638. Springer, Cham. https://doi.org/10.1007/978-3-030-68195-1_10
  51. Mikhail Mrykhin, Alexander Okhotin, The hardest language for grammars with context operators, preprint
  52. Olga Martynova, Alexander Okhotin, «Lower bounds for graph-walking automata», 38th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2021, 16—19 March 2021), LIPIcs 187, 52:1—52:13. https://doi.org/10.4230/LIPIcs.STACS.2021.52
  53. Yaroslav Alekseev. «A Lower Bound for Polynomial Calculus with Extension Rule», preprint 
  54. Ю. С. Белоусов, М. В. Карев, А. В. Малютин, А. Ю. Миллер, Е. А. Фоминых, “Лернейские узлы и вложенные перестройки”, Алгебра и анализ, 33:1 (2021), 30–66