Related papers: Grouped Stirling complexes
Assembly of large scale structural systems in space is understood as critical to serving applications that cannot be deployed from a single launch. Recent literature proposes the use of discrete modular structures for in-space assembly and…
Given a Lie group G whose Lie algebra is endowed with a nondegenerate invariant symmetric bilinear form, we construct a Poisson algebra of continuous functions on a certain open subspace R of the space of representations in G of the…
A subset $S$ of vertices of a graph $G=(V,E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by $\psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$ and…
Let M and N be even-dimensional oriented real manifolds, and $u:M \to N$ be a smooth mapping. A pair of complex structures at M and N is called u-compatible if the mapping u is holomorphic with respect to these structures. The quotient of…
Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…
In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given…
Designing robotic systems that can change their physical form factor as well as their compliance to adapt to environmental constraints remains a major conceptual and technical challenge. To address this, we introduce the Granulobot, a…
In this paper, we present a heterogeneous robot swarm system that can physically couple with each other to form functional structures and dynamically decouple to perform individual tasks. The connection between robots can be formed with a…
We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in…
Robots exhibit a rich variety of symmetries arising from their mechanical structure and the properties of their tasks. Although many robotics problems exhibit several symmetries simultaneously, existing approaches typically treat them in…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Let $G$ be a Lie group, with an invariant non-degenerate symmetric bilinear form on its Lie algebra, let $\pi$ be the fundamental group of an orientable (real) surface $M$ with a finite number of punctures, and let $\bold C$ be a family of…
We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V(G)$, $\left|N[v] \cap X\right| \le k$, where $N[v]$ is the…
Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…
We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this…
Many recent results in combinatorics concern the relationship between the size of a set and the number of distances determined by pairs of points in the set. One extension of this question considers configurations within the set with a…
Many physically important mechanical systems may be described with a Lie group $G$ as configuration space. According to the well-known Noether's theorem, underlying symmetries of the Lie group may be used to considerably reduce the…
If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
Planning for multi-robot teams in complex environments is a challenging problem, especially when these teams must coordinate to accomplish a common objective. In general, optimal solutions to these planning problems are computationally…