Related papers: The congruence subgroup problem for branch groups

The congruence subgroup problem for a finitely generated group $\Gamma$ asks whether $\widehat{Aut\left(\Gamma\right)}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(\Gamma\right)$? Here $\hat{X}$ denotes…

Researchers have proposed many methods for fair and robust machine learning, but comprehensive empirical evaluation of their subgroup robustness is lacking. In this work, we address this gap in the context of tabular data, where sensitive…

We propose a novel architecture for Graph Neural Networks that is inspired by the idea behind Tree Kernels of measuring similarity between trees by taking into account their common substructures, named fragments. By imposing a series of…

The congruence subgroups of braid groups arise from a congruence condition on the integral Burau representation $B_n \to \operatorname{GL}_{n}(\mathbb Z)$. We find the image of such congruence subgroups in $\operatorname{GL}_{n}(\mathbb…

Kernels ensuing from tree ensembles such as random forest (RF) or gradient boosted trees (GBT), when used for kernel learning, have been shown to be competitive to their respective tree ensembles (particularly in higher dimensional…

We prove that the kernel of the natural action of the modular group on the center of the Drinfel'd double of a semisimple Hopf algebra is a congruence subgroup. To do this, we introduce a class of generalized Frobenius-Schur indicators and…

We give a structural description of the normal subgroups of subgroups of finite index in branch groups in terms of rigid stabilizers. This gives further insight into the structure lattices of branch groups introduced by the second author.…

The kernel relation $K$ on the lattice $\mathcal{L}(\mathcal{CR})$ of varieties of completely regular semigroups has been a central component in many investigations into the structure of $\mathcal{L}(\mathcal{CR})$. However, apart from the…

We discuss various lifting and reduction problems for bundles and gerbes in the context of a strict Lie 2-group. We obtain a geometrical formulation (and a new proof) for the exactness of Breen's long exact sequence in non-abelian…

The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of…

We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the…

For a finite smooth algebraic group $F$ over a field $k$ and a smooth algebraic group $\bar G$ over the separable closure of $k$, we define the notion of $F$-kernel in $\bar G$ and we associate to it a set of nonabelian 2-cohomology. We use…

We consider the problem of learning convolution operators associated to compact Abelian groups. We study a regularization-based approach and provide corresponding learning guarantees under natural regularity conditions on the convolution…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…

We study the average case complexity of the uniform membership problem for subgroups of free groups, and we show that it is orders of magnitude smaller than the worst case complexity of the best known algorithms. This applies to subgroups…

We prove the stable rationality of almost simple algebraic groups, the connected components of the Dynkin diagram of anisotropic kernel of which contain at most two vertices. The (stable) rationality of many isotropic almost simple groups…

Let A denote the algebraic closure of the rationals Q in the complex numbers C. Suppose G is a torsion-free group which contains a congruence subgroup as a normal subgroup of finite index and denote by U(G) the C-algebra of closed densely…

In groups, an abelian normal subgroup induces an abelian congruence. We construct a class of centrally nilpotent Moufang loops containing an abelian normal subloop that does not induce an abelian congruence. On the other hand, we prove that…

A soft tree is an actively studied variant of a decision tree that updates splitting rules using the gradient method. Although soft trees can take various architectures, their impact is not theoretically well known. In this paper, we…