Related papers: Group homomorphisms as error correcting codes
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$. Many…
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as…
It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…
We introduce the notion of difference equation defined on a structured set. The symmetry group of the structure determines the set of difference operators. All main notions in the theory of difference equations are introduced as invariants…
In this paper we study conjugacy and subgroup separability properties in the class of nilpotent $\mathbb{Q}[x]$-powered groups. Many of the techniques used to study these properties in the context of ordinary nilpotent groups carry over…
A Hom-group G is a nonassociative version of a group where associativity, invertibility, and unitality are twisted by a map \alpha: G\longrightarrow G. Introducing the Hom-group algebra KG, we observe that Hom-groups are providing examples…
The generalized Fitting height $h^*(G)$ of a finite group $G$ is the least number $h$ such that $\mathrm{F}_h^* (G) = G$, where $\mathrm{F}_{(0)}^* (G) = 1$, and $\mathrm{F}_{(i+1)}^*(G)$ is the inverse image of the generalized Fitting…
Let $G$ be a finite $p$-separable group, for some fixed prime $p$. Let $\Gamma_p(G)$ be the common divisor graph built on the set of non-central conjugacy classes of $p$-regular elements of $G$: this is the graph whose vertices are the…
Let G be a simple, connected graph on n vertices. Let d_G(u,v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if d_H(u,v)=d_G(u,v) for every u,v in V(H). We say that G is a distance-preserving graph if G…
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with…
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…
We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…
For a hereditary graph class $\mathcal{H}$, the $\mathcal{H}$-elimination distance of a graph $G$ is the minimum number of rounds needed to reduce $G$ to a member of $\mathcal{H}$ by removing one vertex from each connected component in each…
Many geometric learning problems require invariants on heterogeneous product spaces, i.e., products of distinct spaces carrying different group actions, where standard techniques do not directly apply. We show that, when a group $G$ acts…
Bosonic codes with rotational symmetry are currently one of the best performing quantum error correcting codes. Little is known about error propagation and code distance for these rotation codes in contrast with qubit codes and Bosonic…
Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The…
We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a…
This article records basic topological, as well as homological properties of the space of homomorphisms Hom(L,G) where L is a finitely generated discrete group, and G is a Lie group, possibly non-compact. If L is a free abelian group of…