Related papers: The Isomorphism Problem On Classes of Automatic St…
Our starting point is the observation that if graphs in a class C have low descriptive complexity in first order logic, then the isomorphism problem for C is solvable by a fast parallel algorithm (essentially, by a simple combinatorial…
In this article, we completely determine the isomorphism classes of lattice vertex operator algebras and the vertex operator subalgebras fixed by a lift of the -1-isometry of the lattice. We also provide similar results for certain even…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs $G$ and $H$, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list…
Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…
We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large…
Wilhelm (2021) has recently defended a criterion for comparing structure of mathematical objects, which he calls Subgroup. He argues that Subgroup is better than SYM * , another widely adopted criterion. We argue that this is mistaken;…
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
This paper studies the loop algebras that arise from pairs consisting of a symmetrizable Kac-Moody Lie algebra $\g$ and a finite order automorphism $\sigma$ of $\g$. We obtain necessary and sufficient conditions for two such loop algebras…
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…
Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…
Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…
First-order automatic differentiation is a ubiquitous tool across statistics, machine learning, and computer science. Higher-order implementations of automatic differentiation, however, have yet to realize the same utility. In this paper I…
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…
The paper aims to investigate the classification problem of low dimensional complex none Lie filiform Leibniz algebras. There are two sources to get classification of filiform Leibniz algebras. The first of them is the naturally graded none…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
Let F_n be the free group of rank n, with generating set S=\{x_1,...,x_n\}. An automorphism \phi of F_n is called symmetric if for each 1\leq i\leq n, \phi(x_i) is conjugate to x_j or x_j^{-1} for some 1\leq j\leq n. Let \Sigma Aut(F_n) be…
We investigate the problem of type isomorphisms in a programming language with higher-order references. We first recall the game-theoretic model of higher-order references by Abramsky, Honda and McCusker. Solving an open problem by Laurent,…