?
On the number of independent and k-dominating sets in graphs with average vertex degree at most k
Sbornik Mathematics. 2023. Vol. 214. No. 11. P. 1627–1650.
The following conjecture is formulated: if the average vertex degree in a graph is not greater than a positive integer k⩾1, then the number of k-dominating sets in this graph does not exceed the number of its independent sets, and these numbers are equal to each other if and only if the graph is k-regular. This conjecture is proved for k∈{1,2}.
Publication based on the results of:
Guterman A., Jonoska N., Kreines E. et al., Proceedings of the Edinburgh Mathematical Society 2026 Vol. 69 No. 3 P. 1041–1057
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative to its size. These conditions serve to prove the conjecture that such a maximum, which is equal to 𝐹_(2𝑛+1) −1, ...
Added: September 27, 2026
Shishkina E., Современная математика. Фундаментальные направления 2026 Т. 72 № 1 С. 52–67
In this paper, we construct a weighted Sobolev space of fractional order based on the
generalized Bessel potential.We apply these results to the analysis of the singular fractional Schr¨odinger
equation. To solve the Cauchy problem for this equation, we prove an estimate that relates the norm of
the solution to the norm of the initial condition in the ...
Added: September 26, 2026
Shishkina E., Computational Mathematics and Mathematical Physics 2026 Vol. 66 No. 5 P. 804–815
This article demonstrates that the Laplace–Bessel operator generates a strongly continuous
semigroup on a weighted Lebesgue space. Using this semigroup, we define the fractional Laplace–
Bessel operator via Balakrishnan’s formula. Furthermore, we derive three distinct representations for
fractional powers of the negative Laplace–Bessel operator. ...
Added: September 26, 2026
Kolokoltsov V., Shishkina E., Journal of Theoretical Probability 2026 P. 39–83
In this paper, we introduce a new construction of fractional derivatives and integrals
with respect to a function, based on a matrix approach. We believe that this is a powerful
tool in both analytical and numerical calculations.We begin with the differential
operator with respect to a function that generates a semigroup. By discretizing this
operator, we obtain a matrix ...
Added: September 26, 2026
Petr Kucheriaviy, Bulletin of the Australian Mathematical Society 2026
We prove that an analogue of Rogers’ theorem on sieving holds for an order if and only if the order is a Dedekind domain. We also prove that it holds for a finite commutative ring if and only if the ring is a direct product of local rings with linearly ordered ideals. ...
Added: September 25, 2026
Пелевин Ф. Е., Математические заметки 2026 Т. 120 № 1 С. 159–163
Две не равные тождественно нулю функции (последовательности элементов некоторого поля) будем называть эквивалентными, если они удовлетворяют функциональному уравнению типа теорем сложения тэта-функций. Основной результат работы состоит в том, что рассматриваемое отношение действительно является отношением эквивалентности. ...
Added: September 25, 2026
Shimanogov I. N., Vyalyi M., Siberian Mathematical Journal 2026 Vol. 67 No. 5 P. 1203–1212
We consider a class of Boolean algebras formed by intersections of regular languages with
a given language. In the case where such an algebra is isomorphic to the algebra of regular languages,
we prove the existence of an isomorphism that is computable using oracles for the regular realizability
problem and the infinite regular realizability problem. This result yields ...
Added: September 25, 2026
Ramazanov I., Bukh A., Shepelev Igor A., Chaos 2026 No. 36 P. 083150–083150
We investigate how stochastic Poisson impulsive forcing influences the spatiotemporal dynamics of a two-dimensional network of Hindmarsh–Rose neurons. Unlike continuous noise, impulsive forcing introduces discrete, state-dependent perturbations, making the system response highly sensitive to both the statistics and the spatial structure of the input. In most of the parameter space, stochastic impulses destabilize the initial ...
Added: September 24, 2026
Levashev V., / Series arXiv "math". 2026. No. 2609.06010.
We prove that continuous A-bilinear pairings on the ring of Laurent series that are invariant under continuous automorphisms coincide, up to a constant, with the pairing given by the residue of a differential form over any commutative associative ring with identity. ...
Added: September 24, 2026
Sokolov V., Adler V. E., Journal of Geometry and Physics 2026 Vol. 227 Article 105860
The group reduction procedure is applied to vector generalizations of the NLS, mKdV,
and KdV equations. The resulting ODE systems admit isomonodromic Lax representations
and are multicomponent generalizations of the Painlevé equations P 1, P 2, P 34, and P 4.
Some of them can be interpreted as nonautonomous deformations of well-known systems
integrable in the Liouville sense, in ...
Added: September 24, 2026
Sokolov V., BALAKHNEV M. Y., Ufa Mathematical Journal 2026 Vol. 18 No. №3 P. 85–93
A collection of miscellaneous continuous, semi-discrete, and discrete integrable
systems can be associated with each integrable evolution equation of the KdV type. We provide them for the Schwarz — KdV equation and generalize to the vector case. The existence
of these vector generalizations is a non-trivial found fact, no mathematical explanation of
which is known yet. ...
Added: September 24, 2026
Yakovlev E., Maksimov D. A., Mathematical notes 2026 Vol. 120 No. 3 P. 483–496
Smooth principal bundles whose total spaces and bases are time oriented Lorentzian manifolds and whose projections are Lorentzian submersions preserving time orientations are studied. Previously, the authors showed that the chronologicity, causality, and stable causality always lift from the base to the space of a Lorentzian bundle. For strong causality and global hyperbolicity, this holds ...
Added: September 24, 2026
Sokolov V., Shabat G. B., Tsiganov A. V., Journal of Geometry and Physics 2026 Vol. 220
We consider Novikov equations for commutative ring generated by differential operators of
orders 3,4,5. We present an explicit Hamiltonian form of these equations. Using the method
of compatible Poisson brackets, we find a separation of variables on a hyperelliptic curve
of genus 2 for the Novikov equations ...
Added: September 24, 2026
Marshakov A., Yung A., Ievlev E. et al., Physical Review D - Particles, Fields, Gravitation and Cosmology 2026 No. 114 P. 1–22
We continue the study of non-Abelian vortex string in 4D N ¼ 2 supersymmetric QCD (SQCD) as critical superstring, and extend this analysis to UðNÞ gauge theory with arbitrary even N and Nf ¼ 2N number of quarks. We introduce a special mass deformation and show that the SQCD hadron spectrum is still given by ...
Added: September 24, 2026
Demina M.V., Nechitailo V., Analysis and Mathematical Physics 2026 Vol. 16 No. 5 P. 1–25
We present a method of finding non-Liouvillian first integrals of rational two-dimensional differential systems. The method is based on the existence of two independent invariants that satisfy a linear second-order ordinary differential equation with respect to one of the variables. We call systems with this property R-integrable. These invariants are not necessarily polynomial; they can ...
Added: September 24, 2026
Bitter I., Konakov V., Mathematical notes 2026 Vol. 120 No. 4 P. 599–615
The paper provides a generalization of the local limit theorem on the convergence
of inhomogeneous Markov chains to the diffusion limit for the case in which the corresponding
coefficients of the process satisfy weak regularity conditions and coincide only asymptotically.
In particular, the drift coefficients under consideration can be unbounded with at most linear
growth, and the bounds reflect ...
Added: September 24, 2026
Pyatov P. N., Pivovarov P. A., / Series math "arxiv.org". 2026. No. 2609.06274.
We investigate a special ansats that allows for an iterative solution of the constant Yang-Baxter equation. Testing this ansatz, we construct four sequences of the constant R-matrices. In each sequence the R-matrices act on the tensor squares of vector spaces of linearly growing dimensions. Each R-matrix also depends on a single complex parameter.
By analyzing the ...
Added: September 24, 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
Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.
This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...
Added: January 23, 2026
D. S. Taletskii, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2025 Vol. 19 No. 1 P. 142–156
An eternal dominating set of a graph is a dominating set D on which mobile guards are initially located (at most one guard is allowed on any vertex). For any infinite sequence of attacks occurring sequentially at vertices, the set D can be modified by moving the guard from an adjacent vertex to the attacked ...
Added: November 26, 2025
Taletskii D., / Series arXiv "math". 2024.
The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such as outerplanar graphs, subcubic graphs and Ck-free graphs, where k ∈ {3, 4}. In ...
Added: December 31, 2024
Taletskii D., Дискретный анализ и исследование операций 2024 Т. 31 № 1 С. 109–128
The set of graph vertices J_k is called k-dominating independent (k > 1) if its vertices are pairwise adjacent and every vertex not from J_k is adjacent to at least k vertices from J_k. In the presentb paper we obtain new upper bounds for the number of k-dominating independent sets for k > 2 in ...
Added: March 25, 2024
Gribanov D., Shumilov I., Malyshev D. et al., Journal of Global Optimization 2024 Vol. 89 P. 1033–1067
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in P ∩ Zn , assuming that P is a polyhedron, defined by systems Ax ≤ b or Ax = b, x ≥ 0 with a sparse ...
Added: March 6, 2024
Ignatov D. I., , in: LNAI 14133: 28th International Conference on Conceptual Structures, ICCS 2023, Berlin, Germany, September 11–13, 2023, Proceedings. Graph-Based Representation and Reasoning.: Berlin: Springer, 2023. P. 56–69.
Set partitions and partition lattices are well-known objects in combinatorics and play an important role as a search space in many applied problems including ensemble clustering. Searching for antichains in such lattices is similar to that of in Boolean lattices. Counting the number of antichains in Boolean lattices is known as the Dedekind problem. In ...
Added: November 23, 2023