Results 51 to 60 of about 374 (164)
Expansion of normal subsets of odd‐order elements in finite groups
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract Let G$G$ be a finite group and K$K$ a normal subset consisting of odd‐order elements. The rational closure of K$K$, denoted DK$\mathbf {D}_K$, is the set of elements x∈G$x \in G$ with the property that ⟨x⟩=⟨y⟩$\langle x \rangle = \langle y \rangle$ for some y$y$ in K$K$.
Chris Parker, Jack Saunders
wiley +1 more source
Automorphisms of kaleidoscopical graphs [PDF]
, 2007 A regular connected graph Γ of degree s is called kaleidoscopical if there is a (s + 1)-coloring of the set of its vertices such that every unit ball in Γ has no distinct monochrome points.
Protasova, K.D., Protasov, I.V.
core +2 more sources
Group Properties of Polar Codes for Automorphism Ensemble Decoding [PDF]
, 2022 In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of designing codes tailored for automorphism ensemble (AE) decoding. We prove the equivalence between the notion of decreasing monomial codes and the universal
Land, Ingmar +2 more
core +1 more source
THEORY OF NORMAL syndrome and PLUS-decoding
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The results of the study are not primitive BCH codes with decoding the guide, the potential is much greater than the design possibilities. The efficiency of automorphisms of codes, norms theory syndromes in the correction of all admissible-Mykh minimum ...
V. A. Lipnitski, A. O. Aliaksiuk
doaj
Automorphism groups of cyclic codes [PDF]
Journal of Algebraic Combinatorics, 2009 In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups.
Bienert, Rolf, Klopsch, Benjamin
openaire +2 more sources
On the ET0L subgroup membership problem in bounded automata groups
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We are interested in the subgroup membership problem in groups acting on rooted d$d$‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with d$d$ letters, form the boundary of the tree.
Alex Bishop +5 more
wiley +1 more source
2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes [PDF]
, 2009 We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms of odd prime order. We also give partial classifications of such designs with automorphisms of order 2.
Bouyukliev, Iliya +2 more
core +1 more source
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Automorphisms and Encoding of AG and Order Domain Codes [PDF]
, 2007 We survey some encoding methods for AG codes, focusing primarily on one approach utilizing code automorphisms. If a linear code C over Fq has a finite abelian group H as a group of automorphisms, then C has the structure of a module over a polynomial ...
John B. Little
core
Graph potentials and topological quantum field theories
Proceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.Abstract We introduce a new functional equation in birational geometry, whose solutions can be used to construct two‐dimensional topological quantum field theories (2d TQFTs), infinite‐dimensional in many interesting examples. The solutions of the equation give rise to a hierarchy of graph potentials, which, in the simplest setup, are Laurent ...
Pieter Belmans +2 more
wiley +1 more source