Related papers: Algorithmic problems for differential polynomial a…

The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…

We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…

In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.

We compute arithmetic support of the formal deformations $D=P+tQ_1+t^2Q_2+...$ of the differential operator $P=(x\partial_x-r_1)...(x\partial_x-r_k)$, where $r_1,...,r_k\in\mathbb{Q}$ for sufficiently large primes $p$ in terms of the…

We show that it is impossible to algorithmically decide if the l^2-cohomology of the universal cover of a finite CW complex is trivial, even if we only consider complexes whose fundamental group is equal to the elementary amenable group…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

We have been working in many aspects of the problem of analyzing, understanding and solving ordinary differential equations (first and second order). As we have extensively mentioned, while working in the Darboux type methods, the most…

Machine Learning models incorporating multiple layered learning networks have been seen to provide effective models for various classification problems. The resulting optimization problem to solve for the optimal vector minimizing the…

We investigate the obstacle problem for a class of nonlinear equations driven by nonlocal, possibly degenerate, integro-differential operators, whose model is the fractional $p$-Laplacian operator with measurable coefficients. Amongst other…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Let $G$ be a finite group given as input by its multiplication table. For a subset $S$ of $G$ and an element $g\in G$ the Cayley Group Membership Problem (denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$. While this…

Let $G$ be the identity component of the isometry group for an arbitrary curved two-point homogeneous space $M$. We consider algebras of $G$-invariant differential operators on bundles of unit spheres over $M$. The generators of this…

Noetherian operators are differential operators that encode primary components of a polynomial ideal. We develop a framework, as well as algorithms, for computing Noetherian operators with local dual spaces, both symbolically and…

We revisit the membership problem for subclasses of rational relations over finite and infinite words: Given a relation R in a class C_2, does R belong to a smaller class C_1? The subclasses of rational relations that we consider are formed…