Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
The Force of Symmetry gives an elementary introduction to the spectacular interplay between the three great themes of contemporary physics: quantum behaviour; relativity; and symmetry. In clear, non-technical language, though without oversimplification, it explores many fascinating aspects of modern physics, discussing the nature and interaction of force and matter. All these themes are drawn together, towards the end of the book, to describe the most successful physics theory in history, the 'standard model' of subatomic particles. The lively and non-technical approach of this book will make it suitable for first-year undergraduates in the physical sciences and mathematics, or even to those just about to embark on such courses. It will also be a valuable accompaniment to more advanced texts on quantum mechanics and particle physics.
Choose an application
This reprint is dedicated to Professor Delfim F. M. Torres for his 50th birthday. Professor Delfim F. M. Torres is a recognized researcher, particularly in the calculus of variations, optimal control, and mathematical biology. In this reprint, several studies in his research fields are presented.
Choose an application
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.
Choose an application
Choose an application