Related papers: Algorithmic detectability of iwip automorphisms
We present an effective algorithm for detecting automorphic orbits in free groups, as well as a number of algorithmic improvements of train tracks for free group automorphisms.
Given a free group of rank r >= 3 and two exponentially growing outer automorphisms {\psi} and {\phi} with dual lamination pairs {\Lambda^\pm}_{\psi} and {\Lambda^\pm}_{\phi} associated to them, which satisfy a notion of independence…
We establish the following non-abelian analogue of the Fundamental Theorem of Projective Geometry: the natural map from ${\rm{Aut}}(F_n)$ to the automorphism group of the free-factor complex $\mathcal{AF}_n$ is an isomorphism. We also prove…
An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…
We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity $m$, and use it to prove Wilf's conjecture holds whenever $m \le 18$. Our algorithm utilizes techniques from polyhedral…
The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a…
Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these, called Isomorphism With Restrictions, is to decide for two…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…
It is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F. It has recently been proven that type inhabitation remains undecidable even in the predicative fragment of…
Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
A map $\phi:M_m(\bC)\to M_n(\bC)$ is decomposable if it is of the form $\phi=\phi_1+\phi_2$ where $\phi_1$ is a CP map while $\phi_2$ is a co-CP map. It is known that if $m=n=2$ then every positive map is decomposable. Given an extremal…
This article presents a formal model demonstrating that genuine autonomy, the ability of a system to self-regulate and pursue objectives, fundamentally implies computational unpredictability from an external perspective. we establish…
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…
As AI systems are used in high-stakes applications, ensuring interpretability is crucial. Mechanistic Interpretability (MI) aims to reverse-engineer neural networks by extracting human-understandable algorithms to explain their behavior.…
Full waveform inversion (FWI) is an iterative identification process that serves to minimize the misfit of model-based simulated and experimentally measured wave field data, with the goal of identifying a field of parameters for a given…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
In this paper we study the existence of at least one non-inner automorphism of order p of a finite thin p-group, for any prime p.