Daugulis, P., 10-vertex graphs with cyclic automorphism group of order 4, 2014, http: //arxiv.org/abs/1410.1163.P. Daugulis (2015) 14-vertex graphs with cyclic automorphism group of order 8. http://arxiv.org/abs/1501.04066.Peteris Daugulis (2014) 10-vertex graphs with cyclic ...
Simple Group- A nontrivial group whose only normal subgroups are itself and the trivial subgroup. Simple groups are thought to be classified as either: Cyclic groups of prime order (Ex. G= ) Alternating groups of degree at least 5. (Ex. A5 ) ...
We give a moderately detailed description of the indecomposable ZG-modules, and determine when two direct sums of such modules are isomorphic to each other.doi:10.1007/BFb0103160Lawrence S. LevySpringer Berlin HeidelbergL. LEVY, Modules over the cyclic group ofprime order, Lecture Notes in ...
cyclicgroupofprimeorder,andasaconsequenceprovethe“2p−3conjecture”. 1.Introduction LetVdenoteafinitedimensionalrepresentationofafinitegroupGoverafield F,i.e.,VisafinitemoduleoverthegroupringFG.TheactionofGonVinduces anactionofGonthedualV ∗ whichextendstoanactionbydegreepreserving algebraautomorph...
I have multiple DB queries pulling from SQL Server per vice president. One of the steps in each of those queries is to do an anti-join against the previously processed (PP) sheet to give me only those people that have not been processed. I want to then add those people to the PP ...
An uncertainty principle for cyclic groups of prime order
Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group. Namely, let X = Cay(G:T) be a Cayley digraph on a group G of order p2 with generating set...
(KS-DFT)40can yield unreliable results for systems with radical nature41, when the conventional XC density functionals are employed. Typically, multi-reference (MR) electronic structure methods, such as the complete-active-space self-consistent-field (CASSCF), complete-active-space second-order ...
An open problem on the index of length four sequences asks whether or not every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6) = 1 has index 1. In this paper, we show that if G = (g) is a cyclic group with order of a product of two ...
We note that factor complexity, abelian complexity and cyclic complexity can all be viewed as actions of different subgroups of the symmetric group on the indices of a finite word (respectively, the trivial subgroup, the whole symmetric group and the cyclic subgroup generated by the permutation (...