Search arXivSearch

arXiv · 2001.00213

Isometries between finite groups

Abstract

We prove that if $H$ is a subgroup of index $n$ of any cyclic group $G$, then $G$ can be isometrically embedded in $(H^n, d_{_{Ham}}^n)$, thus generalizing previous results of Carlet (1998) for $G=\mathbb{Z}_{2^k}$ and Yildiz-Özger (2012) for $G=\mathbb{Z}_{p^k}$ with $p$ prime. Next, for any positive integer $q$ we define the $q$-adic metric $d_q$ in $\mathbb{Z}_{q^n}$ and prove that $(\mathbb{Z}_{q^n}, d_q)$ is isometric to $(\mathbb{Z}_q^n, d_{RT})$ for every $n$, where $d_{RT}$ is the Rosenbloom-Tsfasman metric. More generally, we then demonstrate that any pair of finite groups of the same cardinality are isometric to each other for some metrics that can be explicitly constructed. Finally, we consider a chain $\mathcal{C}$ of subgroups of a given group and define the chain metric $d_{\mathcal{C}}$ and chain isometries between two chains. Let $G, K$ be groups with $|G|=q^n$, $|K|=q$ and let $H<G$. Using chains, we prove that under certain conditions, $(G,d_\mathcal{C}) \simeq (K^n, d_{RT})$ and $(G,d_\mathcal{C}) \simeq (H^{[G:H]}, d_{BRT})$ where $d_{BRT}$ is the block Rosenbloom-Tsfasman metric which generalizes $d_{RT}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricardo A. Podestá, Maximiliano G. Vides. 2020-07-15. Isometries between finite groups. https://arxiv.org/abs/2001.00213

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO