Related papers: The congruence subgroup problem for branch groups

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…

J. S. Wilson proved in 1971 an isomorphism between the structural lattice associated to a group belonging to his second class of groups with every proper quotient finite and the Boolean algebra of clopen subsets of Cantor's ternary set. In…

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

In this paper we describe the fundamental group-scheme of a proper variety fibered over an abelian variety with rationally connected fibers over an algebraically closed field. We use old and recent results for the Nori fundamental…

Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound algorithm for the maximum clique problem, and provide a novel…

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

We identify the simple algebraic groups over number fields that are, in a suitable sense, determined by their finite adele points. Assuming CSP and Grothendieck rigidity, our results essentially characterize higher rank arithmetic groups…

In this paper we prove that for suitable sequences of congruence subgroups of Bianchi groups, including the standard exhaustive sequences of a congruence subgroup, and even symmetric powers of the standard representation of Sl_2(C) the size…

The kernel method is a potential approach to analyzing structured data such as sequences, trees, and graphs; however, unordered trees have not been investigated extensively. Kimura et al. (2011) proposed a kernel function for unordered…

The affine group of a tree is the group of the isometries of a homogeneous tree that fix an end of its boundary. Consider a probability measure on this group and the associated random walk. The main goal of this paper is to determine the…

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…

We investigate groups that act amenably on their Higson corona (also known as bi-exact groups) and we provide reformulations of this in relation to the stable Higson corona, nuclearity of crossed products and to positive type kernels. We…

We study actions of groups by homeomorphisms on $\mathbf{R}$ (or an interval) that are minimal, have solvable germs at $\pm \infty$ and contain a pair of elements of a certain type. We call such actions coherent. We establish that such an…

We consider two variants of those Abelian groups with all proper strongly invariant subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…

Any finitely generated group $G$ acts on its asymptotic cones in natural ways. The purpose of this paper is to calculate the kernel of such actions. First, we show that when $G$ is acylindrically hyperbolic, the kernel of the natural action…

Let k be a global field and let k_v be the completion of k with respect to v, a non-archimedean place of k. Let \mathbf{G} be a connected, simply-connected algebraic group over k, which is absolutely almost simple of k_v-rank 1. Let…

This is a long introduction to the theory of "branch groups": groups acting on rooted trees which exhibit some self-similarity features in their lattice of subgroups.

Let R be a connected noetherian commutative ring, and let G be a simply connected reductive group over R of isotropic rank ge 2. The elementary subgroup E(R) of G(R) is the subgroup generated by the R-points U_P^+(R) and U_P^-(R) of the…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…