Related papers: Group Coding with Complex Isometries
The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
For a variety with a finitely generated total coordinate ring, we describe basic geometric properties in terms of certain combinatorial structures living in its divisor class group. For example, we describe the singularities, we calculate…
In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
Extensions of real numbers in more than two dimensions, in particular quaternions and octonions are finding applications in physics due to the fact that they naturally capture certain symmetries of physical systems. Here it is shown that…
One of the main weakness of the family of centralizer codes is that its length is always $n^2$. Thus we have taken a new matrix equation code called intertwining code. Specialty of this code is the length of it, which is of the form $nk$.…
Suppose $G$ is a finite group and $A\subseteq G$ is such that $\{gA:g\in G\}$ has VC-dimension strictly less than $k$. We find algebraically well-structured sets in $G$ which, up to a chosen $\epsilon>0$, describe the structure of $A$ and…
Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…
We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…
An algebraic group ring method for constructing codes with no short cycles in the check matrix is derived. It is shown that the matrix of a group ring element has no short cycles if and only if the collection of group differences of this…
For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…
Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$, the subgroup sum graph $\Gamma_{G,H}$ (resp. extended subgroup sum graph $\Gamma_{G,H}^+$) of $G$ with respect to $H$ is the graph with vertex set $G$, in which…
Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the…
We present a link between easy quantum groups, discrete groups and combinatorics. By this, we infer new connections between quantum isometry groups, reflection groups, varieties of groups and the combinatorics of partitions. More precisely,…