Related papers: Orbit automata as a new tool to attack the order p…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
We describe the orbit structure for the action of the centralizer group of a linear operator on a finite-dimensional complex vector space. The main application is to the classification of solutions to a system of first-order ODEs with…
A Behavior Tree (BT) is a way to structure the switching between different tasks in an autonomous agent, such as a robot or a virtual entity in a computer game. BTs are a very efficient way of creating complex systems that are both modular…
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…
We apply the orbit method to obtain formula for multiplicities of certain representations of unipotent groups over the finite field.
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
This paper introduces the notion of orbit coherence in a permutation group. Let $G$ be a group of permutations of a set $\Omega$. Let $\pi(G)$ be the set of partitions of $\Omega$ which arise as the orbit partition of an element of $G$. The…
A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract…
In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…
The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique…
We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a…
In this paper we use group, action and orbit to understand how evolutionary solve nonconvex optimization problems.
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…
Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…
Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called the automorphism orbits of $G$, and their number is denoted by $\omega(G)$. Let $\mathbb{F}$ be an infinite field, and let $UT_n(\mathbb{F})$ denote the…
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…