Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1904.04077

On the number of non-G-equivalent minimal abelian codes

Fatma Altunbulak Aksu·İpek Tuvay
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $G$ be a finite abelian group. Ferraz, Guerreiro and Polcino Milies prove that the number of $G$-equivalence classes of minimal abelian codes is equal to the number of $G$-isomorphism classes of subgroups for which corresponding quotients are cyclic. In this article, we prove that the notion of $G$-isomorphism is equivalent to the notion of isomorphism on the set of all subgroups $H$ of $G$ with the property that $G/H$ is cyclic. As an application, we calculate the number of non-$G$-equivalent minimal abelian codes for some specific family of abelian groups. We also prove that the number of non-$G$-equivalent minimal abelian codes is equal to number of divisors of the exponent of $G$ if and only if for each prime $p$ dividing the order of $G$, the Sylow $p$-subgroups of $G$ are homocyclic.

Explore related subjects

math.GRcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fatma Altunbulak Aksu, İpek Tuvay. 2020-06-25. On the number of non-G-equivalent minimal abelian codes. https://doi.org/10.3906/mat-2006-102

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

KEEP EXPLORING

Related papers

arXiv2026

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR↗
arXiv2026

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR↗
arXiv2026

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗