Related papers: Linear equations with monomial constraints and dec…

Solutions of a linear equation b=ax in a homomorphic image of a commutative Bezout domain of stable range 1.5 is developed. It is proved that the set of solutions of a solvable linear equation contains at least one solution that divides the…

Let $S$ be a smooth irreducible curve defined over $\overline{\mathbb{Q}}$, let $\mathcal{A}$ be an abelian scheme over $S$ and $\mathcal{C}$ a curve inside $\mathcal{A}$, both defined over $\overline{\mathbb{Q}}$. In this paper we prove…

We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…

We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

We study the groups of rational points of abelian varieties defined over a finite field $ \mathbb{F}_q$ whose endomorphism rings are commutative, or, equivalently, whose isogeny classes are determined by squarefree characteristic…

We consider a family of higher-order Boussinesq equations with an arbitrary nonlinearity. We determine the classes of equations so that a certain type of Lie symmetry algebra is admitted in this family. In case of a quadratic nonlinearity…

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if…

We obtain a solution to a bordism version of Gromov's linearity problem over a large family of acyclic groups, for manifolds with arbitrary dimension. Every group embeds into some acyclic group in this family. Thus, the linear bordism…

We show that every finite abelian group $G$ occurs as the group of rational points of an ordinary abelian variety over $\mathbb{F}_2$, $\mathbb{F}_3$ and $\mathbb{F}_5$. We produce partial results for abelian varieties over a general finite…

This article aims to study some $n$-tuples of elements belonging to a ring $\mathbb{Z}/N\mathbb{Z}$ related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal…

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

We prove that for every abelian group G and every compactum X with $\dim_G X \leq n \geq 2$ there is a G-acyclic resolution $r: Z \lo X$ from a compactum Z with $\dim_G Z \leq n$ and $\dim Z \leq n+1$ onto X.

The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Given a finitely generated subgroup G of a ring R we provide a finite subset of G such that if each element of this set satisfies some cubic polynomial equation in one variable over the center Z of R then the subring generated by G has…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…

We prove that the quasivariety of groups generated by finite and locally indicable groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses…