English
Related papers

Related papers: Orientable quadratic equations in free metabelian …

200 papers

We first construct a linear basis for a free metabelian Poisson algebra generated by an arbitrary well-ordered set. It turns out that such a linear basis depends on the characteristic of the underlying field. Then we elaborate the method of…

Rings and Algebras · Mathematics 2019-07-16 Zerui Zhang , Yuqun Chen , L. A. Bokut

In this article we study constrained variational problems in one independent variable defined on the space of integral curves of a Frenet system in a homogeneous space G/H. We prove that if the Lagrangian is G-invariant and coisotropic then…

Differential Geometry · Mathematics 2007-05-23 James D. E. Grant , Emilio Musso

We discuss a rational version of a conjecture of Matiyasevich, Davis, and Putnam on the relative decidability of the finiteness problem for Diophantine equations with respect to the existence problem. We formulate a suspicion that for…

Number Theory · Mathematics 2007-05-23 Minhyong Kim

We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid $F$. It is also decidable whether or not a rational subset of $F$ is recognizable. We prove that a submonoid of $F$ is rational if and…

Group Theory · Mathematics 2022-11-14 Pedro V. Silva

The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…

Logic in Computer Science · Computer Science 2018-02-05 Joel Day , Vijay Ganesh , Paul He , Florin Manea , Dirk Nowotka

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

Group Theory · Mathematics 2007-05-23 Mark Kambites , Pedro V. Silva , Benjamin Steinberg

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Group Theory · Mathematics 2017-11-28 Laurent Bartholdi , Ivan Mitrofanov

We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining…

Number Theory · Mathematics 2007-05-23 Toby Ord , Tien D. Kieu

We establish the $L_p$-solvability for time fractional parabolic equations when coefficients are merely measurable in the time variable. In the spatial variables, the leading coefficients locally have small mean oscillations. Our results…

Analysis of PDEs · Mathematics 2019-01-03 Hongjie Dong , Doyoon Kim

Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…

Number Theory · Mathematics 2021-04-15 Kartas Konstantinos

We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.

Group Theory · Mathematics 2019-10-28 Alexandr Yu. Olshanskii , Mark V. Sapir

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

Group Theory · Mathematics 2012-05-14 Zoran Sunic , Enric Ventura

The main aim of this article is to find all solutions of the Diophantine equation $x^2 + p^k=y^n$ where $p \equiv 1 \pmod 4$, $\frac{p-1}{3}$ is a perfect square and the class number of $\mathbb{Z}[\sqrt{-p}]$ is $2$. In this article, I…

Number Theory · Mathematics 2024-03-25 Arkabrata Ghosh

Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…

Group Theory · Mathematics 2007-05-23 Dimitri Bormotov , Robert Gilman , Alexei Myasnikov

An asymptotic formula for the number of prime solutions of a general diagonal system of Diophantine equations is established, contingent on the existence of an appropriate mean value bound and on local solvability. In conjunction with the…

Number Theory · Mathematics 2026-01-21 Alan Talmage

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

Computational Complexity · Computer Science 2016-11-07 Shaull Almagor , Joël Ouaknine , James Worrell

We generalize the positive solution of the Frobenius conjecture and refinements thereof by studying the structure of groups that admit a fix-point-free automorphism satisfying an identity. We show, in particular, that for every polynomial…

Group Theory · Mathematics 2020-09-10 Wolfgang Alexander Moens

Every abelian (and even every nilpotent) group contains a solution of any finite unimodular system of equations over itself. However, this is not true for infinite systems. We deduced a criterion for a periodic abelian group to contain a…

Group Theory · Mathematics 2026-01-13 Mikhail A. Mikheenko

Several aspects of relations between braces and non-degenerate involutive set-theoretic solutions of the Yang-Baxter equation are discussed and many consequences are derived. In particular, for each positive integer $n$ a finite square-free…

Rings and Algebras · Mathematics 2012-05-17 Ferran Cedo , Eric Jespers , Jan Okninski

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner