Related papers: Some Characterizations of Domination
We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…
A dominating set $D$ in a digraph is a set of vertices such that every vertex is either in $D$ or has an in-neighbour in $D$. A dominating set $D$ of a digraph is locating-dominating if every vertex not in $D$ has a unique set of…
A set $D \subseteq V(G)$ is a \emph{dominating set} of $G$ if every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set of $G$ of minimum cardinality is called a $\gamma(G)$-set. For each vertex $v \in V(G)$, we…
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 consider the set of H\"older continuous cocycles over a finite shift acting on a group of Lipschitz homeomorphisms Lip(G), where G is a metrisable compact topological group. We establish that two dominated cocycles that coincide over…
The domination number of a graph $G$, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set of $G$. A vertex of a graph is called critical if its deletion decreases the domination number, and a graph is called critical if…
The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…
Given an arbitrary graph G, we study its basic covers algebra, which is the symbolic fiber cone of the Alexander dual of the edge ideal of G. Extending results of Villarreal and Benedetti-Constantinescu-Varbaro, valid only in the case when…
We prove that a representation from the fundamental group of a closed surface of negative Euler characteristic with values in the isometry group of a Riemannian manifold of sectional curvature bounded by -1 can be dominated by a Fuchsian…
Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $\gamma_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total…
We show that every cycle in the degree $d$ algebraic cobordism group $\Omega_d(X)$ of a smooth projective variety $X$ over a field of characteristic $0$ is smoothable when $2d<\dim(X)$, that is, it can be written as a linear combination of…
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all…
Relatively dominated representations give a common generalization of geometrically finiteness in rank one on the one hand, and the Anosov condition which serves as a higher-rank analogue of convex cocompactness on the other. This note…
Zero-divisor graphs of commutative rings are well-represented in the literature. In this paper, we consider dominating sets, total dominating sets, domination numbers and total domination numbers of zero-divisor graphs. We determine the…
Let $A = \bigoplus_{n=0}^{\infty}A_n$ be a connected graded $k$-algebra over an algebraically closed field $k$ (thus $A_0=k$). Assume that a finite abelian group $G$, of order coprime to the characteristic of $k$, acts on $A$ by graded…
We extend and reformulate a result of Solomon on the divisibility of the title. We show, for example, that if $\Gamma$ is a finitely generated group, then $|G|$ divides $#\Hom(\Gamma,G)$ for every finite group $G$ if and only if $\Gamma$…
This paper studies a dominance relation among scoring rules with respect to avoiding the selection of the Condorcet loser. In a voting model with three or more alternatives, we say that a scoring rule $f$ Condorcet-loser-dominates…
In this paper we construct consistent examples of subgroups of $2^\omega$ with Menger remainders which fail to have other stronger combinatorial covering properties. This answers several open questions asked by Bella, Tokgoz and Zdomskyy…