Related papers: Orientable quadratic equations in wreath products

We prove that the wreath product $C=A wr B$ of a semigroup $A$ with zero and an infinite cyclic semigroup $B$ is $q_\omega$-compact (logically Noetherian). Our result partially solves the Plotkin`s problem about wreath products

We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall,…

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

Given sofic approximations for countable, discrete groups $G,H$, we construct a sofic approximation for their wreath product $G\wr H$.

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…

In this paper we study Hodge classes on complex abelian varieties. We prove some general results that allow us, in certain cases, to compute the Hodge group of a product abelian variety $X = X_1 \times X_2$ once we know the Hodge groups of…

We give an equivalence of triangulated categories between the derived category of finitely generated representations of symplectic reflection algebras associated with wreath products (with parameter t=0) and the derived category of coherent…

We compute the Grothendieck group of the category of abelian varieties over an algebraically closed field $k$. We also compute the Grothendieck group of the category of $A$-isotypic abelian varieties, for any simple abelian variety $A$,…

It is shown that membership in rational subsets of wreath products H \wr V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath…

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…

Consider a $q$-Weil polynomial $f$ of degree $2g$. Using an equidistribution assumption that is too strong to be true, we define and compute a product of local relative densities of matrices in $\rm{GSp}_{2g}(\mathbb{F}_\ell)$ with…

We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.

We characterise the group property of being with infinite conjugacy classes for wreath products of groups

We study infinitely iterated wreath products of finite permutation groups with respect to product actions. In particular, we prove that, for every non-empty class of finite simple groups $\mathcal{X}$, there exists a finitely generated…

We recover a 4-dimensional wreath product X as a transversal slice to a nilpotent orbit in sp_6. By using deformations of Springer resolutions, we construct a symplectic deformation of symplectic resolutions of X.

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

We classify an algebraic phenomenon on certain families of wreath products that can be seen as coming from a family of puzzles about switches on the corners of a spinning table. Such puzzles have been written about and generalized since…

It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has…

We formally investigate some computational obstacles to tractability of computing the variety determined by K complex polynomials in N boolean variables. We show that using algebraic methods for solving combinatorial problems, the obstacles…

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…