Related papers: Neural Discovery of Permutation Subgroups

Dynamic networks consist of a sequence of time-varying networks, and it is of great importance to detect the network change points. Most existing methods focus on detecting abrupt change points, necessitating the assumption that the…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

The normaliser problem has as input two subgroups $H$ and $K$ of the symmetric group $S_n$, and asks for a generating set for $N_K(H)$: it is not known to have a subexponential time solution. It is proved in [Roney-Dougal & Siccha, 2020]…

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical…

The present phase of Machine Learning is characterized by supervised learning algorithms relying on large sets of labeled examples ($n \to \infty$). The next phase is likely to focus on algorithms capable of learning from very few labeled…

We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap. We seek a collection $\mathcal{S}' \subseteq \mathcal{S}$ consisting of at least $k$ sets…

How do neural networks trained over sequences acquire the ability to perform structured operations, such as arithmetic, geometric, and algorithmic computation? To gain insight into this question, we introduce the sequential group…

A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…

The need for large amounts of training data in modern machine learning is one of the biggest challenges of the field. Compared to the brain, current artificial algorithms are much less capable of learning invariance transformations and…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are…

This paper presents an approach to expert-guided subgroup discovery. The main step of the subgroup discovery process, the induction of subgroup descriptions, is performed by a heuristic beam search algorithm, using a novel parametrized…

We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…

The inclusion of symmetries as an inductive bias, known as equivariance, often improves generalization on geometric data (e.g. grids, sets, and graphs). However, equivariant architectures are usually highly constrained, designed for…

For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…

Let $n$ be an integer greater than or equal to $3$ and $(R,\Delta)$ a Hermitian form ring where $R$ is commutative. We prove that if $H$ is a subgroup of the odd-dimensional unitary group $U_{2n+1}(R,\Delta)$ normalised by a relative…

Recent advances in deep learning from probability distributions successfully achieve classification or regression from distribution samples, thus invariant under permutation of the samples. The first contribution of the paper is to extend…