Related papers: The complexity of intersecting subproducts with su…
Let $G$ be a simple algebraic group and $\mathcal O$ a nilpotent orbit in $\mathfrak g$. Let ${\mathbf{CS}}(\mathcal O)$ denote the affine cone over the secant variety of $\overline{\mathbb P\mathcal O}\subset \mathbb P\mathfrak g$. Using…
Let $\mathscr{P}_\mathbb{Q}=\{ \alpha^n \; : \; \alpha \in \mathbb{Q}, \; n \ge 2\}$ be the set of rational perfect powers, and let $S \subseteq \mathscr{P}_\mathbb{Q}$ be a finite subset. We prove the existence of a polynomial $f_S \in…
We determine the structure of the intersection of a finitely generated subgroup of a semiabelian variety $G$ defined over a finite field with a closed subvariety $X\subset G$.
A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…
We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly…
Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…
We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with…
We prove that the power word problem for certain metabelian subgroups of $\mathsf{GL}(2,\mathbb{C})$ (including the solvable Baumslag-Solitar groups $\mathsf{BS}(1,q) = \langle a,t \mid t a t^{-1} = a^q \rangle$) belongs to the circuit…
Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a…
We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…
This is the author's second paper treating the double coset problem for classical groups. Let $G$ be an algebraic group over an algebraically closed field $K$. The double coset problem consists of classifying the pairs $H,J$ of closed…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
We prove that if $G$ is a totally bounded abelian group \st\ its dual group $\widehat{G}_p$ equipped with the finite-open topology is a Baire group, then every compact subset of $G$ must be finite. This solves an open question by Chasco,…
Let S be a smooth irreducible curve defined over a number field k and consider an abelian scheme A over S and a curve C inside A, both defined over k. In previous works, we proved that when A is a fibered product of elliptic schemes, if C…
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…
If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…
There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…