Related papers: On some open problems in commutative algebra resol…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
We present a number of questions in commutative algebra posed on the problem solving seminar in algebra at Stockholm University during the period Fall 2014 - Spring 2017.
Holt and R\"over proved that finitely generated bounded automata groups have indexed co-word problem. Here we sharpen this result to show they are in fact co-ET0L.
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…
This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…
We discuss the theory of Lie algebras in Lean's Mathlib library. Using nilpotency as the theme, we outline a computer formalisation of Engel's theorem and an application to root space theory. We emphasise that all arguments work with…
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…
Let A be the integral closure of the ring of polynomials CC[t], within the field of algebraic functions in one variable. We show that A interprets the ring of integers. This contrasts with the analogue for finite fields, proved to have a…
Let $R$ be a commutative $k-$algebra over a field $k$. Assume $R$ is a noetherian, infinite, integral domain. The group of $k-$automorphisms of $R$,i.e.$Aut_k(R)$ acts in a natural way on $(R-k)$.In the first part of this article, we study…
We investigate a "deep zero problem" proposed by Hedenmalm. We show that there is a natural connection between Hedenmalm's problem and the classical HRT conjecture in time-frequency analysis. This connection allows us to show that…
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete. One of the main difficulties of the problem is the lack of…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We obtain the the existence of global solutions to the Cauchy problem of the Fokas-Lenells (FL) equation on the line \begin{align} &u_{xt}+\alpha\beta^2u-2i\alpha\beta u_x-\alpha u_{xx}-i\alpha\beta^2|u|^2u_x=0,\nonumber \\…
Let $D$ be a bounded logarithmically convex complete Reinhardt domain in $\mathbb{C}^n$ centered at the origin. Generalizing a result for the one-dimensional case of the unit disk, we prove that the $C^*$-algebra generated by Toeplitz…
We study symplectic linear algebra over the ring $\Rt$ of Colombeau generalized numbers. Due to the algebraic properties of $\Rt$ it is possible to preserve a number of central results of classical symplectic linear algebra. In particular,…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
We apply the new theory of cluster algebras of Fomin and Zelevinsky to study some combinatorial problems arising in Lie theory. This is joint work with Geiss and Schr\"oer (3, 4, 5, 6), and with Hernandez (8, 9).