相关论文: Decidability of the isomorphism problem between mu…

Multistability is a phenomenon prevalent in many natural systems. In climate, for example, it allows the possibility of irreversible consequences on planetary scale as a result of climate change. Indeed, a climate ``tipping element'' is a…

We introduce an algebraic structure which encodes a collection of countable graphs through a set of states, generators and relations. These structures, which we call blueprints, can capture standard algebraic objects such as groups, monoids…

We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…

Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove…

We study two relations on multi-dimensional subshifts: A pre-order based on the patterns configurations contain and the Cantor-Bendixson rank. We exhibit several structural properties of two-dimensional subshifts: We characterize the…

Predicting the evolution of a large system of units using its structure of interaction is a fundamental problem in complex system theory. And so is the problem of reconstructing the structure of interaction from temporal observations. Here,…

We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…

In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…

In order to investigate the evolutionary process of many deterministic Dynamical systems with unfixed parameter, a set of dynamical models with parameter changing continuously and the accumulation of this change might be large is introduced…

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

We classify all isomorphisms between moduli stacks of vector bundles of fixed determinant on a smooth complex projective of genus at least 4. It is shown that each isomorphism between two different moduli stacks can be described as a…

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when…

For dynamical systems that switch between different modes of operation, parameter variation can cause periodic solutions to lose or acquire new switching events. When this causes the eigenvalues (stability multipliers) associated with the…

Let X be a flexible variety of F be an isomorphism of closed one-dimensional subschemes of $X$. We develop criteria which guarantee that F extends to au automorphism of X.

The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…