Related papers: Factorization, majorization, and domination for li…
We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in…
We extend Lerner's recent approach to sparse domination of Calder\'on--Zygmund operators to upper doubling (but not necessarily doubling), geometrically doubling metric measure spaces. Our domination theorem is different from the one…
This study conducts a comprehensive bibliometric analysis of research on domination in graph theory from 1961 to 2024, based on Scopus-indexed publications retrieved using the query (dominating OR domination) AND graph. The analysis…
In this paper, we show that the Italian domination number of every lexicographic product graph $G\circ H$ can be expressed in terms of five different domination parameters of $G$. These parameters can be defined under the following unified…
The occurrence of discrimination is an important problem in the social and economical sciences. Much of the discrimination observed in empirical studies can be explained by the theory of in-group favoritism, which states that people tend to…
In this article, we study questions of uniqueness of form extension for certain magnetic Schr\"odinger forms. The method is based on the theory of ordered Hilbert spaces and the concept of domination of semigroups. We review this concept in…
We study a variant of domination, called Roman domination, where we must assign to each vertex one of the labels 0, 1, or 2 and require that every vertex with label 0 has a neighbour with label 2. We study the problem of finding a low-cost…
We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…
Let F be a right Hilbert C*-module over a C*-algebra B, and suppose that F is equipped with a left action, by compact operators, of a second C*-algebra A. Tensor product with F gives a functor from Hilbert C*-modules over A to Hilbert…
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…
Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…
We find conditions on ideals of an algebra under which the algebra is dibaric. Dibaric algebras have not non-zero homomorphisms to the set of the real numbers. We introduce a concept of bq-homomorphism (which is given by two linear maps $f,…
Given self-adjoint operators $A, B\in\mathbb{B}(\mathscr{H})$ it is said $A\leq_uB$ whenever $A\leq U^*BU$ for some unitary operator $U$. We show that $A\leq_u B$ if and only if $f(g(A)^r)\leq_uf(g(B)^r)$ for any increasing operator convex…
We present a form convergence theorem for sequences of sectorial forms and their associated semigroups in a complex Hilbert space. Roughly speaking, the approximating forms $a_n$ are all `bounded below' by the limiting form $a$, but in…
We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in…
We study multivariate approximation defined over tensor product Hilbert spaces. The domain space is a weighted tensor product Hilbert space with exponential weights which depend on two sequences $\boldsymbol{a}=\{a_j\}_{j\in\mathbb{N}}$ and…
We present an approach to the factorization method for second order difference equations on time scales. We construct Hilbert spaces of functions on the time scale and show how to construct a chain of intertwined first order…
For operators representing ill-posed problems, an ordering by ill-posedness is proposed, where one operator is considered more ill-posed than another one if the former can be expressed as a cocatenation of bounded operators involving the…
The orientable domination number, ${\rm DOM}(G)$, of a graph $G$ is the largest domination number over all orientations of $G$. In this paper, ${\rm DOM}$ is studied on different product graphs and related graph operations. The orientable…