Related papers: Perfect Isometry Groups for Cyclic Groups of Prime…
The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…
By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…
A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley graph of a cyclic group. In this paper we study perfect codes in…
A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
If $G$ is a group acting geometrically on a CAT(0) cube complex $X$ and if $g \in G$ is an infinite-order element, we show that exactly one of the following situations occurs: (i) $g$ defines a rank-one isometry of $X$; (ii) the stable…
We show that if the Sylow $p$-subgroup of a finite group $G$ is of order $p$, then the normalized unit group of the integral group ring of $G$ contains a normalized unit of order $pq$ if and only if $G$ contains an element of order $pq$,…
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
Let $G$ be a group. The intersection graph of cyclic subgroups of $G$, denoted by $\mathscr I_c(G)$, is a graph having all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\mathscr I_c(G)$ are adjacent if and…
This paper extends the study of group algebras of finite groups in which the socle of the center is an ideal. We provide a detailed analysis of the structure of these groups. In a particular case, we reach a complete characterization of the…
Let $p$ be a prime number, $k$ an algebraically closed field of characteristic $p$, $\tilde{G}$ a finite group, and $G$ a normal subgroup of $\tilde{G}$ having a $p$-power index in $\tilde{G}$. Moreover let $B$ be a block of $kG$ with a…
We compute and analyze isotropy subgroups of the complex orthogonal group with respect to the similarity transformation on itself and on skew-symmetric matrices. Their group structure is related to a group of certain nonsingular block…
An isometry is a geometric transformation that preserves distances between pairs of points. We present methods to classify isometries in the Euclidean plane, and extend these methods to spherical, single elliptical, and hyperbolic geometry.…
We use assembly maps to study $\mathbf{TC}(\mathbb{A}[G];p)$, the topological cyclic homology at a prime $p$ of the group algebra of a discrete group $G$ with coefficients in a connective ring spectrum $\mathbb{A}$. For any finite group, we…
Given a spectral triple of compact type with a real structure in the sense of [Dabrowski L., J. Geom. Phys. 56 (2006), 86-107] (which is a modification of Connes' original definition to accommodate examples coming from quantum group theory)…
The problem of homological stability helps us to catch the structure of group homology. We calculate homological stability of special orthogonal groups, and we also calculate the stability of orthogonal groups with determinant-twisted…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
For a pair of given binary perfect codes C and D of lengths t and m respectively, the Mollard construction outputs a perfect code M(C,D) of length tm + t + m, having subcodes C1 and D2, that are obtained from codewords of C and D…