Related papers: An algorithm to identify automorphisms which arise…
We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from…
In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…
Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…
Figural analogy problems have long been a widely used format in human intelligence tests. In the past four decades, more and more research has investigated automatic item generation for figural analogy problems, i.e., algorithmic approaches…
In this paper we introduce a method for finding a time independent Hamiltonian of a given dynamical system by canonoid transformation. We also find a condition that the system should satisfy to have an equivalent time independent…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
Let E denote the group of all interval exchange transformations on [0,1). Given a suitable topological group structure on E, it is possible to classify all one-parameter interval exchange actions (continuous homomorphisms from R to E). In…
In this paper, the problem formulated in [8] is solved. We prove, that the group of automorphisms of the category of free associative algebras is generated by semi-inner and mirror automorphisms
An outer automorphism of a free group is geometric if it can be represented by a homeomorphism of a compact surface. Bestvina and Handel gave an algorithmic characterization of geometric irreducible outer automorphisms using relative train…
We determine the geometric structure of a minimal projective threefold having two `independent and commutative' automorphisms of positive topological entropy, and generalize this result to higher-dimensional smooth minimal pairs (X, G). As…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
This study covers an analytical approach to calculate positively invariant sets of dynamical systems. Using Lyapunov techniques and quantifier elimination methods, an automatic procedure for determining bounds in the state space as an…
Statistical learning relies upon data sampled from a distribution, and we usually do not care what actually generated it in the first place. From the point of view of causal modeling, the structure of each distribution is induced by…
It is shown that a random binary process with impulse-like autocorrelation can be generated by randomizing the length of symbols occurring in a random Bernoulli process. Such randomization is achieved by random (or judiciously designed…
We prove that every simplicial automorphism of the free splitting graph of a free group of at least rank 3 is induced by an outer automorphism of the free group.
It is generally believed that in a situation where individual and collective interests are in conflict, the availability of optional participation is a key mechanism to maintain cooperation. Surprisingly, this effect is sensitive to the use…
In a recent paper (A. Mitsopoulos and M. Tsamparlis, J. Geom. Phys. 170, 104383, 2021), a general theorem is given which provides an algorithmic method for the computation of first integrals (FIs) of autonomous dynamical systems in terms of…