?
Об одном методе решения систем квадратичных булевых уравнений, использующем локальные аффинности
Информатика и ее применения. 2019. Т. 13. № 2. С. 37–46.
Fedorov S., Логачёв О. А., Сукаев А. А.
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 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
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 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
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 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
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
Дехтярь М. И., Dudakov S., Карлов Б. Н., Тверь: Тверской государственный университет, 2021.
Учебное пособие адресовано изучающим курс дискретной математики, прежде всего, студентам младших курсов, обучающимся по направлениям укрупненных групп 01.03.00 "Математика и механика", 02.03.00 "Компьютерные и информационные науки", 09.03.00 "Информатика и вычислительная техника".
Настоящий сборник задач является пособием для практических занятий по некоторым разделам дискретной математики и может быть использован преподавателями и студентами для подготовки к семинарским занятиям и ...
Added: November 12, 2023
Дехтярь М. И., Dudakov S., Карлов Б. Н., Тверь: Тверской государственный университет, 2021.
Учебник содержит лекционный материал по дисциплине "Дискретная математика", а также примеры задач с решениями и задачи для самостоятельной работы. Основные разделы учебника: множества, математическая индукция, комбинаторика, булевы функции, логика высказываний и предикатов, графы, автоматы и формальные языки, алгоритмы.
Учебник адресован, прежде всего, студентам младших курсов, обучающихся по направлениям укрупненных групп 01.03.00 "Математика и механика", 02.03.00 "Компьютерные ...
Added: November 12, 2023
Коврижных М. А., Fomin D., Прикладная дискретная математика. Приложение 2021 № 14 С. 181–184
Bijective vector Boolean functions (permuta- tions) are used as nonlinear primitives of many symmetric ciphers. In this paper, we study a generalized construction of (2m, 2m)-functions using monomial and arbitrary m-bit per- mutations as constituent elements. A heuristic algorithm for obtaining bijective Boolean functions with given nonlinearity and differential uniformity, based on this construction, is proposed. For ...
Added: September 22, 2021
Fedorov S., Логачёв О. А., Ященко В. В., Дискретная математика 2021 Т. 33 № 2 С. 66–85
Рассматривается действие на множестве булевых функций расширения G полной аффинной группы преобразований с помощью группы аффинных функций: действие заключается в преобразовании булевых функций невырожденными аффинными заменами переменных и сложением с аффинными булевыми функциями. Введены и исследованы параметры булевых функций, инвариантные относительно действия группы G: амплитуда (тесно связанная с нелинейностью), размерность функции и некоторые другие. Эти ...
Added: June 16, 2021
Sysoeva L., Moscow University Mathematics Bulletin 2019 Vol. 74 No. 6 P. 241–245
The problem of realization of Boolean functions by initial Boolean automata with constant states and n inputs is considered. Initial Boolean automaton with constant states and n inputs is an initial automaton with output such that in all states the output functions are n-ary constant Boolean functions 0 or 1. An example of an initial Boolean automaton with the minimum ...
Added: November 22, 2020
Yashunsky A., Вестник Московского университета. Серия 1: Математика. Механика 2019 № 4 С. 3–9
We consider systems of Boolean functions inducing algebras of Bernoulli distributions, whose universal set has a single limit point. We establish a criterion for an algebra generated by a given set of distributions to have a unique limit point. ...
Added: September 9, 2020
Ложкин С. А., Danilov B. R., Прикладная математика и информатика 2011 № 39 С. 107–129
The article investigates a model of delays in a network of functional elements (a gate network) in an arbitrary finite complete basis B, where basis elements may have different input delays. Asymptotic bounds of the form τ_B n ± O(1), where τ_B is a constant that depends only on the basis B, are obtained for ...
Added: December 2, 2019
Lozhkin S. A., Danilov B.R., Computational Mathematics and Modeling 2012 Vol. 23 No. 4 P. 487–506
The article investigates a model of delays in a network of functional elements (a gate network) in an arbitrary finite complete basis B, where basis elements may have different input delays. Asymptotic bounds of the form τ B n±O(1), where τ B is a constant that depends only on the basis B, are obtained for ...
Added: December 2, 2019
Danilov B. R., Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика 2013 Т. 4 С. 25–33
В~работе изучается модель задержки схем из функциональных элементов в произвольном конечном полном базисе~$\lBase$, в которой задержки базисных элементов задаются произвольными положительными действительными числами для каждого входа и каждого входного набора переменных, поступающих на остальные входы. В~рассматриваемой модели для задержки мультиплексорной функции порядка~$n$ получены асимптотические оценки вида~$\tau_{\lBase} n \pm O(\log n)$, где~$\tau_{\lBase}$ "--- константа, зависящая только ...
Added: December 2, 2019
Ложкин С. А., Шуплецов М. С., Коноводов В. А. et al., Проблемы разработки перспективных микро- и наноэлектронных систем (МЭС) 2016 Т. 1 С. 40–47
The synthesis of optimal or suboptimal switching circuits is an actual problem of theory of discrete control
systems. Libraries of such circuits could be used in various algorithms of logic synthesis (e.g., see [1]). The structure
analysis of optimal circuits for functions of few variables may be useful in the development of standard cell libraries.
The first catalogs ...
Added: December 2, 2019
Danilov B.R., Lozhkin S. A., Computational Mathematics and Modeling 2019 Vol. 30 No. 1 P. 129–136
The article proposes a synthesis method for amplifying networks of functional elements (ANFE) that establishes the asymptotic behavior of the Shannon function for th ANFE generalized depth, i.e., the depth of the "worst" Boolean function of n given variables, in a special basis (the depth model) where the element depth is determined both by its ...
Added: December 1, 2019