Distance, Symmetry, and Topology in Carbon Nanomaterials by Ali Reza Ashrafi, Mircea V. Diudea

By Ali Reza Ashrafi, Mircea V. Diudea

This contributed quantity is electrified via the seminal discovery and identity of C60. beginning with a accomplished dialogue that includes graphene dependent nanostructures, next chapters contain topological descriptions of matrices, polynomials and indices, and a longer research of the symmetry and topology of nanostructures. Carbon allotropes equivalent to diamond and its connection to higher-dimensional areas is explored in addition to very important mathematical and topological concerns. additional subject matters lined comprise spontaneous symmetry breaking in graphene, polyhedral carbon buildings, nanotube junction energetics, and cyclic polyines as relations of nanotubes and fullerenes. This e-book is geared toward researchers lively within the examine of carbon fabrics technological know-how and technology.

Show description

Read or Download Distance, Symmetry, and Topology in Carbon Nanomaterials PDF

Best topology books

The cube: a window to convex and discrete geometry

8 subject matters in regards to the unit cubes are brought inside of this textbook: pass sections, projections, inscribed simplices, triangulations, 0/1 polytopes, Minkowski's conjecture, Furtwangler's conjecture, and Keller's conjecture. particularly Chuanming Zong demonstrates how deep research like log concave degree and the Brascamp-Lieb inequality can take care of the move part challenge, how Hyperbolic Geometry is helping with the triangulation challenge, how crew earrings can take care of Minkowski's conjecture and Furtwangler's conjecture, and the way Graph concept handles Keller's conjecture.

Riemannian geometry in an orthogonal frame

Foreword via S S Chern In 1926-27, Cartan gave a sequence of lectures within which he brought external varieties on the very starting and used widely orthogonal frames all through to enquire the geometry of Riemannian manifolds. during this direction he solved a sequence of difficulties in Euclidean and non-Euclidean areas, in addition to a chain of variational difficulties on geodesics.

Lusternik-Schnirelmann Category

"Lusternik-Schnirelmann type is sort of a Picasso portray. class from assorted views produces different impressions of category's good looks and applicability. "

Lusternik-Schnirelmann class is a topic with ties to either algebraic topology and dynamical structures. The authors take LS-category because the principal topic, after which enhance issues in topology and dynamics round it. integrated are workouts and plenty of examples. The publication offers the fabric in a wealthy, expository style.

The e-book presents a unified method of LS-category, together with foundational fabric on homotopy theoretic points, the Lusternik-Schnirelmann theorem on severe issues, and extra complex issues reminiscent of Hopf invariants, the development of capabilities with few serious issues, connections with symplectic geometry, the complexity of algorithms, and type of 3-manifolds.

This is the 1st e-book to synthesize those issues. It takes readers from the very fundamentals of the topic to the state-of-the-art. must haves are few: semesters of algebraic topology and, maybe, differential topology. it really is appropriate for graduate scholars and researchers attracted to algebraic topology and dynamical systems.

Readership: Graduate scholars and study mathematicians drawn to algebraic topology and dynamical structures.

Additional info for Distance, Symmetry, and Topology in Carbon Nanomaterials

Example text

2003). V. Diudea and B. Szefler The number of structures investigated for transitivity can be reduced by using an orthogonal edge-cutting procedure (see below). 2 Omega Polynomial by Edge-Cutting Procedures In bipartite graphs, an orthogonal edge-cutting procedure (Diudea 2010a, b, c; Diudea et al. 2010a, b; Gutman and Klavžar 1995; Klavžar 2008a, b) can be used to generate the ops. In performing a cut, take a straight line segment, orthogonal to the edge e, and intersect e and all its parallel edges (in a polygonal plane graph).

Some counterexamples for a recent open question on this topic are also presented; see Koorepazan-Moftakhar and Ashrafi (2015). We end this chapter with the following open question. Open Question Find a general formula for the class functions of fullerenes. Acknowledgment The first and second authors are partially supported by the University of Kashan under Grant No. 464092/2. 3 An Algebraic Modification of Wiener and Hyper–Wiener Indices and Their. . 49 References Ashrafi AR, Koorepazan-Moftakhar F (2014) Fullerenes and capped nanotubes: applications and geometry.

GL(n,C) is called a representation of G, where GL(n,C) denotes the set of all n  n invertible matrices over the complex field C. The mapping χ: G ! C given by χ(g) ¼ Trf(g) is called a character afforded by f. Suppose χ and ψ are characters of G. The inner product hχ,ψi is defined as ⟨χ, ψ⟩ ¼ 1 X χðgÞ ψðgÞ: g2G jGj The character χ is called irreducible, if hχ,χi ¼ 1. It is well known that the number of irreducible characters is the same as the number of conjugacy classes in G. One of the main applications of group theory in science is studying symmetry of molecules.

Download PDF sample

Rated 4.85 of 5 – based on 21 votes