Related papers: Epimorphism testing with virtually Abelian targets

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

We study automorphism groups of fibered surfaces for finite cyclic covering fibrations of an elliptic surface. We estimate the order of a finite subgroup of automorphism groups in terms of the genus of the fiber, the genus of the base…

It is proved that any infinite Abelian group of infinite exponent admits a non-discrete reflexive group topology.

We introduce separability properties corresponding to generalized versions of the conjugacy, twisted conjugacy, Brinkmann and Brinkmann's conjugacy problems and how they relate when finite and cyclic extensions of groups are taken. In…

We develop a version of Freiman's theorem for a class of non-abelian groups, which includes finite nilpotent, supersolvable and solvable A-groups. To do this we have to replace the small doubling hypothesis with a stronger relative…

We continue classification of finite groups which can be used as symmetry group of the scalar sector of the four-Higgs-doublet model (4HDM). Our objective is to systematically construct non-abelian groups via the group extension procedure,…

Given an elliptic curve $E$ over a perfect defectless henselian valued field $(F,\mathrm{val})$ with perfect residue field $\textbf{k}_F$ and valuation ring $\mathcal{O}_F$, there exists an integral separated smooth group scheme…

Notes from a talk at the April 2011 ICMS (Edinburgh) conference on the recent solution of the Kervaire invariant problem. This is an entirely expository account, emphasizing connections with the theory of topological automorphic forms.

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

Given a genus two curve $X: y^2 = x^5 + a x^3 + b x^2 + c x + d$, we give an explicit parametrization of all other such curves $Y$ with a specified symplectic isomorphism on three-torsion of Jacobians $\mbox{Jac}(X)[3] \cong…

In this paper, we show that the constant-dimensional Weisfeiler-Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity upper bounds on isomorphism testing for several families of…

A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…

An automorphism of an abelian variety induces a decomposition of the variety up to isogeny. There are two such results, namely the isotypical decomposition and Roan's decomposition theorem. We show that they are essentially the same.…

Abel's quadratures for integrable Hamiltonian systems are defined up to a group law of the corresponding Abelian variety $A$. If $A$ is isogenous to a direct product of Abelian varieties $A\cong A_1\times\cdots\times A_k$, the group law can…

We show that a relatively hyperbolic group either is virtually cyclic or has uniform exponential growth.

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

We give a classification of maximal elements of the set of finite groups that can be realized as the full automorphism groups of simple polarized abelian fourfolds over finite fields. As an application, we compute the Jordan constants of…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…