Related papers: On the Complexity of Identifying Groups without Ab…

We study the commensurators of free groups and free pro-$p$ groups, as well as certain subgroups of these. We prove that the commensurator $Comm(F)$ of a non-abelian free group of finite rank $F$ is not virtually simple, answering a…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

In this work, we answer the homotopy invariance question for the ''smallest'' non-isotrivial group-scheme over $\mathbb{P}^1$, obtaining a result, which is not contained in previous works due to Knudson and Wendt. More explicitly, let…

In this paper we discuss gauging noninvertible zero-form symmetries in two dimensions. We specialize to certain gaugeable cases, specifically, fusion categories of the form Rep(H) for H a suitable Hopf algebra (which includes the special…

We use the asymptotic data at conformal null-infinity $\mathscr{I}$ to formulate Weinberg's soft-photon theorem for Abelian gauge theories with massless charged particles. We show that the angle-dependent gauge transformations at…

Let BG be a classifying variety for an exceptional simple simply connected algebraic group G. We compute the degree 3 unramified Galois cohomology of BG with values in Q/Z(2) over an arbitrary field F. Combined with a paper by Merkurjev,…

We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\operatorname{polylog} (k)}\operatorname{poly} (n)$, improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS…

We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to…

In this article, we provide a general set-up for arbitrary linear Lie groups $H\leq \mathrm{GL}(n,\mathbb{R})$ which allows to characterise the almost Abelian Lie algebras admitting a torsion-free $H$-structure. In more concrete terms,…

For a given abelian group G, we classify the isomorphism classes of G-gradings on the simple Lie algebras of types A_n (n >= 1), B_n (n >= 2), C_n (n >= 3) and D_n (n > 4), in terms of numerical and group-theoretical invariants. The ground…

Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

A group $G$ is called mixed identity-free if for every $n \in \mathbb{N}$ and every $w \in G \ast F_n$ there exists a homomorphism $\varphi: G \ast F_n \rightarrow G$ such that $\varphi$ is the identity on $G$ and $\varphi(w)$ is…

We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…