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

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

2017

  1. Nikolai Vavilov, Pavel Gvozdevsky, Daniil Mamaev, Recent results on intermediate subgroups of classical groups. 4th Biennial International Group Theory Conference 2017(4BIGTC2017) January. 23-26 (2017), pp. 44-46. UTM Kuala Lampur, Malaysia [full text]

2018

  1. Bakinova E., Basharin A., Batmanov I., Lyubort K., Okhotin A., Sazhneva E. (2018) Formal Languages over GF(2). In: Klein S., Martín-Vide C., Shapira D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science, vol 10792. Springer, Cham.

2019

  1. 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 [full text]
  2. 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 [full text]
  3. Dobronravov E., Dobronravov N., Okhotin A. (2019) On the Length of Shortest Strings Accepted by Two-Way Finite Automata. In: Hofman P., Skrzypczak M. (eds) Developments in Language Theory. DLT 2019. Lecture Notes in Computer Science, vol 11647. Springer, Cham. 
  4. Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, Bounded-depth Frege complexity of Tseitin formulas for all graphs, MFCS 2019: 49:1–49:15 
  5. Makarov, V., & Okhotin, A. (2019). On the expressive power of GF(2)-grammars. В R. Královič, G. Pighizzini, J. Nawrocki, & B. Catania (Ред.), SOFSEM 2019: Theory and Practice of Computer Science — 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (стр. 310-323). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11376 LNCS). 
  6. Okhotin A., Sazhneva E. (2019) State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. In: Hospodár M., Jirásková G., Konstantinidis S. (eds) Descriptional Complexity of Formal Systems. DCFS 2019. Lecture Notes in Computer Science, vol 11612. Springer, Cham. 
  7. В. Ю. Евтушевский, “Перечисление путей в графе Юнга–Фибоначчи”, Теория представлений, динамические системы, комбинаторные и алгоритмические методы. XXX, Зап. научн. сем. ПОМИ, 481, ПОМИ, СПб., 2019, 39–62 

2020

  1. Y. Alekseev, D. Grigoriev, E. A. Hirsch, I. Tzameret. STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. June 2020. Pages 54–67. 
  2. 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. 
  3. Yurii Belov, Alexander Borichev, Alexander Kuznetsov, Upper and lower densities of Gabor Gaussian systems, Applied and Computational Harmonic Analysis, Volume 49, Issue 2, 2020, Pages 438-450 
  4. 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
  5. Блинова Д.И., Лифшиц М.А. Энергия натянутых струн, сопровождающих винеровский процесс
    и случайное блуждание в полосе переменной ширины. Зап.научн. семин. ПОМИ, 2020, 495, 64-86
  6. Ivan Bochkov, Polynomial Birth–Death Processes and the 2nd Conjecture of Valent, International Mathematics Research Notices, 2020;, rnz346 
  7. Bochkov, I.A., Petrov, F.V. The Bounds for the Number of Linear Extensions Via Chain and Antichain Coverings. Order (2020).
  8. A. Enin, P. Perstneva, S. Tikhomirov, “Periodic solutions of parabolic equations with hysteresis in the dimension 1”, Boundary-value problems of mathematical physics and related problems of function theory. Part 48, Zap. Nauchn. Sem. POMI, 489, POMI, St. Petersburg, 2020, 36–54 
  9. 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. 
  10. Aleksei Kulikov, On the Heins theorem. Studia Mathematica 252 (2020), 299-310 
  11. D. Mamaev, Oriented Area as a Morse Function on Polygon Spaces, Ars Mathematica Contemporanea, vol. 19, No 1 (2020), 155–171  arXiv: 2001.02707 
  12. Monakov, G.V., Tikhomirov, S.B. & Yakovlev, A.A. Displacement of Viscous Fluids in a Set of Parallel Pipes. Comput. Math. and Math. Phys. 60, 484–497 (2020).
  13. T. D. Moseeva, “Distribution of the volume of weighted Gaussian simplex”, Probability and statistics. Part 29, Zap. Nauchn. Sem. POMI, 495, POMI, St. Petersburg, 2020, 187–197.  arXiv: 2007.07208  
  14. Mikhail Mrykhin, Alexander Okhotin, The hardest language for grammars with context operators,  arXiv: 2012.03596
  15. Okhotin A., Olkhovsky I. (2020) On the Transformation of LL(k)-linear Grammars to LL(1)-linear. In: Fernau H. (eds) Computer Science – Theory and Applications. CSR 2020. Lecture Notes in Computer Science, vol 12159. Springer, Cham. 
  16. Yaroslav Alekseev. «A Lower Bound for Polynomial Calculus with Extension Rule»,  arXiv: 2010.05660
  17. Petrov, F., Tarasov, A. Uniqueness of a Three-Dimensional Ellipsoid with Given Intrinsic Volumes. Arnold Math J. 6, 163–171 (2020). 
  18. 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).  
  19. G. Veprev, «Non-existence of a universal zero entropy system for non-periodic amenable group actions», arXiv: 2010.09806
  20. G. Veprev, “Scaling entropy of unstable systems”, Зап. научн. сем. ПОМИ, 498 (2020), 5–17
  21. Д. И. Блинова, М. А. Лифшиц, “Энергия натянутых струн, сопровождающих винеровский процесс и случайное блуждание в полосе переменной ширины”, Вероятность и статистика. 29, Зап. научн. сем. ПОМИ, 495, ПОМИ, СПб., 2020, 64–86 
  22. Востоков С.В., Шашков Т.Ю., Афанасьева С.С. Интеграл Шнирельмана и аналог интегральной теоремы Коши для двумерных локальных полей. Чебышевский сборник. 2020;21(3):39-58. 
  23. Заляпин, В.И., Шалгин В.С. Метод интегральных уравнений для векторной обратной задачи / Вестник Южно-Уральского государственного университета. Серия «Математика. Механика. Физика». 2020, Т. 12, № 4, С. 19–27. 
  24. М. П. Иванов, «Точная оценка на количество правильных 3-раскрасок рёбер связного кубического графа», Зап. научн. сем. ПОМИ, 497 (2020), стр. 26-52
  25. Н. А. Кароль, «Критерий наличия такого цикла, что множество не входящих в него вершин независимо», Зап. научн. сем. ПОМИ, 497,,стр. 53-79, 2020
  26. С. М. Новиков, “Новые результаты об асимптотической независимости случайных элементов”, Вероятность и статистика. 29, Зап. научн. сем. ПОМИ, 495, ПОМИ, СПб., 2020, 209–236 

2021

  1. Akhtiamov, D., Ivanov, S.O. & Pavutnitskiy, F. Right exact localizations of groups. Isr. J. Math. (2021). 
  2. Yaroslav Alekseev, A Lower Bound for Polynomial Calculus with Extension Rule. 36th Computational Complexity Conference (CCC 2021). Article No. 21; pp. 21:1–21:18 
  3. Gubkin, P. Mate–Nevai–Totik Theorem for Krein Systems. Integr. Equ. Oper. Theory 93, 33 (2021). 
  4. 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. 
  5. Карагодин Н.А., Лифшиц М.А. О распределении времени окончательного ухода гауссовского процесса
    под медленно растущую линейную границу. Теория вероятностей и её применения, 2021, 66, No.3, 2021, 419—432.
  6. Kislyakov, S.V., Perstneva, P.S. Indicator Functions with Uniformly Bounded Fourier Sums and Large Gaps in the Spectrum. J Fourier Anal Appl 27, 33 (2021).  arXiv: 2006.02561 
  7. Kulikov, A. (2021), A contractive Hardy–Littlewood inequality. Bull. London Math. Soc. 
  8. 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. 
  9. Ilya Kachkovskiy, Stanislav Krymski2, Leonid Parnovski and Roman Shterenberg. Perturbative diagonalization for Maryland-type quasiperiodic operators with flat pieces. J. Math. Phys. 62, 063509 (2021); 
  10. Ilya Losev, Jacobi matrices with lacunary spectrum, Journal of Mathematical Analysis and Applications, Volume 503, Issue 1, 2021, 125300. 
  11. Sergey Luchinin, Svetlana Puzynina, Symmetry Groups of Infinite Words, DLT conference 2021  [full text]
  12. Makarov V. (2021) «Bounded Languages Described by GF(2)-grammars». Nelma Moreira, Rogerio Reis, «Developments in Language Theory — 25th International Conference, DLT 2021 Proceedings» Porto, Portugal, August 16—20, 2021. Lecture Notes in Computer Science, LNCS 12811, 279—290
  13. Makarov V. (2021) Counting Ternary Square-Free Words Quickly. In: Lecroq T., Puzynina S. (eds) Combinatorics on Words. WORDS 2021. Lecture Notes in Computer Science, vol 12847. Springer, Cham.  
  14. 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. 
  15. 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. 
  16. Y. A. Davydov, S.M.Novikov. Remarks in asymptotic independence. Theory of Probability and its Applications, 2021, 66, 1, 44-57 
  17. Petrov S., Okhotin A. (2021) On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite 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.  
  18. Anastasia Sofronova, Dmitry Sokolov, «Branching Programs with Bounded Repetitions and Flow Formulas», Electronic Colloquium on Computational Complexity, Report No. 28 (2021) [full text]
  19. Ю. С. Белоусов, М. В. Карев, А. В. Малютин, А. Ю. Миллер, Е. А. Фоминых, “Лернейские узлы и вложенные перестройки”, Алгебра и анализ, 33:1 (2021), 30–66. 
  20. Р.В. Елисеев, «Нетривиальные решения степенных диофантовых уравнений», ВСЕ ГРАНИ МАТЕМАТИКИ И МЕХАНИКИ
    сборник статей Всероссийской молодежной научной конференции студентов. под ред. Л.В. Гензе. Томск, 2021 [full text]
  21. Н. Филонов, П. А. Ходунов, “Неединственность решения Лерэ–Хопфа для диадической модели”, Алгебра и анализ, 32:2 (2020), 229–253; St. Petersburg Math. J., 32:2 (2021), 371–387  
  22. С. В. Шамов, “Спектральные последовательности для башен Постникова”, Вопросы теории представлений алгебр и групп. 37, Зап. научн. сем. ПОМИ, 500, ПОМИ, СПб., 2021, 188–203 

2022

  1. Michalis Kokologiannakis, Iason Marmanis, Vladimir Gladstein, Viktor Vafeiadis. Truly stateless, optimal dynamic partial order reduction. Proceedings of the ACM on Programming Languages, Volume 6, Issue POPL, January 2022, Article No.: 49 pp 1–28. 
  2. M. Lifshits, A.Tadevosian. On the maximum of random assignment process. Statist. Probab. Letters, 2022, 187, 109530, 1—6.
  3. Tyshuk K., Vyatkina K. (2022) Application of Top-Down Deconvolution Tools to Bottom-Up Mass Spectrometry Data: Advantages and Limitations. In: Velichko E., Kapralova V., Karaseov P., Zavjalov S., Angueira P., Andreev S. (eds) International Youth Conference on Electronics, Telecommunications and Information Technologies. Springer Proceedings in Physics, vol 268. Springer, Cham.
  4. Гладштейн В.П., Михайловский Д.В., Моисеенко Е.А., Трунов А.А. Механизированная теория структур событий: случай параллельной регистровой машины. Труды Института системного программирования РАН. 2021;33(3):143-154.  

Preprints

    1. Danil Akhtiamov, Homologies of inverse limits of groups,  arXiv: 1901.01125 
    2. Ilya Alekseev, «New classes of minimal knot diagrams»,  arXiv: 2012.04330
    3. Alekseev, I., Magdiev R., The language of geodesics for the discrete Heisenberg group.  arXiv: 1905.03226 
    4. Alekseev, I., & Mamedov, G., On minimal crossing number braid diagrams and homogeneous braids.  arXiv: 1905.03210
    5. Yaroslav Alekseev. «A Lower Bound for Polynomial Calculus with Extension Rule»,  arXiv: 2010.05660
    6. Ivan Bochkov, Alex Davydow, Nikita Gaevoy, Sergey I. Nikolenko, New Competitiveness Bounds for the Shared Memory Switch.  arXiv: 1907.04399
    7. K. V. Chelpanov, «Alternative proof of upper bound of spanning trees in a graph»,  arXiv: 2103.00310
    8. Youri Davydov, Svyatoslav Novikov, Remarks on asymptotic independence.  arXiv: 1910.04243
    9. N.Karagodin. A limit theorem for the last exit time over a moving nonlinear boundary for a Gaussian process. arXiv: 2110.01046
    10. A. Kulikov, Fourier interpolation and time-frequency localization.  arXiv: 2005.12836
    11. Daniel Lenz, Timon Weinmann, Melchior Wirth, Self-Adjoint Extensions of Bipartite Hamiltonians together with Daniel Lenz and Melchior Wirth.  arXiv: 1912.03670
    12. Tatiana Moseeva, Alexander Tarasov, Dmitry Zaporozhets, Random sections of spherical convex bodies.  arXiv: 2007.07297
    13. M.A.Lifshits, S.E.Nikitin. Large deviations of Telecom process.
      arXiv: 2107.11846
    14. A. Nordskova, Y.Volkov, Faithful actions of braid groups by twists along ADE-configurations of spherical objects.  arXiv: 1910.02401
    15. G. Veprev, «Non-existence of a universal zero entropy system for non-periodic amenable group actions», arXiv: 2010.09806
    16. Ruslan Magdiev, Artem Semidetnov, On the geometry of free nilpotent groups. arXiv: 2106.00095
    17. Dmitriy Stolyarov, Dmitry Yarcev, Fractional integration for irregular martingales,  arXiv: 2009.05293
    18. Mariia Dospolova, Discrete intrinsic volumes,  arXiv: 2107.06549
    19. M. Lifshits, A.Tadevosian. On the maximum of a special random assignment process. arXiv: 2205.01199