Distances in Sierpiński Triangle Graphs
|
|
- Ἀθήνη Καψής
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Distances in Sierpiński Triangle Graphs Sara Sabrina Zemljič joint work with Andreas M. Hinz June 18th 2015
2 Motivation Sierpiński triangle introduced by Wac law Sierpiński in S. S. Zemljič 1
3 Motivation S. S. Zemljič 1
4 Motivation S. S. Zemljič 1
5 Motivation S. S. Zemljič 1
6 Motivation S. S. Zemljič 1
7 Motivation Sierpiński triangle introduced by Wac law Sierpiński in Sierpiński graphs introduced by Klavžar and Milutinović in 1997, connected to the Tower of Hanoi puzzle state graphs for the Switching Tower of Hanoi puzzle. S. S. Zemljič 1
8 Motivation ˆ ˆ ˆ Graphs ST 3 3 (left) and S 3 3 (right) S. S. Zemljič 1
9 Motivation Sierpiński triangle introduced by Wac law Sierpiński in Sierpiński graphs introduced by Klavžar and Milutinović in 1997, connected to the Tower of Hanoi puzzle state graphs for the Switching Tower of Hanoi puzzle. Applications outside mathemtics Physics spectral theory (Laplace operator), spanning trees (Kirchhof s Theorem), Psychology state graphs of the Tower of Hanoi puzzle. S. S. Zemljič 1
10 Notations [n] := {1,..., n}, [n] 0 := {0,..., n 1}, T := [3] 0 = {0, 1, 2}, T := {ˆ0, ˆ1, ˆ2}, P := [p] 0 = {0,..., p 1}, P := { ˆk k P}. S. S. Zemljič 2
11 Definition (Idle peg labeling) Let n N. Sierpiński triangle graphs ST n are the graphs defined as follows: S. S. Zemljič 3
12 Definition (Idle peg labeling) Let n N. Sierpiński triangle graphs ST n are the graphs defined as follows: ˆ0 ST 0 3 = K 3 V (ST 0 3 ) = T ˆ1 ˆ2 vertices ˆ0, ˆ1, and ˆ2 are primitive vertices S. S. Zemljič 3
13 Definition (Idle peg labeling) Let n N. Sierpiński triangle graphs ST n are the graphs defined as follows: V (ST3 n ) = T {s T ν ν [n]}, { } E (ST3 n ) = { ˆk, k n 1 j} k T, j T \ {k} } {{sk, sj} s T n 1, {j, k} ( T 2 ) } { {s(3 i j)i n 1 ν k, sj} s T ν 1, ν [n], i T, j, k T \ {i} S. S. Zemljič 3
14 Example Idle peg labeling ˆ0 ˆ1 ˆ2 S. S. Zemljič 4
15 Example Idle peg labeling ˆ0 2 1 ˆ1 0 ˆ2 S. S. Zemljič 4
16 Example Idle peg labeling ˆ ˆ ˆ2 S. S. Zemljič 4
17 Example Idle peg labeling ˆ ˆ ˆ2 S. S. Zemljič 4
18 Example Idle peg labeling ˆ ˆ ˆ2 S. S. Zemljič 4
19 Example Idle peg labeling ˆ ˆ ˆ2 S. S. Zemljič 4
20 Example Idle peg labeling ˆ ˆ ˆ2 S. S. Zemljič 4
21 Contraction labeling Let n N. Contraction labeling of Sierpiński triangle graphs ST n 3 ˆ0 ST 0 3 = K 3 V (ST 0 3 ) = T ˆ1 ˆ2 S. S. Zemljič 5
22 Contraction labeling Let n N. Contraction labeling of Sierpiński triangle graphs ST n 3 } V (ST3 n ) = T {s{i, j} s T ν 1, ν [n], {i, j} ( T 2 ), { } E (ST3 n ) = { ˆk, k n 1 {j, k}} k T, j T \ {k} { } {s{i, j}, s{i, k}} s T n 1, i T, {j, k} ( T \{i} 2 ) { } {ski n 1 ν {i, j}, s{i, k}} s T ν 1, ν [n 1], i T, {j, k} T \ {i} S. S. Zemljič 5
23 Basic properties ST n 3 = 3 2 (3n + 1) ST n 3 = 3 n+1 ˆ graphs ST n 3 are connected ˆ ˆ2 S. S. Zemljič 6
24 Distance to a primitive vertex Lemma. If n N and ν [n] 0, then for any s, t V (ST ν 3 ) d n (s, t) = 2 n ν d ν (s, t). S. S. Zemljič 7
25 Distance to a primitive vertex ˆ ˆ ˆ2 S. S. Zemljič 7
26 Distance to a primitive vertex Lemma. If n N and ν [n] 0, then for any s, t V (ST3 ν) d n (s, t) = 2 n ν d ν (s, t). Proposition. If ν N and s T ν, then d 0 ( ˆk, ˆl) = (k = l), and d ν (s, ˆl) = 1 + (s 1 = l) + ν d=2 (s d = l) 2 d 1. a There are 1 + (s 1 = l) shortest paths between s and ˆl. a Here (X) is Iverson convention, which is 1 if X is true and 0 if X is false. S. S. Zemljič 7
27 Distances special case Let {i, j, k} = T, n N and s T n. d n+1 (is, j) = d n (s, ˆk) d n+1 (is, i) = min{d n (s, ˆk) k T \ {i}} + 2 n If s = i κ s n κ s, κ [n 1] 0, then d n+1 (is, i) = d n (s, s n κ ) + 2 n and the shortest path goes through vertex 3 i s n κ. two shortest paths between is and i iff is = i ν+1, ν [n] two shortest paths between is and j iff is = ik ν, ν [n] S. S. Zemljič 8
28 Distances general formula Theorem. If n N and ν [n] 0, then for any s V (ST3 n), t V (ST 3 ν ), and {i, j, k} = T, d n+1 (is, jt) = min{d n (s, ĵ) + 2 n ν d ν (t, î) ; d n (s, ˆk) + 2 n + 2 n ν d ν (t, ˆk)}. Problem of two shortest paths: shortest path either goes directly from i-subgraph to j-subgraph, or it goes through k-subgraph. It can also happen that there are two shortest paths. S. S. Zemljič 9
29 Comparison with metric properties of Sierpiński graphs S n 3 ST n 3 d(ss, st) = d(s, t) d n (s, t) = 2 n ν d ν (s, t) d(s, j n ) = n d=1 diam(s n 3 ) = 2n 1 d(s, i n ) = 2 n+1 2 i T (s d = j)2 d 1 d ν (s, ˆl) = 1 + (s 1 = l) + d(is, jt) = min{d dir (is, jt), d indir (is, jt)} ν d=2 diam(st n 3 ) = 2n d(s, i n ) = 2 n+1 i T (s d = l)2 d 1 S. S. Zemljič 10
30 Automaton (0, 2) (2, 1) (0, 1), (0, {0, 2}) ({1, 2}, {0, 2}) (2, 0), (2, {0, 1}) ({0, 2}, {0, 1}) (1, 2), (1, {1, 2}) ({0, 1}, {1, 2}) (0, ), ({1, 2}, ) (0, 0) (1, 1) (1, 0) (1, {0, 1}) ({0, 1}, {0, 1}) (1, 1) (0, 0) A B C (1, ), (, 0), (0, 1) ({0, 1}, ), (, {0, 1}), (0, {1, 2}) (, {0, 2}), ({1, 2}, ) (2, 2) (2, {1, 2}) ({0, 2}, {1, 2}) (2, 1) (0, 2) (1, 0), (1, {0, 1}), ({0, 1}, {0, 1}) (1, {0, 2}), ({0, 1}, {0, 2}) (0, {0, 1}), ({1, 2}, {0, 1}) (2, ), ({0, 2}, ) (2, 2), (2, {1, 2}), ({0, 2}, {1, 2}) (2, {0, 2}), ({0, 2}, {0, 2}) (0, {1, 2}), ({1, 2}, {1, 2}) (1, ), ({0, 1}, ) (2, ), (, 2), (0, 1) ({0, 2}, ), (, {1, 2}), (0, {0, 1}) (, {0, 2}), ({1, 2}, ) D E Example d 4 (002{0, 2}, 112{1, 2}) = 16 (direct) d 4 (020{1, 2}, 12{0, 2}) = 13 (two shortest paths) d 4 (022{0, 1}, 12{0, 2}) = 12 (indirect) S. S. Zemljič 11
31 Sierpiński triangle graphs ST n p Jakovac, A 2-parametric generalization of Sierpiński gasket graphs, Ars. Combin. 116 (2014) Sierpiński triangle graphs ST n p (n N) are the graphs defined by: } V (STp n ) = P {s{i, j} s P ν 1, ν [n], {i, j} ( P 2 ), { } E (STp n ) = { ˆk, k n 1 {j, k}} k P, j P \ {k} { } {s{i, j}, s{i, k}} s P n 1, i P, {j, k} ( P\{i} 2 ) { } {ski n 1 ν {i, j}, s{i, k}} s P ν 1, ν [n 1], i P, {j, k} P \ {i}. As before, ST 0 p = K p and V (ST 0 p ) = P. S. S. Zemljič 12
32 Example ST 1 4 {0, 1} {0, 2} ˆ0 {0, 3} {1, 3} ˆ1 ˆ3 {2, 3} ˆ2 {1, 2} S. S. Zemljič 13
33 Distances in ST n p d ν (s{i, j}, ˆl) = 1 + (i = l)(j = l) + ν 1 d=1 (s d = l) 2 d [2 ν ] there are 1 + (p 2)(i = l)(j = l) s{i, j}, ˆl-shortest paths diam(st n p ) = 2 n s V (ST n p ) : p 1 d n (s, ˆl) = (p 1) 2 n l=0 d n+1 (is, jt) = min{d n (s, ĵ) + 2 n ν d ν (t, î) ; d n (s, ˆk) + 2 n ν d ν (t, ˆk) + 2 n k P \ {i, j}}. S. S. Zemljič 14
34 Open Problems explicit formula for average distance other metric properties which are known for Sierpiński graphs S n p we are currently working on the decision automaton for p > 3 S. S. Zemljič 15
35 THANK YOU!
Fractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Other Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Homomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
DiracDelta. Notations. Primary definition. Specific values. General characteristics. Traditional name. Traditional notation
DiracDelta Notations Traditional name Dirac delta function Traditional notation x Mathematica StandardForm notation DiracDeltax Primary definition 4.03.02.000.0 x Π lim ε ; x ε0 x 2 2 ε Specific values
The Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Trigonometric Formula Sheet
Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ
CRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Finite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Reminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
ST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Every set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Approximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Heisenberg Uniqueness pairs
Heisenberg Uniqueness pairs Philippe Jaming Bordeaux Fourier Workshop 2013, Renyi Institute Joint work with K. Kellay Heisenberg Uniqueness Pairs µ : finite measure on R 2 µ(x, y) = R 2 e i(sx+ty) dµ(s,
The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality
The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,
4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Uniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
C.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Matrices and vectors. Matrix and vector. a 11 a 12 a 1n a 21 a 22 a 2n A = b 1 b 2. b m. R m n, b = = ( a ij. a m1 a m2 a mn. def
Matrices and vectors Matrix and vector a 11 a 12 a 1n a 21 a 22 a 2n A = a m1 a m2 a mn def = ( a ij ) R m n, b = b 1 b 2 b m Rm Matrix and vectors in linear equations: example E 1 : x 1 + x 2 + 3x 4 =
Cyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Homework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Commutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Statistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Overview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
New bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Lecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Αλγόριθμοι και πολυπλοκότητα Depth-First Search
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα Depth-First Search Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών Depth-First Search A B D E C Depth-First Search 1 Outline and Reading
Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
w o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Bounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Areas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Solutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
LTL to Buchi. Overview. Buchi Model Checking LTL Translating LTL into Buchi. Ralf Huuck. Buchi Automata. Example
Overview LTL to Buchi Buchi Model Checking LTL Translating LTL into Buchi Ralf Huuck Buchi Automata Example Automaton which accepts infinite traces δ A Buchi automaton is 5-tuple Σ, Q, Q 0,δ, F Σ is a
Example Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Models for Probabilistic Programs with an Adversary
Models for Probabilistic Programs with an Adversary Robert Rand, Steve Zdancewic University of Pennsylvania Probabilistic Programming Semantics 2016 Interactive Proofs 2/47 Interactive Proofs 2/47 Interactive
Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2)
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21
A Hierarchy of Theta Bodies for Polynomial Systems
A Hierarchy of Theta Bodies for Polynomial Systems Rekha Thomas, U Washington, Seattle Joint work with João Gouveia (U Washington) Monique Laurent (CWI) Pablo Parrilo (MIT) The Theta Body of a Graph G
SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
MATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Partial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Abstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
A Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
TMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Partial Trace and Partial Transpose
Partial Trace and Partial Transpose by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx This document is based on suggestions by Anirban Das Introduction This
Divergence for log concave functions
Divergence or log concave unctions Umut Caglar The Euler International Mathematical Institute June 22nd, 2013 Joint work with C. Schütt and E. Werner Outline 1 Introduction 2 Main Theorem 3 -divergence
Solution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
On the Galois Group of Linear Difference-Differential Equations
On the Galois Group of Linear Difference-Differential Equations Ruyong Feng KLMM, Chinese Academy of Sciences, China Ruyong Feng (KLMM, CAS) Galois Group 1 / 19 Contents 1 Basic Notations and Concepts
Chapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Chapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
SOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Dynamic types, Lambda calculus machines Section and Practice Problems Apr 21 22, 2016
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Dynamic types, Lambda calculus machines Apr 21 22, 2016 1 Dynamic types and contracts (a) To make sure you understand the
9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Homework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Iterated trilinear fourier integrals with arbitrary symbols
Cornell University ICM 04, Satellite Conference in Harmonic Analysis, Chosun University, Gwangju, Korea August 6, 04 Motivation the Coifman-Meyer theorem with classical paraproduct(979) B(f, f )(x) :=
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Affine Weyl Groups. Gabriele Nebe. Summerschool GRK 1632, September Lehrstuhl D für Mathematik
Affine Weyl Groups Gabriele Nebe Lehrstuhl D für Mathematik Summerschool GRK 1632, September 2015 Crystallographic root systems. Definition A crystallographic root system Φ is a finite set of non zero
Μηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
ˆ ˆŠ Œ ˆ ˆ Œ ƒ Ÿ Ä Œμ Ìμ. ±É- É Ê ± μ Ê É Ò Ê É É, ±É- É Ê, μ Ö
ˆ ˆŠ Œ ˆ ˆ Œ ƒ Ÿ 2017.. 48.. 5.. 740Ä744 ˆ Œˆ ƒ Š Œ ˆ Œˆ ˆŸ ˆ ˆ ˆŸ ˆˆ ƒ ˆ Šˆ ˆ.. Œμ Ìμ ±É- É Ê ± μ Ê É Ò Ê É É, ±É- É Ê, μ Ö ±μ³ ² ± ÒÌ ³μ ʲÖÌ Ð É Ò³ ² ³ Š² ËËμ Î É μ - ³ μ É Ò Ë ³ μ Ò ³ Ò Å ²μ ÉÉ. Ì
Generating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Εγχειρίδια Μαθηµατικών και Χταποδάκι στα Κάρβουνα
[ 1 ] Πανεπιστήµιο Κύπρου Εγχειρίδια Μαθηµατικών και Χταποδάκι στα Κάρβουνα Νίκος Στυλιανόπουλος, Πανεπιστήµιο Κύπρου Λευκωσία, εκέµβριος 2009 [ 2 ] Πανεπιστήµιο Κύπρου Πόσο σηµαντική είναι η απόδειξη
F A S C I C U L I M A T H E M A T I C I
F A S C I C U L I M A T H E M A T I C I Nr 46 2011 C. Carpintero, N. Rajesh and E. Rosas ON A CLASS OF (γ, γ )-PREOPEN SETS IN A TOPOLOGICAL SPACE Abstract. In this paper we have introduced the concept
ΑΛΓΟΡΙΘΜΟΙ Άνοιξη I. ΜΗΛΗΣ
ΑΛΓΟΡΙΘΜΟΙ http://eclass.aueb.gr/courses/inf6/ Άνοιξη 26 - I. ΜΗΛΗΣ NP-complete προβλήματα ΑΛΓΟΡΙΘΜΟΙ - ΑΝΟΙΞΗ 26 - Ι. ΜΗΛΗΣ 6 NP-COMPLETENESS II Tree of reductions (partial) Cook s Th. Π NP SAT 3-SAT
Second Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Solutions to the Schrodinger equation atomic orbitals. Ψ 1 s Ψ 2 s Ψ 2 px Ψ 2 py Ψ 2 pz
Solutions to the Schrodinger equation atomic orbitals Ψ 1 s Ψ 2 s Ψ 2 px Ψ 2 py Ψ 2 pz ybridization Valence Bond Approach to bonding sp 3 (Ψ 2 s + Ψ 2 px + Ψ 2 py + Ψ 2 pz) sp 2 (Ψ 2 s + Ψ 2 px + Ψ 2 py)
Section 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
de Rham Theorem May 10, 2016
de Rham Theorem May 10, 2016 Stokes formula and the integration morphism: Let M = σ Σ σ be a smooth triangulated manifold. Fact: Stokes formula σ ω = σ dω holds, e.g. for simplices. It can be used to define
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Pg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is
Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =
Jordan Journal of Mathematics and Statistics (JJMS) 4(2), 2011, pp
Jordan Journal of Mathematics and Statistics (JJMS) 4(2), 2011, pp.115-126. α, β, γ ORTHOGONALITY ABDALLA TALLAFHA Abstract. Orthogonality in inner product spaces can be expresed using the notion of norms.
Section 8.2 Graphs of Polar Equations
Section 8. Graphs of Polar Equations Graphing Polar Equations The graph of a polar equation r = f(θ), or more generally F(r,θ) = 0, consists of all points P that have at least one polar representation
Strain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
b. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Στα επόμενα θεωρούμε ότι όλα συμβαίνουν σε ένα χώρο πιθανότητας ( Ω,,P) Modes of convergence: Οι τρόποι σύγκλισης μιας ακολουθίας τ.μ.
Στα πόμνα θωρούμ ότι όλα συμβαίνουν σ ένα χώρο πιθανότητας ( Ω,,). Modes of covergece: Οι τρόποι σύγκλισης μιας ακολουθίας τ.μ. { } ίναι οι ξής: σ μια τ.μ.. Ισχυρή σύγκλιση strog covergece { } lim = =.
ΤΜΗΜΑ ΗΛΕΚΤΡΟΛΟΓΩΝ ΜΗΧΑΝΙΚΩΝ ΚΑΙ ΜΗΧΑΝΙΚΩΝ ΥΠΟΛΟΓΙΣΤΩΝ
ΤΜΗΜΑ ΗΛΕΚΤΡΟΛΟΓΩΝ ΜΗΧΑΝΙΚΩΝ ΚΑΙ ΜΗΧΑΝΙΚΩΝ ΥΠΟΛΟΓΙΣΤΩΝ ΗΜΥ 311: Διακριτή Ανάλυση και Δομές Χειμερινό Εξάμηνο 016 Σειρά Ασκήσεων 5: Απαρίθμηση, Αρχή της Θυρίδας, Συνδυασμοί και Μεταθέσεις, Γραφήματα και
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3
Capacitors - Capacitance, Charge and Potential Difference
Capacitors - Capacitance, Charge and Potential Difference Capacitors store electric charge. This ability to store electric charge is known as capacitance. A simple capacitor consists of 2 parallel metal
Galatia SIL Keyboard Information
Galatia SIL Keyboard Information Keyboard ssignments The main purpose of the keyboards is to provide a wide range of keying options, so many characters can be entered in multiple ways. If you are typing
Modbus basic setup notes for IO-Link AL1xxx Master Block
n Modbus has four tables/registers where data is stored along with their associated addresses. We will be using the holding registers from address 40001 to 49999 that are R/W 16 bit/word. Two tables that
ECE 308 SIGNALS AND SYSTEMS FALL 2017 Answers to selected problems on prior years examinations
ECE 308 SIGNALS AND SYSTEMS FALL 07 Answers to selected problems on prior years examinations Answers to problems on Midterm Examination #, Spring 009. x(t) = r(t + ) r(t ) u(t ) r(t ) + r(t 3) + u(t +