Related papers: Relative Rips Machine
The aim of this paper is to investigate the homology groups of mathematical models of concurrency. We study the Baues-Wirsching homology groups of a small category associated with a partial monoid action on a set. We prove that these groups…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…
This paper proposes a bidirectional rapidly-exploring random trees (RRT) algorithm to solve the motion planning problem for hybrid systems. The proposed algorithm, called HyRRT-Connect, propagates in both forward and backward directions in…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees…
We provide a new representation of an $\mathbb R$-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
We attach a ring of sequences to each number from a certain class of extremal real numbers, and we study the properties of this ring both from an analytic point of view by exhibiting elements with specific behaviors, and also from an…
This is a survey article devoted to the study of real structures on complex algebraic varieties endowed with a reductive group action.
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In this paper we investigate the asymptotic optimality property of a randomized sampling based motion planner, namely RRT. We prove that a RRT planner is not an asymptotically optimal motion planner. Our result, while being consistent with…
We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…
Using an algebraic point of view we present an introduction to the groupoid theory, that is, we give fundamental properties of groupoids as, uniqueness of inverses and properties of the identities, and study subgroupoids, wide subgroupoids…
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…
Partial actions of Hopf algebras can be considered as a generalization of partial actions of groups on algebras. Among important properties of partial Hopf actions, it is possible to assure the existence of enveloping actions. This allows…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
We study probability-measure preserving (p.m.p.) actions of finitely generated groups via the graphings they define. We introduce and study the notion of isometric orbit equivalence for p.m.p. actions: two p.m.p. actions are isometric orbit…
Based mainly on examples of interest in mechanics, we define the notion of a polite group action. One may view this as not only trying to give a more general notion than properness of a group action, but also to more fully understand the…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We study linear actions of finite groups in small dimensions, up to equivariant birationality.