Related papers: Group homomorphisms as error correcting codes

We introduce the persistent homotopy type distance dHT to compare real valued functions defined on possibly different homotopy equivalent topological spaces. The underlying idea in the definition of dHT is to measure the minimal shift that…

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…

A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

We study the geodesic distance induced by right-invariant metrics on the group $\operatorname{Diff}_\text{c}(M)$ of compactly supported diffeomorphisms, for various Sobolev norms $W^{s,p}$. Our main result is that the geodesic distance…

We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…

For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…

We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…

Let $G$ and $A$ be finite groups with $A$ acting on $G$ by automorphisms. In this paper we introduce the concept of "good action"; namely we say the action of $A$ on $G$ is good, if $H=[H,B]C_H(B)$ for every subgroup $B$ of $A$ and every…

Many quantum algorithms can be written as a composition of unitaries, some of which can be exactly synthesized by a universal fault-tolerant gate set, while others can be approximately synthesized. A quantum compiler synthesizes each…

We consider the actions of (semi)groups on a locally compact group by automorphisms. We show the equivalence of distality and pointwise distality for the actions of a certain class of groups. We also show that a compactly generated locally…

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p. We study J.-P. Serre's notion of G-complete reducibility for subgroups of G. In particular, for a subgroup H and a normal subgroup N of H,…

The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.

We consider a natural class of long range random walks on torsion free nilpotent groups and develop limit theorems for these walks. Given the original discrete group $\Gamma$ and a random walk $(S_n)_ {n\ge1}$ driven by a certain type of…

If $H$ is (or is isomorphic to) a subgraph of $G$, $H$ is said to {\it divide} $G$ if there is an edge-decomposition of $G$ by copies of $E(H)$, the edge set of $H$. A more restrictive version of this is when there is a subgroup ${\cal H}$…

Distances are fundamental primitives whose choice significantly impacts the performances of algorithms in machine learning and signal processing. However selecting the most appropriate distance for a given task is an endeavor. Instead of…

A major problem in the study of combinatorial aspects of permutation groups is to determine the distances in the symmetric group $\Sym_n$ with respect to a generator set. One well-known such a case is when the generator set $S_n$ consists…

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…