Related papers: Geometric conditions for matrix domination in two …
In this paper, we characterize the accessibility of discrete-time linear control systems on Lie groups. Using an exceptional notion of derivative, we construct a subalgebra $\mathfrak{h}$ based on the infinitesimal automorphism of the…
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E' of E which dominates all edges of G. In particular, if every edge of G is dominated by…
In this work we study constant-coefficient first order systems of partial differential equations and give necessary and sufficient conditions for those systems to have a well posed Cauchy Problem. In many physical applications, due to the…
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded…
We describe a new type of sufficient condition for a balanced bipartite digraph to be hamiltonian. Let $D$ be a balanced bipartite digraph and $x,y$ be distinct vertices in $D$. $\{x, y\}$ dominates a vertex $z$ if $x\rightarrow z$ and…
A condition of geometric modular action is proposed as a selection principle for physically interesting states on general space-times. This condition is naturally associated with transformation groups of partially ordered sets and provides…
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…
In this paper, I present some sufficient conditions for projective hypersurfaces to be GIT (semi-)stable. These conditions will be presented in terms of dimension and degree of the hypersurfaces, dimension of the singular locus and…
A dominating set of a graph $G$ is a set $D\subseteq V(G)$ such that \-every vertex of $G$ is either in $D$ or is adjacent to a vertex in $D$. The domination number of $G$, $\gamma(G)$, is the minimum order of a dominating set. A subset $R$…
We provide sufficient conditions for two subgroups of a hierarchically hyperbolic group to generate an amalgamated free product over their intersection. The result applies in particular to certain geometric subgroups of mapping class groups…
We derive necessary and sufficient conditions for leader-follower multi-agent systems such that we can further apply prescribed performance control to achieve the desired formation while satisfying certain transient constraints. A…
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through…
We consider the well-posedness of a class of hyperbolic partial differential equations on a one dimensional spatial domain. This class includes in particular infinite-dimensional networks of transport, wave and beam equations, or even…
The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power…
We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the…
We state necessary and sufficient conditions for the existence of $T$-discrete exponential attractors for semigroups in complete metric spaces. These conditions are formulated in terms of a covering condition for iterates of the absorbing…
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…
A closed convex conic subset $\mathcal{S}$ of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The ROG property of $\mathcal{S}$ is closely related to the…
We give a sufficient condition on a pair of (primitive) integral polynomials that the associated hypergeometric group (monodromy group of the corresponding hypergeometric differential equation) is an arithmetic subgroup of the integral…