Related papers: Some Characterizations of Domination

It is well known that a $\mathrm{SL}(2,\mathbb{C})$-sequence is uniformly hyperbolic if and only it satisfies a uniform exponential growth condition. Similarly, for $\mathrm{GL}(2,\mathbb{C})$-sequences whose determinants are uniformly…

For infinite-dimensional quasi-compact cocycles over a map satisfying a certain closing condition, we show that periodic orbits carry enough information to guarantee the existence of a dominated splitting. More precisely, we establish that…

We consider the problem of approximating a linear cocycle (or, more generally, a vector bundle automorphism) over a fixed base dynamics by another cocycle admitting a dominated splitting. We prove that the possibility of doing so depends…

We prove that a generic linear cocycle over a minimal base dynamics of finite dimension has the property that the Oseledets splitting with respect to any invariant probability coincides almost everywhere with the finest dominated splitting.…

We relate dominated splitting for a linear multiplicative cocyle with dominated splitting for the exterior powers of this cocycle. For a C1 vector field X on a 3-manifold, we can obtain singular-hyperbolicity using only the tangent map DX…

We show that a $\mathrm{GL}(d,\mathbb{R})$ cocycle over a hyperbolic system with constant periodic data has a dominated splitting whenever the periodic data indicates it should. This implies global periodic data rigidity of generic Anosov…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

We show that on a dense open set of analytic one-frequency complex valued cocycles in arbitrary dimension Oseledets filtration is either dominated or trivial. The underlying mechanism is different from that of the Bochi-Viana Theorem for…

Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…

A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these…

In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The Inverse Domination Conjecture says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with…

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this case, we call the pair…

Let G=(V,E) be a simple graph. A set S\subset V is a dominating set of G, if every vertex in V\S is adjacent to at least one vertex in S. Let {\mathcal C}_n^i be the family of dominating sets of a cycle C_n with cardinality i, and let…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…

Hyperbolicity and dominated splitting are two of the most important concepts in the global analysis of differentiable dynamics. In this paper we give several equivalent characterizations of the dominated splitting and in particular we show…

Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$. We provide a characterization of a…

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$ other than a directed cycle. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…

In this paper, we first develop a notion of dominated splitting for $\mathbb M(2,\mathbb C)$-sequences and show it is a stable property under $\|\cdot \|_\infty$-perturbation. Then we show an energy parameter belongs to the spectrum of a…