CanaDAM 2013 Memorial University St, John’s Newfoundland Just how are the Clar and Fries structures of a fullerene related? Jack Graver Syracuse University.

Slides:



Advertisements
Similar presentations
Building a Conceptual Understanding of Algebra with Algebra Tiles
Advertisements

NP-Hard Nattee Niparnan.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
1 Counting Perfect Matchings of a Graph It is hard in general to count the number of perfect matchings in a graph. But for planar graphs it can be done.
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
DISCRETE MATH DAY at WPI Saturday, April WHEN DOES A CURVE BOUND A DISTORTED DISK? Jack Graver Syracuse University This presentation is based on.
3.3 Spanning Trees Tucker, Applied Combinatorics, Section 3.3, by Patti Bodkin and Tamsen Hunter.
Applied Combinatorics, 4th Ed. Alan Tucker
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
Tirgul 10 Rehearsal about Universal Hashing Solving two problems from theoretical exercises: –T2 q. 1 –T3 q. 2.
Applied Combinatorics, 4th Ed. Alan Tucker
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Tucker, Applied Combinatorics, Section 1.4, prepared by Patti Bodkin
Graph Colouring Lecture 20: Nov 25.
Definition Dual Graph G* of a Plane Graph:
Hashing General idea: Get a large array
Tirgul 13 Today we’ll solve two questions from last year’s exams.
Linear Inequalities in Two Variables
9.1 Solving Systems of Linear Equations by Substitution BobsMathClass.Com Copyright © 2010 All Rights Reserved. 1 Two linear equations in two variables.
Chapter 5.1 Systems of linear inequalities in two variables.
1/22/03Tucker, Applied Combinatorics, Section EDGE COUNTING TUCKER, APPLIED COMBINATORICS, SECTION 1.3, GROUP B Michael Duquette & Amanda Dargie.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Segment Measure and Coordinate Graphing
1 Preliminaries Precalculus Review I Precalculus Review II
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
Copyright © 2007 Pearson Education, Inc. Slide 1-1.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Binomial Coefficients, Inclusion-exclusion principle
UNC Chapel Hill Lin/Foskey/Manocha Minimum Spanning Trees Problem: Connect a set of nodes by a network of minimal total length Some applications: –Communication.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan Department of Mathematics and CS
Isomorphism: A First Example MAT 320 Spring 2008 Dr. Hamblin.
Chapter 9: Geometric Selection Theorems 11/01/2013
Techniques for Proving NP-Completeness Show that a special case of the problem you are interested in is NP- complete. For example: The problem of finding.
6.896: Topics in Algorithmic Game Theory Lecture 6 Constantinos Daskalakis.
1 The number of orientations having no fixed tournament Noga Alon Raphael Yuster.
1 Rainbow Decompositions Raphael Yuster University of Haifa Proc. Amer. Math. Soc. (2008), to appear.
Lines in the plane, slopes, and Euler’s formula by Tal Harel
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Planar Graphs. A graph is called planar if it can be drawn in the plane in such a way that no two edges cross. Example of a planar graph: The clique on.
Planar Graphs Graph Coloring
Agenda Review: –Planar Graphs Lecture Content:  Concepts of Trees  Spanning Trees  Binary Trees Exercise.
Connectivity and Paths 報告人:林清池. Connectivity A separating set of a graph G is a set such that G-S has more than one component. The connectivity of G,
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Copyright © Cengage Learning. All rights reserved. 1 Functions and Models.
Knight’s Circuit. Problem To find a Knight’s circuit of a chess board. Can we visit every square of a chessboard, once and only once, and return to the.
Joint Moments and Joint Characteristic Functions.
Combinatorics Ramsey theory.  a precocious British mathematician, philosopher and economist  a problem in mathematical logic: can one always find order.
FUNCTIONS AND MODELS Exponential Functions FUNCTIONS AND MODELS In this section, we will learn about: Exponential functions and their applications.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
Copyright © Cengage Learning. All rights reserved. 15 Distribution-Free Procedures.
12. Lecture WS 2012/13Bioinformatics III1 V12 Menger’s theorem Borrowing terminology from operations research consider certain primal-dual pairs of optimization.
Copyright © Cengage Learning. All rights reserved. 8 9 Correlation and Regression.
1 Graphs Chapters 10.1 and 10.2 University of Maryland Chapters 10.1 and 10.2 Based on slides by Y. Peng University of Maryland.
Graphs. Representations of graphs : undirected graph An undirected graph G have five vertices and seven edges An adjacency-list representation of G The.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Richard Anderson Lecture 26 NP-Completeness
Applied Combinatorics, 4th Ed. Alan Tucker
Geometric Graphs and Quasi-Planar Graphs
Chapter 5. Optimal Matchings
Chapter 4-5 Systems of linear inequalities in two variables.
Depth Estimation via Sampling
Applied Combinatorics, 4th Ed. Alan Tucker
V12 Menger’s theorem Borrowing terminology from operations research
Minimum Spanning Trees
Presentation transcript:

CanaDAM 2013 Memorial University St, John’s Newfoundland Just how are the Clar and Fries structures of a fullerene related? Jack Graver Syracuse University This is joint work with Elizabeth Hartung

Suppose that we have a fullerene with Clar structure (C,A) and that the Clar chains are non-interfering. Then there are just 3 types: Type 1 Type 2 Type 3

Given the Clar structure (C,A), we have the formula: |C|= |V|/6 -|A|/3 Given any Kekule structure K, we let B 3 denote the number of benzene rings, A 1 denote the set of edges of K that belong to exactly 1 benzene ring and A 0 the set of edges of K that belong to no benzene ring. For such a Kekule structure K, we then have the analogous formula: |B 3 |= |V|/3 – (2|A 0 |+|A 1 |)/3 Proof: Double counting the edges of K, we have 3|B 3 |+|A 1 |+2|A 0 |=2|K|=|V|

In |C|= |V|/6 -|A|/3, we identify |A| as the Clar deficit and to compute the Clar number of the fullerene, we seek to minimize |A| over all Clar structures for the fullerene. In |B 3 |= |V|/3 – (2|A 0 |+|A 1 |)/3, we identify 2|A 0 |+|A 1 | as the Fries deficit and to compute the Fries number of the fullerene, we seek to minimize 2|A 0 |+|A 1 | over all Kekule structures for the fullerene.

Given the Clar structure (C,A), we have the induced improper face 3-coloring with the Clar faces forming one color class – the yellow faces in this case. To obtain a Kekule structure for this Clar structure, we must select an orientation of the double bonds for each face in C. We have just two choices for each Clar face: We denote them by RV for “red void” and BV for “blue void”

The interface between the RV and BV Clar faces may be identified with a degree 2 subgraph of the dual graph. Hence, this interface corresponds to a collection of disjoint circuits in the dual graph. Each dual-vertex/face in these circuits contributes 1 or 2 to the Fries deficit. However, these contribution can be reduced by shrinking these circuits until they surround individual chains These contributions can then incorporated into the Fries deficits for each individual chain.

We conclude that associated with each Clar structure there are two natural Kekule structures that give a minimal Fries deficit. They are obtained by choosing all Clar faces to be of type RV or all to be of type BV and make adjustments in the neighborhoods Will we always get THE Kekule structure that gives THE Fries number from some Clar structure in this way? The answer is yes!

Let K be THE Kekule structure that gives THE Fries number. Let C denote a maximum independent set of benzene rings for this Kekule structure. The set C along with A, the set of edges in K that do not lie on any face in C, form a Clar structure (C,A). It is not too difficult to see that K differs from one of the two Kelule structures associated with (C,A) only in regions around the chains.

Actually, we don’t need a Clar structure to get a chain decomposition or chain pairing. Given a fullerene and any Kekule structure K and any coupling of exiting vertices across the faces, we get a set of closed chains and six open chains pairing the pentagons. Ignoring the closed chains, a set of open chains of shortest total length over all Kekule structures & all possible couplings is a shortest chain paring.

We will assume that we are given a fullerene with a unique shortest chain pairing and that these chains are “widely separated.” We then construct and fix an improper face 3-coloring. We will identify each chain by its Coxeter coordinates and its color code.

W w We will identify each chain by its color code and its Coxeter coordinates: this is a B-Y (6,3) chain. Note that the longer chain is a B-R chain. We will use the shorter chain color code in identifying the pairing even if the longer chain is used in the Clar or Fries decomposition.

By folding we may construct equivalent chains of the same length:

Given our widely separated chain decomposition with the induced face 3- coloring, we have a basic choices to make: Which of the 3 color classes will be the void faces. For each of these 3 options, we will compute the contribution to the Fries and Clar deficit of a B-Y (m,n) chain and illustrate it with our B-Y (6,3) example.

Let the blue faces be void. The contributions to the Fries and Clar deficits are: 0 to the Fries deficit; m to the red Clar deficit; m+n to the yellow Clar deficit. For the red Clar, the white faces are yellow; for the yellow Clar, the white faces are red.

Let the yellow faces be void. The contributions to the Fries and Clar deficits are: 4m+2 to the Fries deficit; m to the red Clar deficit; 3m+2 to the blue Clar deficit. A 0 consists of the m red edges, these edges belong to both Clar chains; A 1 consists of the 2m+2 light blue edges and belong to the blue Clar chain. Hence the Fries deficit is the sum of the two Clar deficits.

When the red faces are void there are two different “fixes.” The fix based on the m chain gives the correct blue Clar deficit but Fries and yellow Clar deficits that are too large. The fix based on the m+n chain gives the correct Fries and yellow Clar deficits but a blue Clar deficit that is too large. Hence, in this case the Fries number and the blue Clar number will not be given by the same Kekule structure.

Let the red faces be void. The contributions are: 8m+8 to the Fries deficit; (A0 - the 3m+2 red and light blue edges. A1- the 2m+4 green edges.) 3m+2 to the blue Clar deficit (red and light blue edges) ; 5m+6 to the yellow Clar deficit (red, light blue and light green edges) Again 8m+8 = 3m+2 + 5m+6.

Let the red faces be void. The contributions are: 4(m+n)+2 to the Fries deficit; (A 0 – the m+n yellow edges. A 1 - the 2(m+n)+2 green edges.) 3(m+n)+2 to the blue Clar deficit (yellow and light green edges) ; m+n to the yellow Clar deficit (yellow edges) Again 4(m+n)+2 = 3(m+n)+2 + m+n.

Permuting the colors in this case enables us to make a table of the Fries and Clar deficits for all X-Y (m,n) chains. This, in turn, enables us to get exact formulas for the Fries and Clar numbers for many families of fullerenes with widely separated pairing.

Consider the fullerene with this structure graph: If we take r to be a multiple of 3 and s a large enough integer not a multiple of 3, this will be a fullerene with widely separated paired pentagons – the red and purple edges.

Hence, we may give formulas the the Fries and Clar numbers in terms of the variables p, r and s: If s is congruent to 1 mod 3, the chains alternate Blue-Red, Yellow-Red, Blue-Red, … and we have: Fries # = 8r 2 /3 + 4s 2 + 8rs + 4(p-1)(r+2s) - 2 Clar # = 4r 2 /3 + 2s 2 + 4rs + 2(p-1)(r+2s) If s is congruent to 2 mod 3, the chains alternate Blue-Red, Red-Blue, Blue-Red, … and we have: Fries # = 8r 2 /3 + 4s 2 + 8rs + 4p(r+2s) - 4(r+s) - 2 Clar # = 4r 2 /3 + 2s 2 + 4rs + 2p(r+2s) – 2(r+s) In both cases, the same Kekule structure gives both the Fries and Clar numbers.

As we saw, there are cases where different “fixes” are needed to the Fries # and Clar #:

However, this slight difference over a few chains does not seem to explain all the cases in which different Kekule structures are required for the Fries and Clar numbers. There are two other possible explanations: Could the Fries and Clar Kekule structures require different pairings of the pentagons? Could they require entirely different Kekule structures, that is different choices for the void faces?

We do not know the answer to the first question. However, we have a construction for a family of fullerenes in which the Kekule structure that gives the Fries number is virtually disjoint from the Kekule structure that gives the Clar number. The plan is to construct a fullerene for which one must choose the red faces to be void for the Fries number and the blue faces to be void for the Clar number.

We start with 3 widely separated chains: one Red-Blue (m,n) chain, one Yellow-Red (p,q) chain and one Blue-Yellow (u,v) chain. One may then patch these together to get a nanotube cap as pictured on the next slide with a Red-Blue (7,4) chain, a Yellow-Red (9,3) chain and a Blue-Yellow (7,1) chain. An equatorial chain is indicated in green and a half-turn about an axis through the light blue points, gives a duplicate bottom cap with blue and yellow interchanged.

NOTE: to keep the model “small”, these chains are NOT widely separated. In the general case, we now have a Red-Blue & a Red-Yellow (m,n) chain, a Yellow-Red & a Blue-Red (p,q) chain, a Blue-Yellow & Yellow-Blue (u,v) chain

If we choose the red faces to be void, the Fries deficit will be 8(p+u+v+1) If we choose the yellow or blue faces to be void, the Fries deficit will be 4(2m+n+p+q+u+2) The inequality 8(p+u+v+1)<4(2m+n+p+q+u+2) simplifies to p+u+2v < 2m+n+q and, if it is satisfied, the Fries set giving the Fries number requires the the red faces be void.

If we choose the red faces to be void, the Blue or Yellow Clar deficit will be 2m+n+4p+4u+v+4 If we choose the yellow or blue faces to be void, the Red Clar deficit will be 6m+2p+2q+2u+4 and the Blue or Yellow Clar deficit will again be 2m+n+4p+4u+v+4 The inequality 6m+2p+2q+2u+4<2m+n+4p+4u+v+4 simplifies to 4m+2q < n+2p+2u+v and, if it is satisfied, the Clar set giving the Clar number requires the the blue or yellow faces be void.

Hence, any fullerene in this class that satisfies p+u+2v<2m+n+q & 4m+2q<n+2p+2m+v along with the mod 3 congruence conditions will obtain its Fries number with the red face void and its Clar number with Clar red faces when either the blue or yellow faces void. These inequalities are satisfied by our example, (m,n)=(7,4), (p,q)=(9,3) and (u,v)=(7,1), and give a Fries deficit of 144 (red faces void) and a Clar deficit of 84 (Clar faces red, yellow or blue void).

This model has 1728 atoms and 872 faces. Since these chains are not widely separated we cannot be certain that this is the correct chain decomposition. Assuming that it is, we have that: When the red faces are void, there are 528 benzene faces giving Fries # = 528 and there are 259 blue (or yellow) benzene faces. When the blue (yellow) faces are void there are only 524 benzene faces; but, there are 260 red benzene faces and only 259 yellow (blue) benzene faces giving: Clar # = 260.