?
Coverings by open and closed hemispheres
Ayzenberg A., Beketov M., Magaj G.
In this paper we study the nerves of two types of coverings of a sphere $S^{d-1}$: (1) coverings by open hemispheres; (2) antipodal coverings by closed hemispheres. In the first case, nerve theorem implies that the nerve is homotopy equivalent to $S^{d-1}$. In the second case, we prove that the nerve is homotopy equivalent to a wedge of $(2d-2)$-dimensional spheres. The number of wedge summands equals the M\"{o}bius invariant of the geometric lattice (or hyperplane arrangement) associated with the covering. This result explains some observed large-scale phenomena in topological data analysis. We review the particular case, when the coverings are centered in the root system $A_d$. In this case the nerve of the covering by open hemispheres is the space of directed acyclic graphs (DAGs), and the nerve of the covering by closed hemispheres is the space of non-strongly connected directed graphs. The homotopy types of these spaces were described by Bj\"{o}rner and Welker, and the incarnation of these spaces appeared independently as "the poset of orders" and "the poset of preorders" respectively in the works of Bouc. We study the space of DAGs in terms of Gale and combinatorial Alexander dualities, and propose how this space can be applied in automated machine learning.
Kivalov S., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Smirnov A., Демографическое обозрение 2025 Т. 12 № 2 С. 35–68
The article summarizes the application of the network approach to the analysis of migration flows in Russia from the late Soviet period to 2023. Eleven datasets on international, interregional and intermunicipal migration flows were compiled. The data sources include the 1989, 2002, 2010, 2020 (2021) population censuses, vital statistics for 2015-2023 and the “digital traces” ...
Added: March 18, 2026
Дистель Р., М.: МЦНМО, 2024.
С момента выхода первого издания на английском языке в 1997 году книга известного математика, профессора Гамбургского университета Рейнгарда Дистеля стала основным учебником по теории графов во многих университетах, выдержав к настоящему времени пять изданий, перевод последнего из которых предлагается читателю. Уникальность учебника в его глубине при относительно небольшом объёме: в книге найдутся задачи как доступные ...
Added: January 25, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Batanin M., White D., Journal of Pure and Applied Algebra 2024 Vol. 228 No. 6 Article 107570
Given a combinatorial (semi-)model category M and a set of morphisms C, we establish the existence of a semi-model category LCM satisfying the universal property of the left Bousfield localization in the category of semi-model categories. Our main tool is a semi-model categorical version of a result of Jeff Smith, that appears to be of ...
Added: December 26, 2025
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Гугнин Д. В., Труды Математического института им. В.А. Стеклова РАН 2024 С. 148–172
Показано, что фактор H∗(SymnX;Z)/Tor целочисленного кольца когомологий симметрических степеней связных счетных CW-комплексов конечного гомологического типа по кручению есть функтор от кольца H∗(X;Z)/Tor. Дано явное описание этого функтора. Также рассмотрен важный частный случай, когда X — компактная риманова поверхность M2g рода g. Знаменитая теорема Макдональда 1962 г. дает явное описание целочисленного кольца когомологий H∗(SymnM2g;Z). Тщательный анализ оригинального доказательства Макдональда показывает, что оно содержит три пробела. Все ...
Added: November 26, 2025
Akhmet’ev P., Switzerland: Springer, 2025.
This book consists of a collection of articles dedicated to Valentin Poénaru, on topology and geometry in a broad sense. Poénaru is one of the leading mathematicians whose work had an essential impact on the development of topology in France over the last forty years of the twentieth century. The special topics addressed in this ...
Added: October 27, 2025
Абрамов А. С., Chernyshev V. L., Mikhaylets E. et al., / Series Social Science Research Network "Social Science Research Network". 2025.
Computer vision is one of the most relevant modern research areas with broad practical applications. However, traditional solutions based on deep learning have signicant limitations and can be misleading. Topological data analysis, on the other hand, is a modern approach to solving similar problems using mathematically deterministic methods of algebraic topology that reduce the risk ...
Added: September 23, 2025
Yunhyung C., Eunjeong L., Mikiya M. et al., Fields Institute Communications 2024 Vol. 89 P. 107–119
Fano Bott manifolds bijectively correspond to signed rooted forests with some equivalence relation. Using this bijective correspondence, we enumerate the isomorphism classes of Fano Bott manifolds and the diffeomorphism classes of indecomposable Fano Bott manifolds. We also observe that the signed rooted forests with the equivalence relation bijectively correspond to rooted triangular cacti. ...
Added: August 30, 2025
Chernyshev V. L., Pyatko D., Математические заметки 2023 Т. 113 № 4 С. 560–576
Получена асимптотика числа конечных положений случайного блуждания на ориентированном гамильтоновом метрическом графе. ...
Added: August 29, 2025
Yunhyung C., Eunjeong L., Mikiya M. et al., Journal of Symplectic Geometry 2023 Vol. 21 No. 3 P. 439–462
We prove that if there exists a c1-preserving graded ring isomorphism between integral cohomology rings of two Fano Bott manifolds, then they are isomorphic as toric varieties. As a consequence, we give an affirmative answer to McDuff’s question on the uniqueness of a toric structure on a Fano Bott manifold. ...
Added: August 29, 2025
Yunhyung C., Eunjeong L., Mikiya M. et al., Proceedings of the Steklov Institute of Mathematics 2025 Vol. 326 P. 339–351
The c1-cohomological rigidity conjecture states that two smooth toric Fano varieties are isomorphic as varieties if there is a c1-preserving isomorphism between their integral cohomology rings. In this paper, we confirm the conjecture for smooth toric Fano varieties of Picard number 2. ...
Added: August 29, 2025
Horiguchi T., Mikiya M., Sato T., Algebraic Combinatorics 2024 Vol. 7 No. 5 P. 1433–1451
The solution of Shareshian-Wachs conjecture by Brosnan-Chow and Guay-Paquet tied the graded chromatic symmetric functions on indifference graphs (or unit interval graphs) and the cohomology of regular semisimple Hessenberg varieties with the dot action. A similar result holds between unicellular LLT polynomials and twins of regular semisimple Hessenberg varieties. A recent result by Abreu-Nigro enabled ...
Added: August 29, 2025
Черных Г. С., European Journal of Mathematics 2025 No. 11 Article 27
We prove that if a complex genus ϕ : U → R is rigid on SU-manifolds with a torus action then ϕ is the elliptic Krichever genus. ...
Added: August 29, 2025
Shestakova L. V., Семакин И. Г., Залогова Л. А. et al., М.: Просвещение, 2024.
The textbook is intended for studying computer science at the basic level in the 9th grade of general education organizations. The textbook contains the theoretical course material, questions and assignments for consolidation of knowledge. At the end of each chapter, the system of basic concepts of this chapter is presented schematically. The textbook is part ...
Added: July 7, 2025