Related papers: Geometric conditions for matrix domination in two …
We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…
This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…
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…
Looking to the fundamental domains of space groups we can investigate in which space they can be realized. If this space is hyperbolic, then the corresponding space group is also hyperbolic. In addition to the usual methods for…
This note presents a sufficient condition for partial approximate ensemble controllability of a set of bilinear conservative quantum systems in an infinite dimensional Hilbert space. The proof relies on classical geometric and averaging…
In this paper, we study under which conditions the trajectories of a mechanical control system can track any curve on the configuration manifold. We focus on systems that can be represented as forced affine connection control systems and we…
With the aid of hypergraph transversals it is proved that $\gamma_t(Q_{n+1}) = 2\gamma(Q_n)$, where $\gamma_t(G)$ and $\gamma(G)$ denote the total domination number and the domination number of $G$, respectively, and $Q_n$ is the…
A vertex subset S of a graph G is said to 2-dominate the graph if each vertex not in S has at least two neighbors in it. As usual, the associated parameter is the minimum cardinal of a 2-dominating set, which is called the 2-domination…
We consider the multi-view data completion problem, i.e., to complete a matrix $\mathbf{U}=[\mathbf{U}_1|\mathbf{U}_2]$ where the ranks of $\mathbf{U},\mathbf{U}_1$, and $\mathbf{U}_2$ are given. In particular, we investigate the…
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the…
We present a topological proof of the existence of invariant manifolds for maps with normally hyperbolic-like properties. The proof is conducted in the phase space of the system. In our approach we do not require that the map is a…
We consider decomposition spaces $\R^3/G$ that are manifold factors and admit defining sequences consisting of cubes-with-handles. Metrics on $\R^3/G$ constructed via modular embeddings into Euclidean spaces promote the controlled topology…
In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
In the framework of a recently proposed topological approach to phase transitions, some sufficient conditions ensuring the presence of the spontaneous breaking of a Z_2 symmetry and of a symmetry-breaking phase transition are introduced and…
We prove a general criterion for a metric space to have conformal dimension one. The conditions are stated in terms of the existence of enough local cut points in the space. We then apply this criterion to the boundaries of hyperbolic…
A general maximum principle (necessary and sufficient conditions) for an optimal control problem governed by a stochastic differential equation driven by an infinite dimensional martingale is established. The solution of this equation takes…
We give a necessary condition on a geodesic in a Riemannian manifold that can run in some convex hypersurface. As a corollary we obtain peculiar properties that hold true for every convex set in any generic Riemannian manifold (M,g). For…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
In a graph $G$, a set $D\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the…