Related papers: Geometric conditions for matrix domination in two …
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…
A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…
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…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent…
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
It is shown in this paper that given any closed oriented hyperbolic 3-manifold, every closed oriented 3-manifold is mapped onto by a finite cover of that manifold via a map of degree 1, or in other words, virtually 1-dominated by that…
Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…
We prove that for generic three-dimensional vector fields, domination implies singular hyperbolicity.
We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…
We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
In covariant metric theories of coupled gravity-matter systems the necessary and sufficient conditions ensuring the existence of a Killing vector field are investigated. It is shown that the symmetries of initial data sets are preserved by…
For a given class of structured matrices $\mathbb S$, we find necessary and sufficient conditions on vectors $x,w\in \C^{n+m}$ and $y,z \in \C^{n}$ for which there exists $\Delta=[\Delta_1~\Delta_2]$ with $\Delta_1 \in \mathbb S$ and…
In some significant applications such as data forecasting, the locations of missing entries cannot obey any non-degenerate distributions, questioning the validity of the prevalent assumption that the missing data is randomly chosen…
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
We apply the algebraic-geometric techniques developed for the study of mappings which have the singularity confinement property to mappings which are integrable through linearisation. The main difference with respect to the previous studies…
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a…