Related papers: Group homomorphisms as error correcting codes
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
Let $G$ be a group and $R$ be a ring. We define the Gorenstein homological dimension of $G$ over $R$, denoted by ${\rm Ghd}_{R}G$, as the Gorenstein flat dimension of trivial $RG$-module $R$. It is proved that ${\rm Ghd}_SG \leq {\rm…
We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…
We discuss families of approximate quantum error correcting codes which arise as the nearly-degenerate ground states of certain quantum many-body Hamiltonians composed of non-commuting terms. For exact codes, the conditions for error…
We study left-invariant distances on Lie groups for which there exists a one-parameter family of homothetic automorphisms. The main examples are Carnot groups, in particular the Heisenberg group with the standard dilations. We are…
Strong product is an efficient way to construct a larger digraph through some specific small digraphs. The large digraph constructed by the strong product method contains the factor digraphs as its subgraphs, and can retain some good…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
For any (Hausdorff) compact group $G$ with the normalized Haar measure ${\mathbf m}_G$, denote by ${\rm cp}(G)$ the probability ${\mathbf m}_{G\times G}(\{(x,y)\in G\times G \;|\; xy=yx\})$ of commuting a randomly chosen pair of elements of…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if…
Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…
We introduce the notion of finite stature of a family $\{H_i\}$ of subgroups of a group $G$. We investigate the separability of subgroups of a group $G$ that splits as a graph of hyperbolic special groups with quasiconvex edge groups. We…
We design a deterministic algorithm that, given $n$ points in a \emph{typical} constant degree regular~graph, queries $O(n)$ distances to output a constant factor approximation to the average distance among those points, thus answering a…
In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…
We prove universal lower bounds for discrepancies (i.e. sizes of spectral gaps of averaging operators) of measure-preserving actions of a locally compact group on probability spaces. For example, a locally compact Hausdorff unimodular group…
Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the…
Given a finitely generated residually finite group $G$, the residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ bounds the size of a finite group $Q$ needed to detect an element of norm at most $r$. More specifically, if…
This work was inspired by two natural questions. The first question is when Lie(G')=Lie(G)', where G is a connected algebraic supergroup defined over a field of characteristic zero. The second question is whether the unipotent radical of…
Let $(U, R)$ be an approximation space with $U$ being non-empty set and $R$ being an equivalence relation on $U$, and let $\overline{G}$ and $\underline{G}$ be the upper approximation and the lower approximation of subset $G$ of $U$. A…