相关论文: A global domination principle for P-pluripotential…
We have introduced and studied in [3] the class of Globalized multiplicatively pinched-Dedekind domains (GMPD domains). This class of domains could be characterized by a certain factorization property of the non-invertible ideals, (see [3,…
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of…
In this note, by analyzing the behavior at infinity of the matrix symbol of an invariant operator $P$ with respect to a fixed elliptic operator, we obtain a necessary and sufficient condition to guarantee that $P$ is globally hypoelliptic.…
We introduce a notion of $(p,q)$-dominated multilinear operators which stems from the geometrical approach provided by $\Sigma$-operators. We prove that $(p,q)$-dominated multilinear operators can be characterized in terms of their behavior…
In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…
A $p$-Laplacian elliptic problem in the presence of both strongly singular and $(p-1)$-superlinear nonlinearities is considered. We employ bifurcation theory, approximation techniques and sub-supersolution method to establish the existence…
We characterize the validity of the Maximum Principle in bounded domains for fully nonlinear degenerate elliptic operators in terms of the sign of a suitably defined generalized principal eigenvalue. Here, maximum principle refers to the…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…
We extend certain classical theorems in pluripotential theory to a class of functions defined on the support of a $(1,1)$-closed positive current $T$, analogous to plurisubharmonic functions, called $T$-plurisubharmonic functions. These…
We prove that a (globally) subanalytic p-adic function which is locally Lipschitz continuous with some constant C is piecewise (globally on each piece) Lipschitz continuous with possibly some other constant, where the pieces can be taken…
One of the aims of this article is to provide a class of polynomial mappings for which the Jacobian conjecture is true. Also, we state and prove several global univalence theorems and present a couple of applications of them.
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating…
A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…
Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…
The phenomenon of superconvergence is proved for all freely infinitely divisible distributions. Precisely, suppose that the partial sums of a sequence of free identically distributed, infinitesimal random variables converge in distribution…
Hadamard's global inverse theorem provides conditions for a function to be globally invertible on Rn. In this note we show that the conditions are robust enough for the conclusion to hold even if we relax the conditions by removing the…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
It is shown that the ultimate version of the nonlinear Pietsch Domination Theorem remains true, even in a stronger presentation, if one of its hypotheses is removed. More precisely, we show that no trace of (sub)-homogeneity assumption is…
A total dominating set of a graph $G=(V,E)$ is a subset $D$ of $V$ such that every vertex in $V$ is adjacent to at least one vertex in $D$. The total domination number of $G$, denoted by $\gamma _t (G)$, is the minimum cardinality of a…
We show that strongly monotone systems of ordinary differential equations which have a certain translation-invariance property are so that all solutions converge to a unique equilibrium. The result may be seen as a dual of a well-known…