Related papers: Computing normalisers of intransitive groups

Given any group $G$, the multiple holomorph $\mathrm{NHol}(G)$ is the normalizer of the holomorph $\mathrm{Hol}(G) = \rho(G)\rtimes \mathrm{Aut}(G)$ in the group of all permutations of $G$, where $\rho$ denotes the right regular…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the…

The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class…

Let $G$ be a group. Let $\mathrm{Perm}(G)$ denote its symmetric group and write $\mathrm{Hol}(G)$ for the normalizer of the subgroup of left translations in $\mathrm{Perm}(G)$. The multiple holomorph $\mathrm{NHol}(G)$ of $G$ is in turn…

In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if any vertex $v \in V\setminus S$ is adjacent to some vertex $x$ from this subset. A number of real-life problems can be modeled using this…

If G is a complex semisimple algebraic group, we characterize the normality and the smoothness of its simple linear compactifications, namely those equivariant GxG-compactifications which possess a unique closed orbit and which arise in a…

Symmetries of the finite Heisenberg group represent an important tool for the study of deeper structure of finite-dimensional quantum mechanics. As is well known, these symmetries are properly expressed in terms of certain normalizer. This…

Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical…

We show that the existence of a homomorphism from an $n$-vertex graph $G$ to an $h$-vertex graph $H$ can be decided in time $2^{O(n)}h^{O(1)}$ and polynomial space if $H$ comes from a family of graphs that excludes a topological minor. The…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

The state hidden subgroup problem (StateHSP) is a recent generalization of the hidden subgroup problem. We present an algorithm that solves the non-abelian StateHSP over $N$ copies of the dihedral group of order $8$ (the symmetries of a…

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

We study three restrictions on normalizers or centralizers in finite p-groups, namely: (i) |N_G(H) : H| <= p^k for every H non-normal in G, (ii) |N_G(<g>) : <g>| <= p^k for every <g> non-normal in G, and (iii) |C_G(g) : <g>| <= p^k for…

The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…

Group equivariant neural networks are growing in importance owing to their ability to generalise well in applications where the data has known underlying symmetries. Recent characterisations of a class of these networks that use high-order…

Let $G$ be a finite permutation group acting on $\mathbb{R}^d$ by permuting coordinates. A core point (for $G$) is an integral vector $z\in \mathbb{Z}^d$ such that the convex hull of the orbit $Gz$ contains no other integral vectors but…

A $k$-tuple $(H_1, \ldots, H_k)$ of core-free subgroups of a finite group $G$ is said to be regular if $G$ has a regular orbit on the Cartesian product $G/H_1 \times \cdots \times G/H_k$. The regularity number of $G$, denoted $R(G)$, is the…