相关论文: Decidability of the isomorphism problem between mu…
We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
This paper is a step towards the complete topological classification of {\Omega}-stable diffeomorphisms on an orientable closed surface, aiming to give necessary and sufficient conditions for two such diffeomorphisms to be topologically…
Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We…
Motivated by questions from program transformations, eight notions of isomorphisms between term rewriting systems are defined, analysed, and classified. The notions include global isomorphisms, where the renaming of variables and function…
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts.
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract information about the rational eigenvalues of these systems…
A morphism of a category which is simultaneously an epimorphism and a monomorphism is called a bimorphism. In \cite{DR2} we gave characterizations of monomorphisms (resp. epimorphisms) in arbitrary pro-categories, pro-(C), where (C) has…
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
Session types are behavioural types for guaranteeing that concurrent programs are free from basic communication errors. Recent work has shown that asynchronous session subtyping is undecidable. However, since session types have become…
Differentiable conjugacies link dynamical systems that share properties such as the stability multipliers of corresponding orbits. It provides a stronger classification than topological conjugacy, which only requires qualitative similarity.…