Related papers: Group homomorphisms as error correcting codes

We prove various results that, given a sufficiently rich subgroup $G$ of the group of homeomorphisms on the real line, describe the structure of the other possible actions of $G$ on the line, and address under which conditions such actions…

Let G be a Lie groupoid over M such that the target-source map from G to M x M is proper. We show that, if O is an orbit of finite type (i.e. which admits a proper function with finitely many critical points), then the restriction G|U of G…

The method of range decreasing group homomorphisms can be applied to study various maps between mapping spaces, includin holomorphic maps, group homomorphisms, linear maps, semigroup homomorphisms, Lie algebra homomorphisms and algebra…

In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving…

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…

For a finite group $G$ and its maximal subgroup $M$ we proved that the generalized Fitting height of $M$ can't be less by 2 than the generalized Fitting height of $G$ and the non-$p$-soluble length of $M$ can't be less by 1 than the…

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…

For variational problems with $O(N)$-symmetry the existence of several geometrically distinct solutions had been shown by use of group theoretic approach in previous articles. It was done by a crafty choice of a family $H_i \subset O(N)$…

Let $G$ be a linear algebraic group over an algebraically closed field of characteristic $p\geq 0$. We show that if $H_1$ and $H_2$ are connected subgroups of $G$ such that $H_1$ and $H_2$ have a common maximal unipotent subgroup and…

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

In this work, we answer the homotopy invariance question for the ''smallest'' non-isotrivial group-scheme over $\mathbb{P}^1$, obtaining a result, which is not contained in previous works due to Knudson and Wendt. More explicitly, let…

Given a countable group $G$ splitting as a free product $G=G_1\ast\dots\ast G_k\ast F_N$, we establish classification results for subgroups of the group $Out(G,\mathcal{F})$ of all outer automorphisms of $G$ that preserve the conjugacy…

The nonsoluble length $\lambda(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\"atze, unrestricted GB codes may have linear distance scaling. In…

A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Let $H$ be a fixed graph with possible loops. In the list homomorphism problem, denoted by \textsc{LHom}($H$), the instance is a graph $G$,…

Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…

This paper deals with the error estimate in problems of periodic homogenization. The methods used are those of the periodic unfolding. We give the upper bound of the distance between the unfolded gradient of a function belonging to…