English
Related papers

Related papers: Construction of minimal non-abelian left group cod…

200 papers

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…

Combinatorics · Mathematics 2026-05-08 Bheemarasetty Chakravarthy , Surojit Ghosh

In this article, we derive explicit combinatorial formulas, depending only on $q$, for the Wedderburn decomposition of the rational group algebras of the finite linear groups $\operatorname{SL}_2(q)$ and $\operatorname{PSL}_2(q)$.…

Representation Theory · Mathematics 2026-04-20 Ram Karan Choudhary , Saikat Panja

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

Combinatorics · Mathematics 2013-01-22 Abdallah Assi , Pedro A. García-Sánchez

We determine the structure of 2-blocks with minimal nonabelian defect groups, by making use of the classification of finite simple groups.

Representation Theory · Mathematics 2011-09-20 Charles Eaton , Burkhard Külshammer , Benjamin Sambale

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

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…

Information Theory · Computer Science 2023-08-15 Rameez Raja

We classify the weak*-closed maximal left ideals of the measure algebra $M(G)$ for certain Hermitian locally compact groups $G$ in terms of the irreducible representations of $G$ and their asymptotic properties. In particular, we obtain a…

Functional Analysis · Mathematics 2022-10-06 Jared T. White

We propose a unified method to construct multicyclic codes of arbitrary dimension $r$ over $\mathbb{F}_q$. The approach relies on $r$-dimensional primitive idempotents defined as tensor products of univariate ones, combined with…

Commutative Algebra · Mathematics 2026-03-10 Jean Charles Ramanandraibe , Ramamonjy Andriamifidisoa

The aim of this paper is to give all quasitriangular structures on a class of semisimple Hopf algebras constructed through abelian extensions of $\Bbbk\mathbb{Z}_{2}$ by $\Bbbk^G$ for an abelian group $G$. We first introduce the concept of…

Quantum Algebra · Mathematics 2021-08-03 Kun Zhou

We prove that any left-ordered inp-minimal group is abelian, and we provide an example of a non-abelian left-ordered group of dp-rank 2.

Logic · Mathematics 2023-11-14 Jan Dobrowolski , John Goodrick

In this paper, we prove classical affine W-algebras associated to Lie superalgebras (W-superalgebras) can be constructed in two different ways: via affine classical Hamiltonian reductions and via taking quasi-classical limits of quantum…

Mathematical Physics · Physics 2015-09-22 Uhi Rinn Suh

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…

Information Theory · Computer Science 2021-08-24 Zhao Hu , Nian Li , Xiangyong Zeng , Lisha Wang , Xiaohu Tang

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…

Group Theory · Mathematics 2025-04-18 Arman Darbinyan , Markus Steenbock

In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…

Information Theory · Computer Science 2016-10-26 Minjia Shi , Lin Sok , Patrick Solé

We study the algebra of conformal endomorphisms $\Cend^{G,G}_n$ of a finitely generated free module $M_n$ over the coordinate Hopf algebra $H$ of a linear algebraic group $G$. It is shown that a conformal subalgebra of $\Cend_n$ acting…

Rings and Algebras · Mathematics 2011-08-01 Pavel Kolesnikov

A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…

Information Theory · Computer Science 2009-03-06 Jose Joaquin Bernal , Angel del Rio , Juan Jacobo Simon

An algebraic group ring method for constructing codes with no short cycles in the check matrix is derived. It is shown that the matrix of a group ring element has no short cycles if and only if the collection of group differences of this…

Rings and Algebras · Mathematics 2008-07-23 Ted Hurley , Paul McEvoy , Jakub Wenus

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…

Group Theory · Mathematics 2022-01-05 Fatma Altunbulak Aksu , İpek Tuvay

In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…

Functional Analysis · Mathematics 2011-08-05 Herbert Abels , Antonios Manoussos

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

Number Theory · Mathematics 2008-01-28 Werner Bley , Henri Johnston