Related papers: The Isomorphism Problem On Classes of Automatic St…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
We contribute to the program of extending computable structure theory to the realm of metric structures by investigating lowness for isometric isomorphism of metric structures. We show that lowness for isomorphism coincides with lowness for…
We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of…
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restricted space algorithms for these problems proving the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Generically an almost complex structure has no symmetries at all, but there exist symmetric structures. In this paper we describe how to guarantee that the pseudogroup of local symmetries is small (finite-dimensional). It will be indicated…
Minimizing the size of finite automata is a fundamental problem in theoretical computer science. Beyond standard minimization, further reductions can be achieved by decomposing an automaton into smaller components whose languages combine…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group and so on, iterating transfinitely. Each group maps into the next using inner automorphisms and one takes a direct limit…
The topological and metrical equivalence of fractals is an important topic in analysis. In this paper, we use a class of finite state automata, called $\Sigma$-automaton, to construct psuedo-metric spaces, and then apply them to the study…
This paper addresses the isomorphism problem for the universal (nonself-adjoint) operator algebras generated by a row contraction subject to homogeneous polynomial relations. We find that two such algebras are isometrically isomorphic if…
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of…
We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…
Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…
For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…