Related papers: Diophantine problems in solvable groups

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for…

We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

In this paper, we mainly answer a Lampe's question\cite{lampe} about the solutions of a Diophantine equation, that is, we give a criterion to determine which solutions of the Diophantine equation are in the orbit of the initial solution…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

In this paper, by solving Diophantine equations involving simple $K_4$-groups, we will try to point out that it is not easy to prove the infinitude of simple $K_4$-groups. This problem goes far beyond what is known about Dickson's…

We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…

Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

This paper aims at studying solvable-by-finite and locally solvable maximal subgroups of an almost subnormal subgroup of the general skew linear group $\GL_n(D)$ over a division ring $D$. It turns out that in the case where $D$ is…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

In this article, we focus on orders in arbitrary number fields, consider their Picard groups and finally obtain ring class fields corresponding to them. The Galois group of the ring class field is isomorphic to the Picard group. As an…

We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We prove that every {finitely generated residually finite}-by-sofic group satisfies Kaplansky's direct and stable finiteness conjectures with respect to all noetherian rings. We use this result to provide countably many new examples of…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…