Related papers: Polynomial-time isomorphism test of groups that ar…

We define and study the class of inner ultrahomogeneous groups, which includes Hall's universal group and the universal locally recursively presentable group. We provide simple criteria for ample generic automorphisms, straight maximality,…

The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from…

We continue with the functional approach to the P-versus-NP problem, begun in [2, 3]. We previously constructed a monoid RM^P that is non-regular iff NP is not P. We now construct homomorphic images of RM^P with interesting properties. In…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

In this article we survey and examine the realizability of $p$-groups as Galois groups over arbitrary fields. In particular we consider various cohomological criteria that lead to necessary and sufficient conditions for the realizability of…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

For each prime p, we exhibit pairs of p-groups all of whose integral cohomology groups are isomorphic. The method used involves very little calculation. The groups are exhibited as kernels of homomorphisms from a compact Lie group G to…

We show that the equation associated with a group word $w \in G \ast {\mathbf F}_2$ can be solved over a hyperlinear group $G$ if its content - that is its augmentation in ${\mathbf F}_2$ - does not lie in the second term of the lower…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL), which allows the design of purely combinatorial graph isomorphism tests that are more powerful than the well-known Weisfeiler-Leman algorithm. We prove that, as an…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

This paper studies the behavior of Jiu-Kang Yu's tame supercuspidal representations relative to involutions of reductive p-adic groups. Symmetric space methods are used to illuminate various aspects of Yu's construction. Necessary…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…

We set up a general framework to study Tate cohomology groups of Galois modules along $\mathbb{Z}_p$-extensions of number fields. Under suitable assumptions on the Galois modules, we establish the existence of a five-term exact sequence in…

For a finite group $G$, let $p(G)$ denote the minimal degree of a faithful permutation representation of $G$. The minimal degree of a faithful representation of $G$ by quasi-permutation matrices over the fields $\mathbb{C}$ and $\mathbb{Q}$…

We examine the cohomology and representation theory of a family of finite supergroup schemes of the form $(\mathbb G_a^-\times \mathbb G_a^-)\rtimes (\mathbb G_{a(r)}\times (\mathbb Z/p)^s)$. In particular, we show that a certain relation…