Related papers: Geometric conditions for matrix domination in two …
We define a condition called almost strict domination for pairs of representations $\rho_1:\pi_1(S_{g,n})\to \textrm{PSL}(2,\mathbb{R})$, $\rho_2:\pi_1(S_{g,n})\to G$, where $G$ is the isometry group of a Hadamard manifold $(X,\nu)$, and…
We show that a cocycle has a dominated splitting if and only if there is a uniform exponential gap between singular values of its iterates. Then we consider sets $\Sigma$ in $GL(d,\mathbb{R})$ with the property that any cocycle with values…
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…
The kinematics of a robot manipulator are described in terms of the mapping connecting its joint space and the 6-dimensional Euclidean group of motions $SE(3)$. The associated Jacobian matrices map into its Lie algebra $\mathfrak{se}(3)$,…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
The necessary and sufficient conditions for a three-dimensional Riemannian metric to admit a transitive group of isometries are obtained. These conditions are Intrinsic, Deductive, Explicit and ALgorithmic, and they offer an IDEAL labeling…
We present a new proof of the existence of normally hyperbolic manifolds and their whiskers for maps. Our result is not perturbative. Based on the bounds on the map and its derivative, we establish the existence of the manifold within a…
A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\ldots,S_k$ such that the size of each unit $S_i$ is $r$ and the subgraph of $G$ induced by $S_i$ is connected. The concept of…
We investigate boundedness of hyperbolic components in the moduli space of Newton maps. For quartic maps, (i) we prove hyperbolic components possessing two distinct attracting cycles each of period at least two are bounded, and (ii) we…
In this paper we discuss constraints on two-dimensional quantum-mechanical systems living in domains with boundaries. The constrains result from the requirement of hermicity of corresponding Hamiltonians. We construct new two-dimensional…
The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…
In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $\gamma_{\times 2}(G)$ is…
Necessary conditions for existence of normal extremals in optimal control of systems subject to nonholonomic constraints are derived as solutions of a constrained second order variational problems. In this work, a geometric interpretation…
For any closed oriented hyperbolic $3$-manifold $M$, and any closed oriented $3$-manifold $N$, we will show that $M$ admits a finite cover $M'$, such that there exists a degree-$2$ map $f:M'\rightarrow N$, i.e. $M$ virtually $2$-dominates…
We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…
A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\gamma_{t2}(G)$ of a semitotal dominating set…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…
Anosov representations give a higher-rank analogue of convex cocompactness in a rank-one Lie group which shares many of its good geometric and dynamical properties; geometric finiteness in rank one may be seen as a controlled weakening of…
In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…
A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying…