English
Related papers

Related papers: A Note on Subgroup Perfect Codes in Cayley Graphs

200 papers

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

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

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

Group Theory · Mathematics 2024-07-10 Eduard Schesler

We consider the structure of a finite groups having a normal series whose factors have bicyclic Sylow subgroups. In particular, we investigated groups of odd order and $A_4$-free groups with this property. Exact estimations of the derived…

Group Theory · Mathematics 2009-12-15 V. S. Monakhov , A. A. Trofimuk

A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…

Group Theory · Mathematics 2021-06-23 James McCarron

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

Group Theory · Mathematics 2015-09-21 J. O. Button

A nonempty class $\mathfrak{X}$ of finite groups is called complete if it is closed under taking subgroups, homomorphic images and extensions. We deal with a classical problem of determining $\mathfrak{X}$-maximal subgroups. We consider two…

Group Theory · Mathematics 2020-08-26 Danila Revin , Saveliy Skresanov , Andrey Vasil'ev

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

We introduce Sylow subgroups and $0$-groups to the theory of complex algebraic supergroups, which mimic Sylow subgroups and $p$-groups in the theory of finite groups. We prove that Sylow subgroups are always $0$-groups, and show that they…

Representation Theory · Mathematics 2024-04-18 Vera Serganova , Alexander Sherman , Dmitry Vaintrob

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

Combinatorics · Mathematics 2014-02-20 Edward Dobson , Joy Morris , Pablo Spiga

We prove that a connected 2-dimensional orbifold with finitely generated and infinite orbifold fundamental group is good. We also describe all the good 2-dimensional orbifolds with finite orbifold fundamental groups

Geometric Topology · Mathematics 2020-05-25 S K Roushon

A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…

Representation Theory · Mathematics 2023-01-02 Eric Marberg , Yifeng Zhang

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

Group Theory · Mathematics 2017-03-24 Luke Morgan , Joy Morris , Gabriel Verret

Navarro has conjectured a necessary and sufficient condition for a finite group $G$ to have a self-normalising Sylow $2$-subgroup, which is given in terms of the ordinary irreducible characters of $G$. The first-named author has reduced the…

Representation Theory · Mathematics 2018-05-23 Amanda Schaeffer Fry , Jay Taylor

In this article we consider sheaf quotients of affine superschemes by affine supergroups that act on them freely. The necessary and sufficient conditions for such quotients to be affine are given. If $G$ is an affine supergroup and $H$ is…

Representation Theory · Mathematics 2008-09-23 A. N. Zubkov

Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…

Quantum Physics · Physics 2009-11-13 Anna Bernasconi , Chris Godsil , Simone Severini

A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…

Group Theory · Mathematics 2025-12-12 P. C. Hua , C. H. Li , J. B. Zhang , H. Zhou

Let $H\leq K$ be subgroups of a group G. We say that H is strongly closed in K with respect to G if whenever $a^g \in K$ where $a \in H, g \in G,$ then $a^g \in H.$ In this paper, we investigate the structure of a group G under the…

Group Theory · Mathematics 2011-02-25 Hung P. Tong-Viet

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

Group Theory · Mathematics 2021-04-01 Jing Jian Li , Zai Ping Lu

Perfect codes obtained by the Vasil'ev--Sch\"onheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear. This gives at least $\exp(cN^2)$ propelinear $1$-perfect codes of length…

Information Theory · Computer Science 2014-03-17 Denis Krotov , Vladimir Potapov
‹ Prev 1 3 4 5 6 7 10 Next ›