?
Алгоритмические рекомендательные системы и цифровые медиаплатформы: теоретические подходы
Информационное общество. 2022. № 6. С. 84–95.
The article examines the influence of algorithmic recommender systems on media communication processes in general and the formation of the information agenda in particular. The theoretical concepts of echo chambers, information bubbles, etc. are described. The user agreement and privacy policy of the VK platform are analyzed, the type of algorithm used on the digital media platform is explored.
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Селянин Ф. И., Moscow Mathematical Journal 2026 Vol. 26 No. 2 P. 167–187
Minkowski mixed volume of n subpolytopes D1,…,Dn of a polytope P⊂Rn clearly does not exceed the normalized volume n!Vol(P). Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face F⊊P intersects at least dim(F)+1 of the polytopes Di. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems.
Motivated by relaxing the bound dim(F)+1 to dim(F), we ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., International Mathematics Research Notices 2026 Vol. 14 Article rnag146
We prove a recent conjecture of the fourth named author with P. Norbury that states a system of universal polynomial relations among the kappa classes on the moduli spaces of algebraic curves. The proof involves localization and materialization analysis of the spin Gromov–Witten theory of the projective line and is dictated by Z 2 -equivariant ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Communications in Mathematical Physics 2026 Vol. 407 No. 69
We prove that for any initial data on a genus zero spectral curve the cor responding correlation differentials of topological recursion are KP integrable. As an application we prove KP integrability of partition functions associated via ELSV-type formulas to the r-th roots of the twisted powers of the log canonical bundles ...
Added: August 31, 2026
Gromov V., Переслегин С. Б., Переслегина Е. Б. et al., СПб.: Полакс, 2026.
Механизм происходящих в мире изменений носит эволюционный, а не экологический характер. Иначе говоря, Человечество столкнулось с кризисом развития, который имеет три независимые составляющие: кризис индустриального общества (фазовый кризис), кризис научного мышления (эпистемный кризис) и кризис формата существования разума (социосистемный кризис). Доклад посвящён аспектам этого триединого кризиса и возможным путям его преодоления, не сводящимся к первичному ...
Added: August 31, 2026
Devyatov R. A., Mathematical notes 2026 Vol. 119 No. 3 P. 782–786
Let G/B be a flag variety over ℂ, where G is a simple algebraic group with a simply laced Dynkin diagram, and B is a Borel subgroup. We say that the product of classes of Schubert divisors in the Chow ring is multiplicity free if it is possible to multiply it by a Schubert class ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Journal fuer die reine und angewandte Mathematik 2026 Vol. 2026 No. 836 P. 111–162
We give a self-contained and simplified proof of Mukai’s classification of prime Fano threefolds of index 1 and genus g ≥ 6 with at most factorial terminal singularities, and of its extension to higher dimension. ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Compositio Mathematica 2026 Vol. 162 No. 1 P. 59–99
We give a proof of Mukai’s theorem on the existence of certain exceptional vector bundles on prime Fano threefolds. To our knowledge this is the first complete proof in the literature. The result is essential for Mukai’s biregular classification of prime Fano threefolds, and for the existence of semiorthogonal decompositions in their derived categories. Our ...
Added: August 30, 2026
Guseva L., Novikov A., Advances in Mathematics 2026 Vol. 503 Article 111211
We prove that the Kuznetsov–Polishchuk exceptional collections on rational homogeneous spaces of the symplectic groups Sp(2n,C) are full and consist of vector bundles. To achieve this, we construct several classes of complexes, which we call generalized staircase complexes, symplectic staircase complexes and secondary staircase complexes — each of which may be of independent interest. ...
Added: August 30, 2026
Polishchuk A., Rains E., Journal of the Institute of Mathematics of Jussieu 2026 Vol. 25 No. 1 P. 339–373
We prove that for every relatively prime pair of integers (d,r) with r>0, there exists an exceptional pair (O,V) on any del Pezzo surface of degree 4, such that V is a bundle of rank r and degree d. As an application, we prove that every Feigin-Odesskii Poisson bracket on a projective space can be ...
Added: August 30, 2026
Kazhdan D., Polishchuk A., Pure and Applied Mathematics Quarterly 2026 Vol. 22 No. 3 P. 1115–1166
We continue the study of automorphic functions associated with a curve C over the ring k[ε]/(ε²), where k is a finite field, begun in arXiv:2303.16259. Namely, we study an example of theta-lifting in this framework and show that it can be understood in terms of the orbit decomposition of the space of automorphic functions S(SL₂(F)\SL₂(A_C)) ...
Added: August 30, 2026
Kuznetsov A. P., Sataev I. R., Stankevich N., Chaos 2026 Vol. 36 No. 8 Article 083131
A radio-physical system, namely, a two-mode van der Pol generator, is considered. It is shown that this system demonstrates two types of chaos: with one and two zero Lyapunov exponents. The regions of the second type of chaos are surrounded by bifurcation lines of invariant tori doubling. Quasi-periodic structures of various shapes are embedded within ...
Added: August 30, 2026
Shirokov N. A., Rozenblum G., Israel Journal of Mathematics 2026 P. 1–30
We establish that a generalized H\¨older continuous function on an (m−2)-Ahlfors regular compact set in Rm can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity modulus of the function ...
Added: August 29, 2026
Avdoshin S.M., Patrushev K. A., Proceedings of the Institute for System Programming of the RAS 2026 No. 4 часть 2 P. 245–256
The cardinality-constrained Markowitz problem is NP-hard and traditionally solved with commercial MIQP solvers. Following the 2022 export restrictions that rendered both commercial MIQP software and cloud quantum platforms (IBM Quantum, D-Wave Leap) inaccessible from the Russian Federation, practitioners require open-source alternatives. This paper systematically compares three solver families for the discrete mean-variance problem: two open-source ...
Added: August 27, 2026
Anna Volodkevich, Dmitry A., Gusak D. et al., , in: SIGIR '26: Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval.: Association for Computing Machinery (ACM), 2026. P. 3434–3441.
Offline evaluation of recommender systems is often affected by hidden, under-documented choices in data preparation. Seemingly minor decisions in filtering, handling repeats, cold-start treatment, and splitting strategy design can substantially reorder model rankings and undermine reproducibility and cross-paper comparability.
In this paper, we introduce SplitLight, an open-source exploratory toolkit that enables researchers and practitioners designing preprocessing ...
Added: July 22, 2026
Severin N., Kartushov D., Urzhumov V. et al., , in: Advances in Information Retrieval: 48th European Conference on Information Retrieval, ECIR 2026, Delft, The Netherlands, March 29 – April 2, 2026, Proceedings, Part II. (LNCS, volume 16484).: Cham: Springer Publishing Company, 2026. P. 508–517.
Sequential recommender systems have achieved significant success in modeling temporal user behavior but remain limited in cap-turing rich user semantics beyond interaction patterns. Large Language Models (LLMs) present opportunities to enhance user understanding with their reasoning capabilities, yet existing integration approaches cre-ate prohibitive inference costs in real time. To address these limitations, we present a ...
Added: June 18, 2026
Liakhnovich K., Lashinin O., Babkin A. et al., Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval 2025 P. 2754–2758
Relevance and diversity are critical objectives in modern information retrieval (IR), particularly in recommender systems. Achieving a balance between relevance (exploitation) and diversity (exploration) optimizes user satisfaction and business goals such as catalog coverage and novelty. While existing post-processing reranking methods address this trade-off, they usually rely on greedy strategies, leading to suboptimal outcomes for ...
Added: February 3, 2026
Time to Split: Exploring Data Splitting Strategies for Offline Evaluation of Sequential Recommenders
Gusak D., Volodkevich A., Klenitskiy A. et al., , in: RecSys '25: Proceedings of the Nineteenth ACM Conference on Recommender Systems.: ACM, 2025. P. 874–883.
Modern sequential recommender systems, ranging from lightweight transformer-based variants to large language models, have become increasingly prominent in academia and industry due to their strong performance in the next-item prediction task. Yet common evaluation protocols for sequential recommendations remain insufficiently developed: they often fail to reflect the corresponding recommendation task accurately, or are not aligned ...
Added: January 26, 2026
Yusupov V., Rakhuba M., Frolov E., , in: CIKM '25: Proceedings of the 34rd ACM International Conference on Information and Knowledge Management.: ACM, 2025. Ch. 1 P. 5469–5473.
In this work, we present a fast and effective Linear approach for updating recommendations in a scalable graph-based recommender system UltraGCN. Solving this task is extremely important to maintain the relevance of the recommendations under the conditions of a large amount of new data and changing user preferences. To address this issue, we adapt the ...
Added: October 3, 2025
Yusupov V., Rakhuba M., Frolov E., , in: RecSys '25: Proceedings of the Nineteenth ACM Conference on Recommender Systems.: ACM, 2025. Ch. 1 P. 1217–1221.
Recent studies have demonstrated the potential of hyperbolic geometry for capturing complex patterns from interaction data in recommender systems. In this work, we introduce a novel hyperbolic recommendation model that uses geometrical insights to improve representation learning and increase computational stability at the same time. We reformulate the notion of hyperbolic distances to unlock additional ...
Added: October 3, 2025
I. Safilo, D. Tikhonovich, Petrov A. et al., Doklady Mathematics 2023 Vol. 108 No. 2 P. S456–S464
We present a new movie and TV show recommendation dataset collected from the real users of MTS Kion video-on-demand platform. In contrast to other popular movie recommendation datasets, such as MovieLens or Netflix, our dataset is based on the implicit interactions registered at the watching time, rather than on explicit ratings. We also provide rich ...
Added: May 24, 2025
Anna Volodkevich, Ivanova V., Vasilev A. et al., , in: Advances in Information Retrieval: 47th European Conference on Information Retrieval, ECIR 2025, Lucca, Italy, April 6–10, 2025, Proceedings, Part IV.: Springer, 2025. P. 425–430.
Simulators for recommender systems are widely used for recommender systems performance evaluation and feedback loop effects analysis. Existing simulators often propose inflexible pipelines, are focused on narrow research tasks, or are not adapted to work with industrial large data volumes. To address these challenges, we developed the Sim4Rec simulation framework. The Sim4Rec models key aspects ...
Added: April 10, 2025
Gleb Mezentsev, Danil Gusak, Ivan Oseledets et al., , in: RecSys '24: Proceedings of the 18th ACM Conference on Recommender Systems.: Association for Computing Machinery (ACM), 2024. P. 475–485.
Added: January 16, 2025