Related papers: Neural Discovery of Permutation Subgroups
Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers.…
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…
Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
We study the hypersimplex under the action of the symmetric group $S_n$ by coordinate permutation. We prove that the evaluation of its equivariant $H^*$-polynomial at $1$ is the permutation character of decorated ordered set partitions…
We consider the hidden subgroup problem on the semi-direct product of cyclic groups $\Z_{N}\rtimes\Z_{p}$ with some restriction on $N$ and $p$. By using the homomorphic properties, we present a class of semi-direct product groups in which…
In a sequence of multivariate observations or non-Euclidean data objects, such as networks, local dependence is common and could lead to false change-point discoveries. We propose a new way of permutation -- circular block permutation with…
Providing human-understandable insights into the inner workings of neural networks is an important step toward achieving more explainable and trustworthy AI. Existing approaches to such mechanistic interpretability typically require…
We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak…
Our goal is to find classes of convolution semigroups on Lie groups $G$ that give rise to interesting processes in symmetric spaces $G/K$. The $K$-bi-invariant convolution semigroups are a well-studied example. An appealing direction for…
In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…
Group invariant and equivariant Multilayer Perceptrons (MLP), also known as Equivariant Networks, have achieved remarkable success in learning on a variety of data structures, such as sequences, images, sets, and graphs. Using tools from…
Learning distributions over permutations is a fundamental problem in machine learning, with applications in ranking, combinatorial optimization, structured prediction, and data association. Existing methods rely on mixtures of parametric…
This paper proves under certain conditions the existence of an algorithm, which detects relatively quasiconvex subgroups $H$ of relatively hyperbolic groups $(G,\mathbb{P})$. Additionally, this algorithm outputs an induced peripheral…
Quantum neural network architectures that have little-to-no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by…
To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
We consider learning nonholonomic dynamical systems while discovering the constraints, and describe in detail the case of the rolling disk. A nonholonomic system is a system subject to nonholonomic constraints. Unlike holonomic constraints,…
In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…