?
Hypergraph Edge Representations with the Use of Homological Paths
Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций"). 2023. Vol. 17. No. 3. P. 678–686.
M. N. Vyalyi, Karpov V. E.
We consider the problem of realization of hypergraphs on a graph provided each hyperedge is realized by a subgraph in which exactly two vertices have odd degree. This problem is related to Cycle Double Cover conjecture. We prove that checking the existence of realization is computationally hard. The hardness is proved in various settings: for realizations on all graphs, on simple graphs, and on graphs from several restricted classes.
Publication based on the results of:
Lev Pyatko, Sergey Aksenov, Regular and Chaotic Dynamics 2026 Vol. 31 No. 5 P. 794–813
In the circular restricted three-body problem, families of periodic and quasi-periodic orbits exist in the vicinity of the libration points and are of significant interest for practical applications. This work presents a neural network-based algorithm for orbit construction and station-keeping, applicable to both periodic and quasi-periodic orbits near collinear libration points. The method employs a ...
Added: October 19, 2026
Vorontsova T., М.: Академия, 2025.
The textbook has been prepared in accordance with the requirements of the federal state educational standards for secondary vocational education and is intended for studying the professional modules “Information Security in Information and Telecommunication Systems and Networks Using Software and Hardware‑Software Tools, Including Cryptographic Protection Tools” and “Information Security in Automated Systems Using Software and ...
Added: October 19, 2026
Naumov A., Рубцов А. С., Samsonov S. et al., Успехи математических наук 2026 Т. 81 № 4 (490) С. 161–162
Краткое сообщение рассматривает Моментные оценки для стохастической аппроксимации ...
Added: October 17, 2026
Roman Avdeev, Yulia Zaitseva, Mediterranean Journal of Mathematics 2026 Vol. 23 No. 7 Article 224
We provide an infinite series of commutative finite-dimensional Gorenstein local algebras A_n for n ≥ 2. We give an elementary proof that the maximal ideal of every algebra A_n possesses a one-dimensional subspace that is different from the socle and invariant under the automorphism group of A_n. The latter implies that the algebras A_n fail ...
Added: October 17, 2026
Gordin V. A., Efremenko D., Boundary-Layer Meteorology 2026 Vol. 192 No. 51
An inverse problem of reconstructing the turbulent exchange tensor from large archives of observed wind profiles within the Åkerblom–Ekman (A-E) model framework is investigated using high-vertical-resolution radiosonde observations. The reconstructed tensor provides improved agreement between modeled and observed wind profiles compared to classical formulations based on real turbulent exchange coefficient. Instead of the classical A-E ...
Added: October 16, 2026
Kuznetsov A. P., Sedova Y. V., Stankevich N., Chaos, Solitons and Fractals 2026 Vol. 213 No. 12 Article 119309
We analyze the interaction of a quasi-periodic subsystem, in which two-, three-, and four- frequency quasi-periodic oscillations are possible, with a chaotic subsystem. A discrete version is obtained via the Euler scheme from the corresponding flow model. The dynamics of individual subsystems are discussed, including quasi-periodic bifurcations of invariant tori and the occur rence of ...
Added: October 16, 2026
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 10 Article 330
Automated microscopic image analysis is essential for quantitative microbiology, yet manual acquisition and generic recognition models struggle with morphological variability and scene artifacts. We address both ends of this pipeline. First, we present a low-cost, open-source acquisition system, based on an Arduino UNO R3 microcontroller and NEMA 17 stepper motors, that automates focusing, magnification, and ...
Added: October 14, 2026
Mamedov I., Fofanov M., Lukianchenko P. et al., IEEE Access 2026 No. 14 P. 26662–26671
DreamBooth-style personalization, which often relies on one or a few images, can memorize context (background, pose, lighting) rather than learning the subject’s identity, thereby reducing fidelity and limiting prompt-driven edits. P-LoRA (Probability LoRA) is introduced as a training-time modification that biases diffusion timestep sampling and utilizes importance weights, ensuring that the overall objective remains unchanged. ...
Added: October 14, 2026
Parkhomenko V., Kulikova S., Buzmakov A. V., Lobachevskii Journal of Mathematics 2026 Vol. 47 No. 6 P. 2979–2992
The stability of formal concepts and its generalization as robustness are considered in the paper. We use an approximation of stability in the form of Δ-measure for fast calculations. A computationally efficient method for calculating robustness based on subcontexts is presented. We also present a new method to analytically evaluate the number of preimages for ...
Added: October 14, 2026
Kuznetsov A. P., Sedova Y. V., Sataev I. R. et al., Mathematics and Computers in Simulation 2027 Vol. 2 P. 574–592
Universal bifurcation structures on the parameter plane of nonlinear systems, known as shrimps, are discussed. An overview of numerous examples from various fields of science is given. Shrimps are typical for both maps of different dimensions and flows. The varieties of shrimp are discussed and relevant examples are given. The similarity property on the parameter ...
Added: October 14, 2026
Springer, 2026.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XIV International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2025). The carefully selected papers cover ...
Added: October 13, 2026
Springer, 2026.
This book offers a comprehensive overview of the latest research, innovations, and practical applications in the field of sustainability, with a focus on construction materials and their use in building and civil engineering structures. As an outcome of the 3rd International Conference on Sustainability: Developments and Innovations (ICSDI 2026), this book presents a selection of ...
Added: October 13, 2026
Dmitriev A., Kornilov V., Batienkov R., Lecture Notes in Civil Engineering 2026 Vol. 886 P. 249–255
Numerous studies have provided compelling evidence that the probability distribution of avalanche sizes follows a power law, and that 1/f noise is present in the stochastic dynamics of landslides. We present a theoretical explanation of these phenomena within the framework of self-organized criticality theory, proposing a discrete-time model in the form of a sandpile cellular ...
Added: October 13, 2026
Dmitriev A., Shulman I., Lebedev A., Studies in Computational Intelligence 2026 Vol. 1265 P. 266–273
A discrete-time model is presented for the self-organization of the X/Twitter social network to the edge of a phase transition, characterized by avalanche-like propagation of information in the network. The model is based on the analogy between the critical dynamics of the X social network and sandpile cellular automata with Manna rule on the Chung-Lu ...
Added: October 13, 2026
Makarov D. M., Kalikin N., Fashchevsky K. A. et al., Electrochimica Acta 2026 Vol. 579 Article 150159
Machine learning (ML) has become a powerful tool for accelerating the development of carbon-based supercapacitors;
however, most published models assume that a single predictive framework can describe both conventional
porous carbons and hybrid carbon electrodes. Here, we test this assumption using a comprehensive
benchmark dataset and an extended literature-curated dataset enriched with synthesis- and electrolyte-related
descriptors. Three ML algorithms ...
Added: October 13, 2026
Zhang Z., Ilvovsky D., Information Processing and Management 2026 Vol. 63 No. 7
Transformer-based Large Language Models (LLMs) rely on Key-Value (KV) cache to accelerate autoregressive decoding, but memory and compute requirements still grow with context length, limiting deployment on resource-constrained devices. Existing training-free KV cache compression methods mainly rely on attention-driven retention heuristics, which may under preserve structurally informative tokens under tight cache budgets, especially when such ...
Added: October 13, 2026
Gusein-Zade S., Campillo A., Delgado F., Mathematische Zeitschrift 2026 Vol. 314 No. 1 P. 1–22
For a subfield $\K$ of the field $\C$ of complex numbers, we consider curve and divisorial valuations on the algebra $\K[[x,y]]$ of formal power series in two variables with the coefficients in $\K$. We compute the semigroup Poincar\'e series and the classical Poincar\'e series of a (discrete, rank one) valuation on it. ...
Added: October 13, 2026
No Species Is an Island, Entire of Itself: Genetic Speciation Algorithm with Interplay among Species
Gromov V., Sohrabi M., Fathollahi-Fard A., International Journal of Engineering, Transactions B: Applications 2027 Vol. 40 No. 5 P. 1437–1460
This paper, with a particular emphasis on Genetic Algorithm (GA), proposes a novel approach that integrates clustering mechanisms, predator-prey dynamics, and a distinctive selection strategy for generating subsequent populations. The proposed evolutionary algorithm, referred to as Genetic Speciation Algorithm with Interplay Among Species (GSAIS), is comprehensively evaluated against several variants of GAs as well as ...
Added: October 12, 2026
Mishuris G., Meylan M. H., Pelinovsky E., Journal of Fluid Mechanics 2026 Vol. 1045 Article A4
In this paper, we revisit the classic problem of a wave field on a sloping beach of an arbitrary angle and propose a general approach that allows the computation of regular solutions of the problem regardless of the angle. We use the Mellin-transform technique, reducing the problem to singular integral equations with fixed-point singularities of ...
Added: October 12, 2026
Onoprienko A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 № 527 С. 206–216
We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that players see each other’s cards but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters ofthe game ...
Added: November 23, 2025
S. M. Dudakov, Karlov B. N., S. L. Kuznetsov et al., Algebra and Logic 2021 Vol. 60 No. 5 P. 308–326
The Lambek calculus with the unit can be defined as the atomic theory (algebraic logic) of the class of residuated monoids. This calculus, being a theory of a broader class of algebras than Heyting ones, is weaker than intuitionistic logic. Namely, it lacks structural rules: permutation, contraction, and weakening. We consider two extensions of the ...
Added: November 12, 2023
Vyalyi M., Карпов В. Е., Дискретный анализ и исследование операций 2023 Т. 30 № 3(157) С. 81–95
We consider a problem of realization of hypergraphs on graphs provided each hyperedge is realized by a subgraph in which exactly two vertices have odd degree. This problem is related to Cycle Double Cover conjecture. We prove that checking the existence of realization is computationally hard. The hardness is proved in various settings: for realizations ...
Added: October 31, 2023
Solomadin G., Arnold Mathematical Journal 2022 P. 1–46
In this paper, for any Milnor hypersurface, we find the largest dimension of effective
algebraic torus actions on it. The proof of the corresponding theorem is based on
the computation of the automorphism group for any Milnor hypersurface. We find
all generalized Buchstaber–Ray and Ray hypersurfaces that are toric varieties. We
compute the Betti numbers of these hypersurfaces and ...
Added: April 25, 2022
Shabanov D. A., Discrete Applied Mathematics 2020 Vol. 282 P. 168–183
The paper deals with estimating the r-colorability threshold for a random k-uniform hypergraph in the binomial model H(n,k,p). We consider the sparse case, when the expected number of edges is a linear function of n and prove a new lower bound for the sharp threshold of the property that H(n,k,p) is r-colorable. ...
Added: June 6, 2020