Related papers: Computable Scott Sentences for Quasi-Hopfian Finit…

Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexity separation but also confirm the…

In this paper, we study pointed rank one Hopf algebras and Hopf-Ore extensions of group algebras, over an arbitrary field $k$. It is proved that the rank of a Hopf-Ore extension of a group algebra is one or two or infinite. It is also shown…

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Let H be a finite-dimensional quasibialgebra. We show that H is a quasi-Hopf algebra if and only if the category of its finite-dimensional left modules is rigid if and only if a structure theorem for Hopf modules over H holds. We also show…

Let A and B be two connected graded commutative k-algebras of finite type, where k is a perfect field of positive characteristic p. We prove that the quasi--shuffle algebras generated by A and B are isomorphic as Hopf algebras if and only…

We show that the invariants of a free associative algebra of finite rank under a linear action of a finite-dimensional Hopf algebra generated by group-like and skew-primitive elements form a finitely generated algebra exactly when the…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

We study the pointed or copointed liftings of Nichols algebras associated to affine racks and constant cocycles for any finite group admitting a principal YD-realization of these racks. In the copointed case we complete the classification…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

We present a new manifestation of G\"odel's second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert's program. Specifically, we consider a proper extension of Peano arithmetic…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a…

Directed spaces are natural topological extensions of dcpos in domain theory and form a cartesian closed category. We will show that the D-completion of free algebras over a Scott space $\Sigma L$, on the context of directed spaces, are…

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

We introduce the notion of $\pi^2$-graded Hopf algebra, where the grading is by the double groupoid of commutative diagrams of a finite groupoid $\pi$. The finite dimensional representations of a $\pi^2$-graded Hopf algebra form a rigid…

We construct finite-dimensional Hopf algebras whose coradical is the group algebra of a central extension of an abelian group. They fall into families associated to a semisimple Lie algebra together with a Dynkin diagram automorphism. We…

A Hopf Galois structure on a finite field extension $L/K$ is a pair $(H,\mu)$, where $H$ is a finite cocommutative $K$-Hopf algebra and $\mu$ a Hopf action. In this paper we present a program written in the computational algebra system…

A Coxeter group is said to be \emph{$\mathbf{a}(2)$-finite} if it has finitely many elements of $\mathbf{a}$-value 2 in the sense of Lusztig. In this paper, we give explicit combinatorial descriptions of the left, right, and two-sided…

We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…