Related papers: An algorithm to identify automorphisms which arise…
We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…
Let $\mathsf P$ be an operad acted upon by a group $G$, and let $\mathsf Q=\mathsf P\rtimes G$ be the corresponding framed operad. We relate the homotopy automorphism groups of $\mathsf P$ and $\mathsf Q$. We apply the result to compute the…
We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…
Let $G$ be a group. An automorphism of $G$ is called intense if it sends each subgroup of $G$ to a conjugate; the collection of such automorphisms is denoted by $\mathrm{Int}(G)$. In the special case in which $p$ is a prime number and $G$…
A hallmark of living systems is the ability to employ a common set of versatile building blocks that can self-organize into a multitude of different structures, in a way that can be controlled with minimal cost. This capability can only be…
An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…
The design of decision and control strategies for switched systems typically requires complete knowledge of (i) mathematical models of the subsystems and (ii) restrictions on admissible switches between the subsystems. We propose an active…
For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…
In this paper, we propose a decision making algorithm for autonomous vehicle control at a roundabout intersection. The algorithm is based on a game-theoretic model representing the interactions between the ego vehicle and an opponent…
We construct a `nice' subcomplex of the Outer Space for a free product in order to give a geometric proof that the pure symmetric outer automorphisms of a given splitting of a free product are generated by factor outer automorphisms and…
Let $G$ be a connected semisimple algebraic group of adjoint type over the field $\mathbb{C}$ of complex numbers and $B$ be a Borel subgroup of $G.$ Let $F$ be an irreducible projective $B$-variety. Then consider the variety…
This paper considers the problem of evaluating an autonomous system's competency in performing a task, particularly when working in dynamic and uncertain environments. The inherent opacity of machine learning models, from the perspective of…
We demonstrate the possibility of classifying causal systems into kinds that share a common structure without first constructing an explicit dynamical model or using prior knowledge of the system dynamics. The algorithmic ability to…
We study the behaviour of discrete dynamical systems generated by a continuous map $f$ of a compact real interval into itself where at randomly chosen times a function different from $f$ - so called impulse function is applied. We show that…
In this paper we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of Differential Evolution is derived. It is then demonstrated that, under some assumptions on the…
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in…
Traffic simulators are important tools in autonomous driving development. While continuous progress has been made to provide developers more options for modeling various traffic participants, tuning these models to increase their behavioral…
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…
We investigate the question of which growth rates are possible for the number of periodic points of a compact group automorphism. Our arguments involve a modification of Linnik's Theorem, concerning small prime numbers in arithmetic…