Related papers: Regular subgroups with large intersection

The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…

In the current paper we study the groups, whose subnormal abelian subgroups are normal. We obtained a quite detailed description of such hyperabelian groups with a periodic Baer radical. The description of hyperabelian Lie algebras, whose…

The goal of this thesis is to define a 2-dimensional version of abelian categories, where symmetric 2-groups play the role that abelian groups played in 1-dimensional algebra. Abelian and 2-abelian groupoid enriched categories are defined…

We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear…

We investigate the intersection of normalizers and $\mathfrak{F}$-subnormalizers of different types of systems of subgroups ($\mathfrak{F}$-maximal, Sylow, cyclic primary). We described all formations $\mathfrak{F}=\underset{i\in…

We determine the normalizer in $SL_{2}(\mathbb{R})$ of several families of congruence subgroups of $SL_{2}(\mathbb{Z})$. In addition, we show how these tools can be used to evaluate the groups of automorphisms and the discriminant kernels…

We determine the ranks and normal ranks of the Sylow 2-subgroups of the classical groups of odd characteristic.

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

In this paper we will give various examples of exponentially distorted subgroups in linear groups, including some new example of subgroups of $SL_n(\mathbb{Z}[x])$ for $n \ge 3$, and show how they can be used to construct symmetric-key…

Given a Sylow $p$-subgroup $P$ of a symmetric group, we describe the action of its normalizer on $\mathrm{Irr}(P)$. To this end, we establish a one-to-one correspondence between the irreducible characters of $P$ and certain equivalence…

We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of…

Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right; until now, all SEDFs have been in abelian groups. In this paper, we consider SEDFs in both abelian and…

We describe the normalizers for all non-conjugate maximal Abelian subgroups of diagonalizable automorphisms of sl(3,C) and show their relation to the symmetries of equations related to the graded contraction.

A hypergroup is called an elementary abelian 2-hypergroup if it is a constrained direct product of the closed subsets of two elements. In this paper, the elementary abelian 2-hypergroups are studied. All closed subsets and all strongly…

Let $G$ be a semiabelian variety and $C$ a curve in $G$ that is not contained in a proper algebraic subgroup of $G$. In this situation, conjectures of Pink and Zilber imply that there are at most finitely many points contained in the…

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

In this article we analyze the structure of $2$-categories of symmetric projective bimodules over a finite dimensional algebra with respect to the action of a finite abelian group. We determine under which condition the resulting…

We use binary trees to study the Bratteli diagram of Sylow 2-subgroups of symmetric groups. We show that it is simple, has a recursive structure, and self-similarities at all scales. We contrast its subgraph of one-dimensional…

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…

A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…