Related papers: Explicit solutions of certain orientable quadratic…

We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…

Let $G$ be the cyclic group of order $n$ and suppose ${\bf F}$ is a field containing a primitive $n^\text{th}$ root of unity. We consider the ring of invariants ${\bf F}[W]^G$ of a three dimensional representation $W$ of $G$ where $G…

After tersely reviewing the various meanings that can be given to the property of a system of nonlinear ODEs to be solvable, we identify a special case of the system of two first-order ODEs with homogeneous quadratic right-hand sides which…

Using the theory developed by Olga Kharlampovich, Alexei Miasnikov, and, independently, by Zlil Sela to describe the set of homomorphisms of a f.g. group G into a free group F, we describe the solutions to equations with coefficients from F…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…

The solution $x_n\left(t\right)$, $n=1,2,$ of the \textit{initial-values} problem is reported of the \textit{autonomous} system of $2$ coupled first-order ODEs with \textit{homogeneous cubic polynomial} right-hand sides, \begin{eqnarray}…

In this short communication we introduce a rather simple autonomous system of 2 nonlinearly-coupled first-order Ordinary Differential Equations (ODEs), whose initial-values problem is explicitly solvable by algebraic operations. Its ODEs…

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. It is known that if $G$ is amenable then $R$ satisfies the Ore condition: for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It is also true…

For a given quadratic equation with any number of unknowns in any free group F, with right-hand side an arbitrary element of F, an algorithm for solving the problem of the existence of a solution was given by Culler. The problem has been…

We prove that in a free group the length of the value of each variable in a minimal solution of a standard quadratic equation is bounded by $2s$ for orientable equation and by $12s^4$ for non-orientable equation, where $s$ is the sum of the…

Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of…

We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…

In this paper we study the complexity of solving orientable quadratic equations in wreath products $A\wr B$ of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given…