scholarly journals Near-invariant subspaces for matrix groups are nearly invariant

2016 ◽  
Vol 505 ◽  
pp. 269-281
Author(s):  
Mitja Mastnak ◽  
Matjaž Omladič ◽  
Heydar Radjavi
Keyword(s):  
Invariant Subspaces ◽  
Matrix Groups

scholarly journals Invariant subspaces of matrix groups and elementary-abelian covers of K4,4

Filomat ◽  
2011 ◽  
Vol 25 (4) ◽  
pp. 37-53
Author(s):  
Bostjan Kuzman
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Invariant Subspaces ◽  
Matrix Groups ◽  
Abelian Covers ◽  
Groups Of Automorphisms ◽  
Transitive Subgroup

We study lifting conditions for groups of automorphisms of the complete bipartite graph K4,4. In particular, for p?2 a prime we construct, up to isomorphism of projections, all minimal p-elementary abelian covers of K4,4 such that the respective covering projections admit a lift of some arc-transitive subgroup of Aut(K4,4).

scholarly journals Semisymmetric Zp-covers of the C20 graph

2021 ◽  
Vol 31 (2) ◽  
pp. 286-301
Author(s):  
A. A. Talebi ◽  
◽  
N. Mehdipoor ◽  
Keyword(s):  
Linear Algebra ◽  
Homology Group ◽  
Invariant Subspaces ◽  
Linear Representation ◽  
Matrix Groups ◽  
Semisymmetric Graph ◽  
Vertex Set ◽  
Prime Fields ◽  
Abelian Covering

A graph X is said to be G-semisymmetric if it is regular and there exists a subgroup G of A:=Aut(X) acting transitively on its edge set but not on its vertex set. In the case of G=A, we call X a semisymmetric graph. Finding elementary abelian covering projections can be grasped combinatorially via a linear representation of automorphisms acting on the first homology group of the graph. The method essentially reduces to finding invariant subspaces of matrix groups over prime fields. In this study, by applying concept linear algebra, we classify the connected semisymmetric zp-covers of the C20 graph.

Invariant Subspaces on KPC-Hypergroups

2019 ◽  
Vol 15 (1) ◽  
pp. 122-130
Author(s):  
Laszlo Szekelyhidi ◽  
◽  
Seyyed Mohammad Tabatabaie ◽  
Keyword(s):  
Invariant Subspaces

Invariant Subspaces

1973 ◽  
Author(s):  
Heydar Radjavi ◽  
Peter Rosenthal
Keyword(s):  
Invariant Subspaces

scholarly journals Monomial codes seen as invariant subspaces

2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um
Keyword(s):  
Finite Field ◽  
Linear Algebra ◽  
Linear Transformation ◽  
Cyclic Codes ◽  
Invariant Subspaces ◽  
Hyperinvariant Subspaces ◽  
Computationally Expensive ◽  
The Relationship

Abstract It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.

Sign in / Sign up

Export Citation Format

Share Document