Trying to finalize in some way the present subject, this paper targets to generalize substantially the notions of Bassian and co-Bassian groups by introducing the so-called finitely (co-)Bassian groups, semi (co-)Bassian groups, fully generalized (co-)Bassian groups, absolutely generalized (co-)Bassian groups and establishing their crucial properties and characterizations. In fact, some of the concepts give nothing new by coinciding in the reduced case with the well-known (co-)Bassian property. However, in some of the definitions, the situation is slightly more complicated and we obtain a few new and interesting things by showing that the extensions of the Bassian and co-Bassian properties are totally distinct each other.
This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that the MOR cryptosystem has better security than the ElGamal cryptosystem over finite fields.
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equivalent to the El-Gamal cryptosystem over finite fields.
In this paper we determine all finitely generated abelian groups which are varietal capable with respect to the variety of polynilpotent groups. This result is a vast generalization of the famous Baer's result about capability of finitely generated abelian groups.
The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It seems reasonable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using $p$-groups? In this paper we show that the answer is no.
A topological group $X$ is defined to have $compact$ $exponent$ if for some number $n\in\mathbb N$ the set $\{x^n:x\in X\}$ has compact closure in $X$. Any such number $n$ will be called a compact exponent of $X$. Our principal result states that a complete Abelian topological group $X$ has compact exponent (equal to $n\in\mathbb N$) if and only if for any injective continuous homomorphism $f:X\to Y$ to a topological group $Y$ and every $y\in \bar{f(X)}$ there exists a positive number $k$ (equal to $n$) such that $y^k\in f(X)$. This result has many interesting implications: (1) an Abelian topo…
Let $p$ be a prime. A $p$-group $G$ is defined to be semi-extraspecial if for every maximal subgroup $N$ in $Z(G)$ the quotient $G/N$ is a an extraspecial group. In addition, we say that $G$ is ultraspecial if $G$ is semi-extraspecial and $|G:G'| = |G'|^2$. In this paper, we prove that every $p$-group of nilpotence class $2$ is isomorphic to a subgroup of some ultraspecial group. Given a prime $p$ and a positive integer $n$, we provide a framework to construct of all the ultraspecial groups order $p^{3n}$ that contain an abelian subgroup of order $p^{2n}$. In the literature, it has been proved…
If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word presenting the fundamental group of an orientable surface $<x,y: [x_1,y_1][x_2,y_2]...[x_n,y_n]=1>$ is satisfied. This resolves a conjecture by Langley, Levitt and Rower.
In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered Generating System, then G has Ordered Generating System as well. Hence, it remains to prove that every finite simple group has Ordered Generating System. In this paper we prove that the sporadic group of Mathieu has the property of Ordered Generating System.
The OGS for non-abelian groups is an interesting generalization of the basis of finite abelian groups. The definition of OGS states that every element of a group has a unique presentation as a product of some powers of specific generators of the group, in a specific given order. In case of the symmetric groups Sn there is a paper of R. Shwartz, which demonstrates a strong connection between the OGS and the standard Coxeter presentation of the symmetric group, which is called the standard OGS of Sn. In this paper we generalize the standard OGS of Sn to the finite classical Coxeter group Bn. We …
In this paper we construct abelian extensions of the group of diffeomorphisms of a torus. We consider the jacobian map, which is a crossed homomorphism from the group of diffeomorphisms into a toroidal gauge group. A pull-back under this map of a central 2-cocycle on a gauge group turns out to be an abelian cocycle on the group of diffeomorphisms. We show that in the case of a circle, the Virasoro-Bott cocycle is a pull-back of the Heisenberg cocycle. We also give an abelian generalization of the Virasoro-Bott cocycle to the case of a manifold with a volume form.
The OGS for non-abelian groups is an interesting generalization of the basis of finite abelian groups. The definition of OGS states that every element of a group has a unique presentation as a product of some powers of specific generators of the group, in a specific given order. In case of the symmetric groups Sn there is a paper of R. Shwartz, which demonstrates a strong connection between the OGS and the standard Coxeter presentation of the symmetric group, which is called the standard OGS of Sn. In this paper we generalize the standard OGS of Sn to the finite classical Coxeter group Dn. We …
We classify up to coarse equivalence all countable abelian groups of finite torsion free rank. The Q-cohomological dimension and the torsion free rank are the two invariants that give us such classification. We also prove that any countable abelian group of finite torsion free rank is coarsely equivalent to Z^n + H where H is a direct sum (possibly infinite) of cyclic groups. A partial generalization to countable abelian groups of the Gromov rigidity theorem for abelian groups is shown.
Let $F$ be a finitely generated non-abelian free group and $Q$ a finite quotient. Denote by $L_Q$ the language obtained by adding unary predicates $P_q$, $q\in Q$ to the language of groups. Using a slight generalization of some of the techniques involved in Zlil Sela's solution to Tarskiś problem on the elementary theory of non-abelian free groups, we provide a few basic results on the validity of first order entences in the $L_Q$-expansion of $F$ in which every $P_q$ is interpreted as the preimage of $q$ in $F$. In particular we prove an analogous result to Sela's generalization of Merzlyakov…
Using totally symmetric sets, Chudnovsky, Kordek, Li, and Partin gave a superexponential lower bound on the cardinality of non-abelian finite quotients of the braid group. In this paper, we develop new techniques using multiple totally symmetric sets to count elements in non-abelian finite quotients of the braid group. Using these techniques, we improve the lower bound found by Chudnovsky et al. We exhibit totally symmetric sets in the virtual and welded braid groups, and use our new techniques to find superexponential bounds for the finite quotients of the virtual and welded braid groups.
Given a finite group $G$, we say that $G$ has weak normal covering number $γ_w(G)$ if $γ_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{γ_w(G)}$ such that each element of $G$ has a conjugate in $H_i$, for some $i\in \{1,\ldots,γ_w(G)\}$, via an element in the automorphism group of $G$. We prove that the weak normal covering number of every non-abelian simple group is at least $2$ and we classify the non-abelian simple groups attaining $2$. As an application, we classify the non-abelian simple groups having normal covering number $2$. We also show that the weak…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for H without using a relation matrix. The problem of computing a basis for some or all of the Sylow p-subgroups of an arbitrary finite abelian group G is addressed, yielding a Monte Carlo algorithm to compute the structure of G using O(|G|^0.5) group operations. These results also improve generic algorithms for extracting pth roots in G.
