?
Точное значение немонотонной сложности булевых функций
Математические заметки. 2019. Т. 105. № 1. С. 32–41.
Mikhailovich A., Kochergin V.
A problem of complexity of Boolean functions realization over infinite complete bases of special type is studied. These bases contain all monotone functions with zero weight and finite number of non-monotone functions with unit weight. Exhaustive description of Boolean realization over basis that consists of all monotone functions and one non-monotone function negation has been obtained by Markov. The minimal sufficient number of negations for arbitrary Boolean function f realization (i.e. inversion complexity of the function f) equals ⌈log2(d(f)+1)⌉, where d(f) is the maximal number of function value changes from 1 to 0 over all increasing chains of tuples of variables values. In this paper the result above is generalized to the arbitrary basis of this type. It is shown that the minimal sucient for arbitrary Boolean function f realization number of non-monotone functions equals ⌈log2(d(f)/D(B) + 1)⌉. Here D(B) is the maximum d(ω) over all non-monotone functions ω from the basis B.
Language:
Russian
Karpova Irina Petrovna, Pattern Recognition and Image Analysis 2025 Vol. 35 No. 4 P. 1138–1144
A solution to the problem of redistributing agents between groups based on simulating a form of social parasitism in ants known as slave-making is considered. To provide a comprehensive solution, the problem is integrated with a method of orientation based on visual landmarks and a compass, including route memorization and return. The models and mechanisms ...
Added: April 29, 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
Domrin V. I., Malova H. V., V. Yu. Popov et al., Cosmic Research 2026 Vol. 64 No. 2 P. 238–252
During magnetospheric perturbations a relatively thin current sheet with thickness about several
proton gyroradii forms in the Earth’s magnetotail. In a framework of the kinetic model describing current
sheet thinning in the magnetotail, the processes of its formation are investigated depending on the normal
magnetic field magnitude which affects both the current sheet structure and particle dynamics within ...
Added: April 27, 2026
Tsareva O. O., Malova H. V., V. Yu. Popov et al., Plasma Physics Reports 2026 Vol. 52 No. 2 P. 179–185
The influence of asymmetry of plasma sources on the structure and spatial localization of a superthin
current sheet (STCS) supported by demagnetized electrons is studied using a self-consistent model. The
simulation takes into account the presence of a single plasma source in the northern hemisphere, which
makes the plasma flow asymmetric. It is demonstrated that the asymmetry of ...
Added: April 27, 2026
Pochinka O., Yakovlev E., Shmukler V., Russian Journal of Nonlinear Dynamics 2026
Every discrete dynamical system (cascade) generated by a homeomorphism induces a continuous
dynamic system (flow) — a suspension. However, not every flow is equivalent to a suspension
over a cascade, a necessary and sufficient condition for this is the existence of a global
section for the flow. In the case of the existence, the flow is equivalent to ...
Added: April 24, 2026
NY: Association for Computing Machinery (ACM), 2026.
It is our great pleasure to welcome you to the 35th edition of the Web Conference to be held on June 29 – July 3, 2026, in Dubai, United Arab Emirates.
Following discussions with our partners and key stakeholders, we have taken the decision to postpone the ACM Web Conference 2026, initially planned for April 2026. ...
Added: April 23, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Selecta Mathematica, New Series 2026 Vol. 32 Article 25
We revise the notion of the blobbed topological recursion by extending it to the setting of generalized topological recursion as well as allowing blobs which do not necessarily admit topological expansion. We show that the so-called non-perturbative differentials form a special case of this revisited version of blobbed topological recursion. Furthermore, we prove the KP ...
Added: April 23, 2026
Kazaryan M., Lando S., Kodaneva N., Journal of Geometry and Physics 2026 No. 225 Article 105841
Weight systems associated to the Lie algebras 𝔤𝔩(N) for N = 1,2,... can be unified into auniversal one. The construction is based on an extension of the 𝔤𝔩(N) weight systems to permutations. This universal weight system takes values in the algebra of polynomials C[N;C1,C2,...] in infinitely many variables. We show that under the substitution Cm ...
Added: April 23, 2026
Kychkin A., Chernitsin I., Прикладная информатика 2026 Т. 21 № 1 С. 40–58
The results of the development of a software microservice embedded in atmospheric air quality monitoring systems to support the identification of industrial pollution sources are presented. The emission and subsequent spread of harmful substances in the lower layers of the atmosphere is dynamic and characterized by high uncertainty due to the specific features of technological ...
Added: April 23, 2026
IEEE, 2026.
Added: April 21, 2026
Qin X., Deng Y., Shchur L. et al., / Series arXiv "math". 2026. No. 2603.02962.
We perform a Monte Carlo analysis of the Ising model on many three-dimensional lattices. By means of finite-size scaling we obtain the critical points and determine the scaling dimensions. As expected, the critical exponents agree with the three-dimensional Ising universality class for all models. The irrelevant field, as revealed by the correction-to-scaling amplitudes, appears to ...
Added: April 20, 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
Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.
We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...
Added: April 18, 2026
Medvedev V., / Series arXiv "math". 2026.
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...
Added: April 3, 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
V. V. Kochergin, A. V. Mikhailovich, Mathematical notes 2025 Vol. 117 No. 4 P. 579–594
The exact value of the complexity of the circuit implementation of an arbitrary Boolean function in a certain basis consisting of negation and all monotone Boolean functions is found. The complexity of a function is defined as the least number of basis elements sufficient to construct a circuit implementation of this function. ...
Added: February 28, 2026
Kolesnikov A., / Series arXiv "math". 2025.
We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets.
We also discuss links to the ...
Added: February 13, 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
Gaianov N., Parusnikova A., / Cornell University. Серия math "arxiv.org". 2025.
An algebraic q-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this sufficient condition for constructing a formal expansion of a solution to a certain q-difference analogue of the fifth Painlevé equation ...
Added: December 25, 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
Popov V., / Series arXiv "math". 2025. No. 2502.01539.
We prove that the variety of flexes of algebraic curves
of degree 3 in the projective plane is an ideal theoretic complete
intersection in the product of a two-dimensional and a nine-dimensional projective spaces. ...
Added: December 16, 2025
Gnetov F., Konakov V., / Series arXiv "math". 2025. No. 2512.04667.
We establish a central limit theorem, a local limit theorem, and a law of large numbers for a natural
random walk on a symmetric space M of non-compact type and rank one. This class of spaces, which
includes the complex and quaternionic hyperbolic spaces and the Cayley hyperbolic plane, generalizes
the real hyperbolic space Hn. Our approach introduces ...
Added: December 5, 2025
Kazakov A., Koryakin V., Safonov K. et al., / Series arXiv "math". 2025.
The Lorenz attractor is the first example of a robustly chaotic non-hyperbolic attractor. Each orbit of such an attractor has a positive top Lyapunov exponent, and this property persists under small perturbations despite possible bifurcations of the attractor. In this paper, we study the boundary of the Lorenz attractor existence region in the Shimizu-Morioka model. ...
Added: December 4, 2025
Bitter I., Konakov V., / Cornell University. Серия arXiv "math". 2025. № 2505.24548.
В работе приводится обобщение локальной предельной теоремы о сходимости неоднородных цепей Маркова к диффузионному пределу на случай, когда соответ- ствующие коэффициенты процессов удовлетворяют слабым условиям регулярности и совпадают лишь асимптотически. В частности, рассматриваемые нами коэффици- енты сноса могут быть неограниченными с не более чем линейным ростом, а оценки отражают перенос терминального состояния неограниченным трендом через ...
Added: December 3, 2025