379 research outputs found
A Survey of Graphs of Minimum Order with Given Automorphism Group
We survey vertex minimal graphs with prescribed automorphism group. Whenever possible, we also investigate the construction of such minimal graphs, confirm minimality, and prove a given graph has the correct automorphism group
Finite and infinite quotients of discrete and indiscrete groups
These notes are devoted to lattices in products of trees and related topics.
They provide an introduction to the construction, by M. Burger and S. Mozes, of
examples of such lattices that are simple as abstract groups. Two features of
that construction are emphasized: the relevance of non-discrete locally compact
groups, and the two-step strategy in the proof of simplicity, addressing
separately, and with completely different methods, the existence of finite and
infinite quotients. A brief history of the quest for finitely generated and
finitely presented infinite simple groups is also sketched. A comparison with
Margulis' proof of Kneser's simplicity conjecture is discussed, and the
relevance of the Classification of the Finite Simple Groups is pointed out. A
final chapter is devoted to finite and infinite quotients of hyperbolic groups
and their relation to the asymptotic properties of the finite simple groups.
Numerous open problems are discussed along the way.Comment: Revised according to referee's report; definition of BMW-groups
updated; more examples added in Section 4; new Proposition 5.1
Recent developments on the power graph of finite groups - a survey
Funding: Ajay Kumar is supported by CSIR-UGC JRF, New Delhi, India, through Ref No.: 19/06/2016(i)EU-V/Roll No: 417267. Lavanya Selvaganesh is financially supported by SERB, India, through Grant No.: MTR/2018/000254 under the scheme MATRICS. T. Tamizh Chelvam is supported by CSIR Emeritus Scientist Scheme of Council of Scientific and Industrial Research (No.21 (1123)/20/EMR-II), Government of India.Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools in computer science. Conversely, graph theory has also helped to characterize certain algebraic properties of abstract algebraic structures. In this survey, we highlight the rich interplay between the two topics viz groups and power graphs from groups. In the last decade, extensive contribution has been made towards the investigation of power graphs. Our main motive is to provide a complete survey on the connectedness of power graphs and proper power graphs, the Laplacian and adjacency spectrum of power graph, isomorphism, and automorphism of power graphs, characterization of power graphs in terms of groups. Apart from the survey of results, this paper also contains some new material such as the contents of Section 2 (which describes the interesting case of the power graph of the Mathieu group M_{11}) and subsection 6.1 (where conditions are discussed for the reduced power graph to be not connected). We conclude this paper by presenting a set of open problems and conjectures on power graphs.Publisher PDFPeer reviewe
On group theory for quantum gates and quantum coherence
Finite group extensions offer a natural language to quantum computing. In a
nutshell, one roughly describes the action of a quantum computer as consisting
of two finite groups of gates: error gates from the general Pauli group P and
stabilizing gates within an extension group C. In this paper one explores the
nice adequacy between group theoretical concepts such as commutators, normal
subgroups, group of automorphisms, short exact sequences, wreath products...
and the coherent quantum computational primitives. The structure of the single
qubit and two-qubit Clifford groups is analyzed in detail. As a byproduct, one
discovers that M20, the smallest perfect group for which the commutator
subgroup departs from the set of commutators, underlies quantum coherence of
the two-qubit system. One recovers similar results by looking at the
automorphisms of a complete set of mutually unbiased bases.Comment: 10 pages, to appear in J Phys A: Math and Theo (Fast Track
Communication
The commuting graph of a soluble group
The commuting graph of a finite soluble group with trivial centre is
investigated. It is shown that the diameter of such a graph is at most 8 or the
graph is disconnected. Examples of soluble groups with trivial centre and
commuting graph of diameter 8 are provided
- …