# Smooth functions statistics

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected components of the level hypersurface of the function. For a Morse function f : S n R, n > 1, such a graph is a tree. Generically, it has T triple vertices, T + 2 endpoints, 2T + 2 vertices and 2T + 1 arrows. Example 1. For the Elbrous mountain, with two maxima and, separated by the saddle point, the tree is T = 1, D D We shall consider functions on R n, behaving as r far from the origin, as continued to S n with a Morse minimum at = S n R n (represented by the vertex D for the above mountain). Example 2. For the Vesuvius mountain, with crater, the tree is T = 1, D D 1

2 We shall include in the graph structure the ordering of the critical values, f() > f() > f() > f(d) in Example 1, f() > f() > f() > f(d) in Example 2. For simplicity we will suppose below, that all the 2T +2 critical values are different, T being the number of the saddle-points of a function on S 2 (the graphs of Morse functions on S n are similar, and the cases of other domains, like T n = (S 1 ) n, can be studied by a similar technique). The main goal of the present paper is to study the statistics of the graphs, corresponding to T triple points: what is the growth rate of the number ϕ(t ) of different graphs? Which part of these graphs is representable by the polynomial functions of corresponding degree? generic polynomial of degree n has at most (n 1) 2 critical points on R 2, corresponding to 2T + 2 = (n 1) 2 + 1, that is to T = 2k(k 1) saddle-points for degree n = 2k. Theorem 1. The first numbers ϕ(t ) of the graphs with T triple points are T ϕ(t ) The growth rate of these numbers is bounded by the following two results. Theorem 2. The lower bound for the number ϕ(t ) of the graphs with T triple points is ϕ(t ) (T 2 (2T + 2)! + 5T + 5). (T + 4)! For 2 T 4 the right hand side values are 19, 232, 3690, and their Stirling growth rate is 4(4/e) T T T > T T. Theorem 3. The upper bound for the number ϕ(t ) of the graphs with T triple points is ϕ(t ) T 2T (for T > 2). The main technical tool for the proof of Theorem 2 is provided by the explicit calculation of the number of those graphs with T triple points, whose triple points form a monotone -chain (with the critical values f( 1 ) > f( 2 ) > > f( T ) of adjacent points T ). 2

3 Theorem 4. The number of the graphs with T 2 triple points, forming monotone -chains, is equal to ψ(t ) = (T 2 + 5T + 5) (2T + 2)! (T + 4)!. Theorem 2 follows from Theorem 4, the number of all graphs ϕ(t ) being at least equal to the number of graphs, whose triple points form -chains. Remark. Some of our graphs are corresponding to the generic Morse polynomials (of degree n = 2k for T = 2k(k 1)), and some does not. It would be interesting to know, whether the representable graphs (or the nonrepresentable ones) do form an asymptotically small part of the totality of graphs with T triple points (for T ). The numbers of the topologically different realizations of realizable graphs are also unknown. Proof of Theorem 4. Let us denote by a the critical point, adjacent to 1 which has the highest critical value, f(a) > f( 1 ). Similarly, denote by z the critical point, adjacent to T, which has the lowest critical value, f(z) < f( T ). Denote by α the third critical point, adjacent to 1 (different from a and 2 ). Denote by ω the third critical point, adjacent to T (different from z and from T 1 ). To classify the framings of the triple points 1,..., T of the graphs by the ending segments, we first observe, that the critical value f(α) belongs to the complement of the following set of T + 1 real numbers, smaller than f(a): {f( 1 ),..., f( T ), f(z)}. Therefore, there are T + 1 cases, for which f(a) > f(z) and one more, where f(a) < f(z). Knowing the situation of the critical value f(α), consider the critical value f(ω) > f(z). It must be different from the T + 2 values {f( 1 ),..., f( T ), f(a), f(α)} on the ray {t > f(z)} if f(a) > f(z), differing from the T + 1 values on the ray {t > f(z)} if f(a) < f(z). {f( 1 ),..., f( T ), f(a)} 3

4 Therefore, we get the total number (T + 1)(T + 3) + 1(T + 2) = T 2 + 5T + 5 of the variable framings {α, ω} of the triple endpoints, 1 and T. t the endpoint a 2, adjacent to 2, the critical value should differ from the T + 4 already choosen values {f( 1 ),..., f( T ), f(a), f(α), f(z), f(ω)}, which subdivides every one of the previous cases into T + 5 subcases. hoosing f(a 2 ), we get for f(a 3 ) the necessity to avoid T + 5 places, for f(a i ) to avoid the T i values {f( 1 ),..., f( T ); f(a), f(z); f(α), f(ω); f(a 2 ),..., f(a i 1 )}. These values subdivide the real line into T i intervals, multiplying the number of different graphs by T i. Using this reasoning T 2 times (for i = 2, 3,..., T 1), we subdivide each of the T 2 + 5T + 5 classes of the framings of the endvertices 1 and T of the chain of triple points into the subcases, whose number equals to the product of the intervals numbers of all the steps, (T + 5)(T + 6)... (T T 1) = (2T + 2)! (T + 4)!. ll these subclasses correspond to different graphs, proving Theorem 4. To prove Theorem 3, we start from the Lemma. The inequality ϕ(t ) 4T 2 ϕ(t 1) holds for any T 2. Example. For T = 2, 3 and 4 one has (ϕ(2) = 19) < (16 2 = 32), (ϕ(3) = 428) < (36 19 = 684), (ϕ(4) = 17746) < ( = 27392). 4

5 Proof of the Lemma. The maximal critical value is attained at an end-point of the connected graph with T triple points. This end-point is a neighbour of one of the triple-points,. Deleting the edge, we reduce the original graph with T triple points to a new connected graph with T 1 triple points. There are ϕ(t 1) such graphs. To reconstruct the initial larger graph one should choose an arrow, where to insert the new triple point (there are 2(T 1) + 1 = 2T 1 arrows) and choose the value at (there are 2T values at the 2(T 1) 2 vertices of the smaller graph, leaving 2T + 1 different possibilities). The total number of the choices is (2T 1)(2T + 1) < 4T 2, proving the Lemma. These reasonings prove in fact more, than stated: one evaluates this way the larger number, including those ordered graphs, for which the triple point value is higher, than all its three neighbouring vertices values, and those, where it is smaller, than all the three (which never happens for the graphs of functions, whose number is therefore even smaller, than our Lemma inequality proves). Proof of Theorem 3. For T = 3 we have ( ϕ(3) = 428 ) < (3 6 = 729). If Theorem 3 holds for T = S 1, we get by the Lemma ϕ(s) 4S 2 (S 1) 2S 2. ( ) The obvious inequality implies, that ( 1 1 ) S < 1 S e 4S 2 (S 1) 2S 2 4S2 (S 1) 2 ( ) 2S S 1 S 2S S < 4 e 2 S 2 (S 1) 2 S2S. The coefficient 4S 2 / (e 2 (S 1) 2 ) is smaller, than 1, for 2S e(s 1), which holds for S 4. 5

6 Thus, if S 4 Theorem 3 for T = S 1 together with inequality ( ), imply that ϕ(s) S 2S. Theorem 3 is therefore proved, since it is true for T = 3, being hence true for T = 4, 5,.... Proof of Theorem 1. onsider the T triple points of the graph (with 2T + 2 vertices). They form the vertices of a smaller connected graph, which is obtained for the initial big graph with T triple points deleting its T + 2 endpoints (together with the T + 2 edges, leading to them from the T triple points). For T = 1, 2 and 3 the resulting (ordered) graphs are of the forms T = 1 T = 2 T = 3 and the framings are counted by Theorem 4 in first 3 cases, providing ϕ(1) = 2, ϕ(2) = = 19 and ψ(3) = ( ) 8 = 232 framings. Each of the last two cases is studied similarly to the proof of Theorem 4, providing 98 framing each (the equality of both numbers is an evident corollary of the symmetry, transforming each of the two last diagrams to the other). For T = 4 triple points, there are IX essentially different cases to study, I II III IV V VI VII VIII IX 6

7 The cases II, IV, V, VIl, IX, are representing two (symmetric) graphs each (similarly to the two last graphs of the T = 3 case). These graphs are different, but their numbers of framings are equal (by the symmetry bijection between the graphs sets). These numbers of framings, ψ, are case I II III IV V VI VII VIII IX ψ(case) The largest case I is described in the proof of Theorem 2 above. The framings counting in the other 8 cases is similar, but the details are too long to be reproduced here. The total number of graphs, taking the symmetrical cases into account, is proving Theorem 1. ϕ(4) = ψ(i) + ψ(iii) + ψ(vii) + ψ(viii)+ + 2 (ψ(ii) + ψ(iv) + ψ(v) + ψ(vi) + ψ(ix)) = = (6114) = 17746, Remark. It would be interesting to study, what is the true growth rate of ϕ(t ) for large T (perhaps T ct, neglecting the logarithmical corrections, for some 1 c 2, and with a constant c which looks to be closer to 2). The preceding statistics for T = 4 shows some uniformity of the distribution of the graphs among the 9 triple vertices subgraphs types. For the special subgraph of T triple vertices with critical values II(T ) = {a 1 > a 2 > > a T 1, a 1 > b > a 2 } the asymptotics of the numbers of framings is ψ ( II(T ) ) namely, ψ ( I(T ) ) 1 2 for T, ψ ( II(T ) ) T 2 (2T + 2)! 2(T + 4)! It would be interesting to study such asymptotical interrelations between the numbers of framings of different diagrams. 7.

8 I hope, that similar reasonings might provide the lower bound ϕ(t ) > T 2 ϕ(t 1) for some constant, perhaps even for = 2. Indeed, among the 4T 2 1 ways of adding a new edge, leading to the maximum critical value point, most ways provide genuine larger graphs with one more triple point, choosen at an arbitrary one of the 2T 1 edges of the given graph with T 1 triple vertices. The only difficulty is the choice of the value at this newly created triple point. There are 2T + 1 intervals where the value ought to be choosen, but if the values at the boundary points of the choosen edge, where the new triple point is situated, are u and v, the new value should not be smaller, than both u and v. The third neighbour of the added point being the maximum point, the choice of the new value w < u, w < v, would produce in the bigger graph a vertice, where the value is smaller, than all its three neighbours, which never happens for the graphs of the Morse functions. n euristical (nonrigorous) estimation of the part of bad situations is about 1/4 of the total number of the 4T 2 1 attempts to construct a bigger graph : the probabilities of the inequalities w < u and of w < v for a random choice of w seem to be 1/2 each, and these two events looking independent, one gets 1/4 bad cases among the total number 4T 2 1 proposals of the bigger graph, provided that statistically the distribution of the values at the vertices behaves similarly to the random independent choices of the values. This asymptotical ergodicity is a difficult conjecture, if one desires a rigorous proof, but one might check this conjecture experimentally (say, for T = 5, 6, 7, 8) in few hours of the time of a computer. ssuming the probability 1/4, we would replace the coefficient = 4 by = 3, but the Theorem 1 numbers suggest for the limit of the ratio ϕ(t ) T 2 ϕ(t 1) (T tending to infinity) a smaller value, closer to 2, than to 3. This might be explained by the next obstacle, reducing the number of the successful constructions once more. Suppose, that we choose the new value in between the two neighbours, u < w < v. This choice would spoil the vertex, where the value is u, provided, that its other two neighbours have higher values, than u : for the new graph there will 8

9 be a triple vertex, where the value is smaller, then all the three neighbours, which never happens for a Morse function. alculating the probability of this new desaster by the previous ergodic conjectures, one reduces the value = 3 to 3/4 of it, which is = 9/4. These semiempirical suggestions are not too far from the observed values: is not far from (ϕ(t = 4) = 17746)/(ϕ(3) = 428) ( = 9/4)(T = 4) 2 = 36. nyway, whatever be the constant, the inequality ϕ(t ) > T 2 ϕ(t 1) would imply the essentially T 2T behaviour of ϕ(t ), the value of the positive constant influencing only some logarithmical factor (the exponents const T being logarithmically small with respect to the main term T 2T ). In fact the upper bound of Theorem 3 is proved above for the larger number, than Φ(T ), counting among other graphs those oriented graphs, which contain some vertices, where the value is greater, than all the three values at the neighbouring vertices. This event would be impossible for the graph of a function, but the upper bound for the larger number bounds also the smaller number ϕ. To get by these reasonings the lower bounds one needs to know the probability of the impossible situations, described above, and the proofs depend, therefore, on difficult ergodicity statements for the random graphs, which I had not proved. For the functions on the torus T 2 (needed for the trigonometrical polynomials study) the graphs are no longer trees, they have g = 1 cycles for the surfaces of genus g = 1. The numbers of such graphs with T triple points for T = 2, 3, 4 are 1, 16,

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

### LIMITS AND CONTINUITY

LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia

### TOPIC 3: CONTINUITY OF FUNCTIONS

TOPIC 3: CONTINUITY OF FUNCTIONS. Absolute value We work in the field of real numbers, R. For the study of the properties of functions we need the concept of absolute value of a number. Definition.. Let

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

### MTH4100 Calculus I. Lecture notes for Week 8. Thomas Calculus, Sections 4.1 to 4.4. Rainer Klages

MTH4100 Calculus I Lecture notes for Week 8 Thomas Calculus, Sections 4.1 to 4.4 Rainer Klages School of Mathematical Sciences Queen Mary University of London Autumn 2009 Theorem 1 (First Derivative Theorem

### Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

### 6. GRAPH AND MAP COLOURING

6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### 5. GRAPHS ON SURFACES

. GRPHS ON SURCS.. Graphs graph, by itself, is a combinatorial object rather than a topological one. But when we relate a graph to a surface through the process of embedding we move into the realm of topology.

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### The Mean Value Theorem

The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### EXAMENSARBETEN I MATEMATIK

EXAMENSARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Some observations on Fatou sets of rational functions av Per Alexanderson 2007 - No 13 MATEMATISKA INSTITUTIONEN, STOCKHOLMS

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### 3.7 Non-autonomous linear systems of ODE. General theory

3.7 Non-autonomous linear systems of ODE. General theory Now I will study the ODE in the form ẋ = A(t)x + g(t), x(t) R k, A, g C(I), (3.1) where now the matrix A is time dependent and continuous on some

### Continuity. DEFINITION 1: A function f is continuous at a number a if. lim

Continuity DEFINITION : A function f is continuous at a number a if f(x) = f(a) REMARK: It follows from the definition that f is continuous at a if and only if. f(a) is defined. 2. f(x) and +f(x) exist.

### Tilings of the sphere with right triangles III: the asymptotically obtuse families

Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Planar Graphs. Complement to Chapter 2, The Villas of the Bellevue

Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn

### Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions

Natalia Lazzati Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions Note 5 is based on Madden (1986, Ch. 1, 2, 4 and 7) and Simon and Blume (1994, Ch. 13 and 21). Concave functions

### MA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity

MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x

### Lecture 4: BK inequality 27th August and 6th September, 2007

CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Review for Calculus Rational Functions, Logarithms & Exponentials

Definition and Domain of Rational Functions A rational function is defined as the quotient of two polynomial functions. F(x) = P(x) / Q(x) The domain of F is the set of all real numbers except those for

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### 7. Cauchy s integral theorem and Cauchy s integral formula

7. Cauchy s integral theorem and Cauchy s integral formula 7.. Independence of the path of integration Theorem 6.3. can be rewritten in the following form: Theorem 7. : Let D be a domain in C and suppose

### 1 The Line vs Point Test

6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Chapter 4. Polynomial and Rational Functions. 4.1 Polynomial Functions and Their Graphs

Chapter 4. Polynomial and Rational Functions 4.1 Polynomial Functions and Their Graphs A polynomial function of degree n is a function of the form P = a n n + a n 1 n 1 + + a 2 2 + a 1 + a 0 Where a s

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Moduli of Tropical Plane Curves

Villa 2015 Berlin Mathematical School, TU Berlin; joint work with Michael Joswig (TU Berlin), Ralph Morrison (UC Berkeley), and Bernd Sturmfels (UC Berkeley) November 17, 2015 Berlin Mathematical School,

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### 4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests

4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in

### Calculus C/Multivariate Calculus Advanced Placement G/T Essential Curriculum

Calculus C/Multivariate Calculus Advanced Placement G/T Essential Curriculum UNIT I: The Hyperbolic Functions basic calculus concepts, including techniques for curve sketching, exponential and logarithmic

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### 14. Trees and Their Properties

14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### Taylor Series and Asymptotic Expansions

Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

### Competitive Analysis of On line Randomized Call Control in Cellular Networks

Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising

### THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed

### Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

### Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

### Comments on Quotient Spaces and Quotient Maps

22M:132 Fall 07 J. Simon Comments on Quotient Spaces and Quotient Maps There are many situations in topology where we build a topological space by starting with some (often simpler) space[s] and doing

### Approximating the entropy of a 2-dimensional shift of finite type

Approximating the entropy of a -dimensional shift of finite type Tirasan Khandhawit c 4 July 006 Abstract. In this paper, we extend the method used to compute entropy of -dimensional subshift and the technique

### 8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### Vectors, Gradient, Divergence and Curl.

Vectors, Gradient, Divergence and Curl. 1 Introduction A vector is determined by its length and direction. They are usually denoted with letters with arrows on the top a or in bold letter a. We will use

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### 5.1 Derivatives and Graphs

5.1 Derivatives and Graphs What does f say about f? If f (x) > 0 on an interval, then f is INCREASING on that interval. If f (x) < 0 on an interval, then f is DECREASING on that interval. A function has

### 1 Approximating Set Cover

CS 05: Algorithms (Grad) Feb 2-24, 2005 Approximating Set Cover. Definition An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of subset of X, such that every elemennt

### Cylinder Maps and the Schwarzian

Cylinder Maps and the Schwarzian John Milnor Stony Brook University (www.math.sunysb.edu) Bremen June 16, 2008 Cylinder Maps 1 work with Araceli Bonifant Let C denote the cylinder (R/Z) I. (.5, 1) fixed

### Diameter of paired domination edge-critical graphs

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 279 291 Diameter of paired domination edge-critical graphs M. Edwards R.G. Gibson Department of Mathematics and Statistics University of Victoria

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### The edge slide graph of the n-dimensional cube

The edge slide graph of the n-dimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

### DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

### Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the

### Monotone Partitioning. Polygon Partitioning. Monotone polygons. Monotone polygons. Monotone Partitioning. ! Define monotonicity

Monotone Partitioning! Define monotonicity Polygon Partitioning Monotone Partitioning! Triangulate monotone polygons in linear time! Partition a polygon into monotone pieces Monotone polygons! Definition

### Brendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235

139. Proc. 3rd Car. Conf. Comb. & Comp. pp. 139-143 SPANNING TREES IN RANDOM REGULAR GRAPHS Brendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235 Let n~ < n2

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### Equations. #1-10 Solve for the variable. Inequalities. 1. Solve the inequality: 2 5 7. 2. Solve the inequality: 4 0

College Algebra Review Problems for Final Exam Equations #1-10 Solve for the variable 1. 2 1 4 = 0 6. 2 8 7 2. 2 5 3 7. = 3. 3 9 4 21 8. 3 6 9 18 4. 6 27 0 9. 1 + log 3 4 5. 10. 19 0 Inequalities 1. Solve

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### Lecture 22: November 10

CS271 Randomness & Computation Fall 2011 Lecture 22: November 10 Lecturer: Alistair Sinclair Based on scribe notes by Rafael Frongillo Disclaimer: These notes have not been subjected to the usual scrutiny

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Diameter and Treewidth in Minor-Closed Graph Families, Revisited

Algorithmica manuscript No. (will be inserted by the editor) Diameter and Treewidth in Minor-Closed Graph Families, Revisited Erik D. Demaine, MohammadTaghi Hajiaghayi MIT Computer Science and Artificial

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:

THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### A note on properties for a complementary graph and its tree graph

A note on properties for a complementary graph and its tree graph Abulimiti Yiming Department of Mathematics Institute of Mathematics & Informations Xinjiang Normal University China Masami Yasuda Department

### Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

### Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON

Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf

### An Empirical Study of Two MIS Algorithms

An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,

### Characterizations of Arboricity of Graphs

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs