Related papers: Geometric conditions for matrix domination in two …

Four geometric conditions on a geodesic metric space, which are stronger variants of classical conditions characterizing hyperbolicity, are proved to be equivalent. In the particular case of the Cayley graph of a finitely generated group,…

We prove that uniform hyperbolicity is invariant under topological conjugacy for dissipative polynomial automorphisms of C^2. Along the way we also show that a sufficient condition for hyperbolicity is that local stable and unstable…

Let $G$ be a graph with no isolated vertices. A set of vertices $S$ is a total dominating set (TDS) if every vertex in $G$ is adjacent to at least one vertex in $S$. We say $G$ is well-totally dominated (WTD) if every minimal TDS has the…

Dominators provide a general mechanism for identifying reconverging paths in graphs. This is useful for a number of applications in Computer-Aided Design (CAD) including signal probability computation in biased random simulation, switching…

This article presents a simple characterization for entangled vectors in a finite dimensional Hilbert space $H$. The characterization is in terms of the coefficients of an expansion of the vector relative to an orthonormal basis for $H$.…

We study the convergence of graphs consisting of finitely many internal rays for degenerating Newton maps. We state a sufficient condition to guarantee the convergence. As an application, we investigate the boundedness of hyperbolic…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

We say that a cover of surfaces S -> X has the Birman--Hilden property if the subgroup of the mapping class group of X consisting of mapping classes that have representatives that lift to S embeds in the mapping class group of S modulo the…

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…

Necessary and sufficient conditions for bipartite entanglement are derived, which apply to arbitrary Hilbert spaces. Motivated by the concept of witnesses, optimized entanglement inequalities are formulated solely in terms of arbitrary…

An analysis of necessary conditions for the existence of controlled dynamics with an attractor of a specified topological type is given. It uses the Hopf classification by degree for Gauss maps of manifolds to spheres of the same dimension,…

We give a set of sufficient and necessary conditions for parabolicity and hyperbolicity of a submanifold with controlled mean curvature in a Riemannian manifold with a pole and with sectional curvatures bounded from above or from below.

For a Riemannian submersion from a simple compact Lie group with a bi-invariant metric, we prove the action of its holonomy group on the fibers is transitive. As a step towards classifying Riemannian submersions with totally geodesic…

We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…

Given a functional for a one-dimensional physical system, a classical problem is to minimize it by finding stationary solutions and then checking the positive definiteness of the second variation. Establishing the positive definiteness is,…

For two real symmetric matrices, their eigenvalue configuration is therelative arrangement of their eigenvalues on the real line. We consider the following problem: given two parametric real symmetric matrices and an eigenvalue…

In a graph $G$, a vertex dominates itself and its neighbours. 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 minimum cardinality among all double dominating…