International Journal of Pure and Applied Sciences and Technology
|
|
- Dortha Carpenter
- 5 years ago
- Views:
Transcription
1 It J Pure App Sci Techo 6( (0 pp7-79 Iteratioa Joura of Pure ad Appied Scieces ad Techoogy ISS Avaiabe oie at wwwijopaasati Research Paper Reatioship Amog the Compact Subspaces of Rea Lie ad their Chaotic Properties Payer Ahmed * M Rahma ad S Kawamura Departmet of Mathematics Jagaath Uiversity Dhaa Bagadesh Departmet of Mathematics Facuty of Scieces Yamagata Uiversity Yamagata 990 Japa * Correspodig author e-mai: (drpayerahmed@yahoocom (Received: 4-8-; Accepted: -8- Abstract: We show a homeomorphic equivaet reatio amog the compact subspaces (Cator midde-third sets two-sided shift map of Cator sets ad terary sets etc of the rea ie Usig such resut we show that there eists a chaotic homeomorphism of a compact subspace of the rea ie oto itsef if ad oy if it is homeomorphic to the Cator set Keywords: Cator sets Shift map Terary sets HomeomorphismChaotic maps Itroductio: Though the cocept of Cator sets is a property of geera spaces we have discussed here oy i R the sets rea ie A subset X of R that cotais o iterva is said to be totay discoected This defiitio is equivaet to that for a i X the coected compoet of deoted by C( is equa to {} Here we ote that coected compoet is the argest coected set cotaiig itsef A poit is a isoated poit of a subset X of R if there eistsε > 0 such that U ( ε X cosists sige poit Cator Sets ad Terary Sets with their Reatios Defiitios: A compact subspace of X of R is said to be a Cator set if X id totay discoected ad have o isoated poits Let I [0] I [0/ ] I [/ ] I [0/ 9] I [/9/9] I [6/97/9] 0 0 I 4 [8/9] ad so o The sequece { I : 0 ad } is epressed as foows by the mathematica iductio:
2 It J Pure App Sci Techo 6( ( (i I 0 [0] (ii Suppose I is epressed as I [ ] The I ad I are epressed as I [ ] respectivey We put C ( R ( I The set C is I U 0 caed the Cator midde-third set For [0] the epressio where is i either 0 or is the terary epasio of rea umber of For eampe the sequece 000 is the terary epasio of ¼ sice L ( ( / ad 9 the sequece 0000 ad 00 are the terary epasios of / sice 0 0 L / ad 0 L / Aso the sequece 0000 is the terary epasio of / sice 0 0 L / We put { D R : {0}} The set D is caed the terary set Lemma The Cator midde third set C ad the terary set D are equa Proof: Let D We show that U I for a 0 We show it by the theory of mathematica iductio: assume that foows: U I (i For 0 Triviay we have I 0 [0] (ii We ie I for some the the umber is epressed as m m m m m m m m m We put m m m m I [ m The we have amey ] ow i the case we have m m m m m That is O the other had i the case we have m m m That is Thus m m [ ] [ ] I I That is U I Hece we have I ( I C U Therefore we have D C Coversey we suppose that I ( I C amey I for a ad a uique Let { y } be the U sequece of {0 } defied by { 0 if is a odd umber y if is a odd umber We put y y m The it foows that y I for a amey we have ad y beog to the same I Thus
3 It J Pure App Sci Techo 6( ( y for a Here y y D Thus we have C D Cosequety we have C D m Lemma The Cator set C is totay discoected Proof: Suppose C cotais a iterva (a b The 0 b a Sice im 0 iterva Therefore C is totay discoected Lemma The set D has the properties: (i The epressio uique (ii D has o isoated poit ( for a ad ad a b I we have a b This is a cotradictio Thus C has o f ([ c d] [ c d] φ i D is Proof: (i Suppose that y where m y y m ad y for - ad y We ca assume that ad y 0 The y y m m m m m m y m y 0 is a cotradictio Therefore the epressio y m m m y y y m y m m > 0 m i D is uique This (ii Let D where m {0} ad ε > 0 We show that there eists y( D such that y < ε There eists atura umber such that < ε We put y y m D such that y for ad y The y y Thus y < ε 0 if if 0 By the property (i We have y Thus U ( ε D { } Hece we have that is ot a isoated poit of D Propositio 4 The set C D is a Cator set Proof: By Lemma C D by Lemma C is totay discoected ad by Lemma (ii D has o isoated poit Hece the set C D is a Cator set Lemma 5 Let ( X d ad ( X d be two compact metric spaces ad f : ( X d ( X d be a map If there eists M > 0 such that d f ( f ( y Md ( the f is cotiuous ( y Proof: LetU be a ope set i X We show that f ( U is ope i X Let f ( U that is f ( U SiceU is ope there eists ε > 0 such that f ( U ( f ( ε U ε Let V { y X : d( y < } The V ad V f ( U Thus f ( U is ope i X M
4 It J Pure App Sci Techo 6( ( Lemma 6 Let X ad Y be compact Hausdorff spaces respectivey If f : X Y is a bijective ad cotiuous map the (i f is a homeomorphism ad (ii Y is compact space Proof: (i We show that f is cotiuous LetU be a ope set i X We put B X U The B is cosed set Hece B is compact i X Thus f (B is compact i Y amey f ( B f ( X U f ( X f ( U is cosed i Y Thus ( f ( U f ( U is ope i Y Cosequety f is a homeomorphism (ii By assumptio X is compact Sice X ady are homeomorphisms thus we havey is compact Propositio 7 Σ ad D are homeomorphic Proof: Let f : D be the map defied by y f ( where Σ ( y y D ad y We show that f is a homeomorphism of Σ oto D Oe-to-oe: Suppose f ( f ( where ( the y y Thus y y impies for a i The ( Sice the epressio of a eemet i D is uique we Therefore f is oto Cotiuity: We have f ( f ( y y 4 y y By Lemma 5 f is cotiuous Therefore by Lemma 6(i f : Σ D is a homeomorphism amey Σ ad D are homeomorphic Propositio 8 ad are homeomorphic for 46 Proof: We first ote that the map ϕ : Z defied by ϕ ( 5 for f : be the map defied by y f ( is both oe-to-oe ad oto Let where ( Z y y Z y f : is a homomorphism ( ad ϕ ( for a We show that have ( Thus Therefore f is oe-tooe y Oto: Let y y D For this we put ( where The f ( y Oe-tooe:Suppose f ( f ( y Let z f ( f ( y where ( Z y ( y Z z ( z ad z ϕ ( yϕ ( for a Thus ϕ ( yϕ ( for a
5 It J Pure App Sci Techo 6( ( Sice ϕ is oto (ie ϕ ( Z we have y for a Z Hece y Therefore f is oe-to-oe Oto: Sice ϕ oe-to-oe there eists the iverse ϕ : Z Let y ( y Z be give For this y we put ( Z where y ϕ ( The f ( y Therefore f is oto Cotiuity: et ( Z The by the defiitio of f we have f ( y ( y Z ad y ϕ ( ϕ ( for a ow d ( f ( f ( d ( y y y y ϕ ( ϕ ( ( ( ( ϕ ϕ ϕ ϕ ( d ( 0 0 f : is a By Lemma 5 f is cotiuous Therefore by Lemma 6(i homomorphism amey ad are homomorphic Theorem 9 Let X be a compact subspace of R The the foowig are equivaet: ( X is a Cator set C ( X is homeomorphic to C ( X is homeomorphic to D (4 X is homeomorphic to (5 X is homeomorphic to Proof: [( (4] Sice X is cosed R-X is ope Put a mi X b ma X The ( R X ( a b is ope set ad we have: ( R X ( a b J J ( a b The sequece { J } ca be arraged as { } ( { K w w w : wi {0 } for i }( K J whose positio is as foows: (a K : w {0 } for i } are arraged i order of the umbers { w w w i { w w w w : {0} w i for i } (b K w 0( w w resp K ww w eist at the eft (resp right side of K w w w For X we defied a sequece f ( i as foows:
6 It J Pure App Sci Techo 6( ( if eists at the eft (resp right side of After we defie et 0 (resp if eists at the eft (resp right side of K The f : is a homeomorphism which we show i the foowig Oe-to-oe: We suppose that < y Sice is totay discoected the cosed iterva [ y] cotaied i X Thus there eist ( a b K such that < a < b y J w w w < Hece 0 ad y Thus we have f ( ( ( y f ( y Therefore f is oe to oe Oto: Let w ( w w w For ( w w w et { L } be the sequece of cosed iterva such that L is the argest cosed iterva i X K at the w -had of K ( w is at eft if w 0 ad w is at right if w Suppose that L L are determied The L is the argest cosed iterva i the cosed set ( X K w w w L at the w - had side of K w w w Thus we have L is a o-empty set by the compactess of X Moreover L cosist of sige poit which we show ow Let be a eemet of L The f ( w By (a is a uique eemet of I L Thus f is oto Cotiuity: We show that for ay i X ad for ayε > 0 There eists δ > 0such that if y < δ the f ( f ( y < ε Let X ad ε > 0 are give The there eists > 0 such that < ε Let f ( ad { L} be the sequece defied above The ( L for a We put δ mi{ d( L : } If y < δ the y L for The d ( y y < ε Therefore f is cotiuous By Lemma 6(i f is a homeomorphism Therefore X is homeomorphic to Σ ow usig Propositios 4 8 ad 7 we get ( ( (4 (5 ad (4 ( respectivey Chaotic properties of compact subspaces of the rea ie As we ow chaotic maps are cosidered as those f 's which have the foowig property (cf [4] (C-The set of a periodic poits for f are dese (C- f is trasitive (C- f has sesitive depedece o iitia coditios Those properties are cocered with the orbit of give iitia poit (cf [5] We restrict our attetio to cotiuous maps o compact subspaces of the rea ie ad there eist a ot of chaotic maps such as tet map of the uit iterva ad the two-sided shift map of the Cator sets It is easy to show that tet map is ot a homeomorphism of the uit iterva oto itsef but the two-sided shift map is a homeomorphism of the Cator set oto itsef I [] it was show that o homeomorphisms of the uit iterva are chaotic Usig these
7 It J Pure App Sci Techo 6( ( resuts we show that there eists a chaotic homeomorphism of X oto itsef if ad oy if X is homeomorphic to the Cator set Lemma Let f :[0] [0] be a cotiuous map If f is a homeomorphism the f is ot oe-sided topoogicay trasitive Proof: Suppose that f is a homeomorphism The f is mootoicay icreasig or mootoicay decreasig For each case we show that f is ot oe sided topoogicay trasitive First we cosider the case of mootoicay icreasig i which f ( 0 0 ad f ( Let 0be a poit i the ope iterva ( 0 The we have the foowig two cases Case (- [ f ( ] Let ( U 0 ad V ( 0 The we have f ( U V U V φ ( Case (- [ f ( 0 0 ] Let a mi{ ( 0 f 0} b ma{ 0 f ( 0} U ( a b ad V f (U The we have f ( U V U V φ ( et we cosider the case of mootoicay decreasig i which f ( 0 ad f ( 0 Let y 0 be a poit o the ope iterva ( 0 such that f ( 0 0 The we have the foowig two cases too Case (- [ f ( y0 y0 ] Let U ( 0 y0 ( f ( y0 ad V ( y0 f ( y0 The we have f ( U V U V φ ( Case (-[ f ( y0 y0 ] Let a mi{ y0 f ( y0 } b ma{ y0 f ( y0} U ( a b ad V f (U The we have f ( U V φ ( Lemma Let X be compact subspace of R which has a o-empty ope iterva ( a b ad f : X X a cotiuous map If f is a homeomorphism the f is ot oe sided topoogicay trasitive Proof: Suppose that f is a homeomorphism ad et ( c d be the argest ope iterva i X such that ( c d cotais ( a b Sice X is cosed i R the cosed iterva [ c d ] is cotaied i X I the case where f ([ c d] [ c d] φ ( triviay f is ot oe sided topoogicay trasitive ow we cosider the case where f ([ c d] [ c d] φ for some Let be the smaest positive iteger such that f ([ c d] [ c d] φ Sice [ c d ] is a coected compoet i X ad f is a homeomorphism of X oto itsef the set f ([ c d] is aso a coected compoet i X Thus we have f ([ c d] [ c d] ad the restrictio of f to [ d ] c becomes a homeomorphism of [ c d ] Hece by Lemma f is ot oe sided topoogicay trasitive o [c d] that is there eist two o-empty ope itervas U ad V i [ c d ] such that f ( U V φ for a By cosiderig ope itervas i U adv we ca taeu adv as o-empty ope sets i X ad we have
8 It J Pure App Sci Techo 6( ( i f ( U V f i ([ c d] [ c d] φ for i Therefore f is ot a oe sided topoogicay trasitive Lemma Let X be a compact subspace of R which has a isoated poit ad f : X X be a cotiuous map The f does ot have sesitive depedece o iitia coditios Proof: Let a isoated poit The there eistε > 0 such that { y X : d( y < ε } X { } Hece for thisε the coditio d ( y < ε impies y Thus we have d( f ( f ( y 0 for a Lemma 4 The two sided shift map S is chaotic homeomorphism Proof: It is easy to show that S is a homeomorphism ad satisfies three coditios by R L Devaey Cosequety S is chaotic homeomorphism Combiig Lemmas ad 4 we get the foowig propositio Propositio 5 For a compact subspace X of R there eists a homeomorphism of X which satisfies the first two coditios of Devaey if ad oy if X is homemorphic to the Cator set C Moreover Lemma 4 meas that this is equivaet to that there eists a chaotic homeomorphism of X amey we have the foowig theorem Theorem 6 Let X be a compact subspace of R The there eists a chaotic homeomorphism f : X X if ad oy if X is homeomorphic to a Cator set Proof: We show the foowig two facts: (i If X is homeomorphic to the there eists chaotic homeomorphism f : X X (ii If there eist s f : X X is a chaotic homeomorphism the X is homeomorphic to To prove (i suppose h : X is a homeomorphism By Lemma 4 S : is a chaotic homeomorphism The we have the foowig commutative diagram f X X h The f h o So h Hece f is a chaotic homeomorphism (iiwe show it by cotrapositio Suppose X is ot homeomorphic to the by Lemmas ad 4(ii we have (a X is ot totay discoected or (b X has a isoated poit I that case (a if X is ot totay discoected the there eist X such that C ( { } The there eists y such that f C( If < y the [ y] C( ad if > y the [ y] C( ie there eists ( a( [ a b] C( X S h
9 It J Pure App Sci Techo 6( ( The by Lemma there is o homeomorphism which is chaotic I the case (b if X has a isoated poit the by Lemma there is o homeomorphism which is chaotic Remar 7 We ote that i the case where X is a fiite subset of R there eists a homeomorphism of X which satisfies the first two chaotic coditios but does ot satisfy the third coditios by Devaey I Lemma 4 we have show that there eists at east oe chaotic homeomorphism of the Cator set oto itsef that is the two sided shift map I [] it was show that this chaotic map is a map i a famiy of chaotic homeomorphism Refereces [] J Bas J Broos G Cairs G Davis ad P Stacey O devaey's defiitio of chaos Amer Math Mothy 99 (99 4 [] P Ahmed ad S Kawamura Chaotic homeomorphisms of the compact subspace of rea ie Bu of Yamagata Uiversity Japa at Sci6 (4 008 [] P Ahmed ad S Isam Chaotic behavior i dyamica systems of homeomorphism o uit iterva Joura of Bagadesh Academy of Scieces ( (008-9 [4] R L Devaey A Itroductio to Chaotic Dyamica Systems d Editio Addiso- Wesey: Redwood City 989 [5] S M Uam ad J Vo euma O combiatio of stochastic ad determiistic processes Preimiary report Bu Amer Math Soc 5(947 0
On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationTakashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
TOPOLOGY Takashi Tsuboi Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa Keywords: eighborhood, ope sets, metric space, covergece, cotiuity, homeomorphism, homotopy type, compactess,
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationOptimizing Triangular Parabolic Fuzzy EOQ Model with Shortage Using Nearest Interval Approximation
Iteratioa Joura o Future Revoutio i Computer Sciece & Commuicatio Egieerig ISSN: 454-448 Voume: 3 Issue: 9 96 Optimizig Triaguar Paraboic Fuzzy EO Mode with Shortage Usig Nearest Iterva Approximatio Faritha
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationMINKOWSKI SET OPERATORS. Daniela VELICHOVÁ
Te Joura of Pois Society for Geometry ad Egieerig Grapics Voume 4 (013), 45-49 45 MINKOWSKI SET OPERATORS Daiea VELICHOVÁ Sova Uiversity of Tecoogy, Istitute of Matematics ad Pysics, Nám. Sobody 17, 81
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY
ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY m. rosefeld1 1. Itroductio. We cosider i this paper oly fiite odirected graphs without multiple edges ad we assume that o each vertex of the graph there is
More informationON MATHIEU-BERG S INEQUALITY
ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationJournal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones
Joural of Mathematical Naoscieese 7 2) 2017) 85 95 Joural of Mathematical Naosciece Available Olie at: http://jmathaosrttuedu Saskruti Idex of Bridge Graph ad Some Naocoes K Pattabirama * Departmet of
More information3. b. Present a combinatorial argument that for all positive integers n : : 2 n
. b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationCIS 121. Introduction to Trees
CIS 121 Itroductio to Trees 1 Tree ADT Tree defiitio q A tree is a set of odes which may be empty q If ot empty, the there is a distiguished ode r, called root ad zero or more o-empty subtrees T 1, T 2,
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationOn Characteristic Polynomial of Directed Divisor Graphs
Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationHyperbolic Coxeter groups of rank 4
Hyerboic Coxeter grous of rak Youghwa Ki Srig 2016 1. Itroductio The stadard cassificatio of fiite refectio grous ad affie Coxeter systes ca be foud i [1]. Huhrey reseted a characterizatio to cassify hyerboic
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationAN EFFECTIVE EXACT ALGORITHM FOR ONE PARTICULAR CASE OF THE TRAVELING-SALESMAN PROBLEM Panishev A.V., Plechystyy D.D.
Iteratioa Joura "Iforatio Theories & Aicatios" Vo 55 AN EFFECTIVE EXACT ALGOITHM FO ONE PATICULA CASE OF THE TAVELING-SALESMAN POBLEM Paishev AV Pechystyy DD Abstract: The artice resets the exact agorith
More information2 X = 2 X. The number of all permutations of a set X with n elements is. n! = n (n 1) (n 2) nn e n
1 Discrete Mathematics revisited. Facts to remember Give set X, the umber of subsets of X is give by X = X. The umber of all permutatios of a set X with elemets is! = ( 1) ( )... 1 e π. The umber ( ) k
More informationSOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION
Palestie Joural of Mathematics Vol. 607, 38 46 Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC
More informationCharacterizing graphs of maximum principal ratio
Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationPrime Cordial Labeling on Graphs
World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationState-space feedback 6 challenges of pole placement
State-space feedbac 6 challeges of pole placemet J Rossiter Itroductio The earlier videos itroduced the cocept of state feedbac ad demostrated that it moves the poles. x u x Kx Bu It was show that whe
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More informationABOUT A CONSTRUCTION PROBLEM
INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationA Selected Primer on Computer Vision: Geometric and Photometric Stereo & Structured Light
A Seected Primer o Computer Visio: Geometric ad Photometric Stereo & Structured Light CS334 Sprig 2012 Daie G. Aiaga Departmet of Computer Sciece Purdue Uiversit Defiitios Camera geometr (=motio) Give
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationPRIMITIVE σ-spaces. by Rick E. Ruth
Volume 8, 1983 Pages 315 328 http://topology.aubur.edu/tp/ PRIMITIVE σ-spaces by Rick E. Ruth Topology Proceedigs Web: http://topology.aubur.edu/tp/ Mail: Topology Proceedigs Departmet of Mathematics &
More information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationHamiltonian-T*- Laceability in Jump Graphs Of Diameter Two
IOSR Jourl of Mthemtics IOSR-JM e-issn 78-78 p-issn9-76x. Volume Issue Ver. III My-Ju. PP -6 www.iosrjourls.org Hmiltoi-T*- Lcebility i Jump Grphs Of Dimeter Two Mjuth.G Murli.R Deprtmet of MthemticsGopl
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationSymmetric Class 0 subgraphs of complete graphs
DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationEVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS
Kragujevac Joural of Matheatics Volue 43(3) (019), Pages 47 441. EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS A. LOURDUSAMY 1 AND F. PATRICK 1 Abstract. Let G be a graph with p vertices
More informationMINIMUM CROSSINGS IN JOIN OF GRAPHS WITH PATHS AND CYCLES
3 Acta Electrotechica et Iformatica, Vol. 1, No. 3, 01, 3 37, DOI: 10.478/v10198-01-008-0 MINIMUM CROSSINGS IN JOIN OF GRAPHS WITH PATHS AND CYCLES Mariá KLEŠČ, Matúš VALO Departmet of Mathematics ad Theoretical
More informationTHE COMPETITION NUMBERS OF JOHNSON GRAPHS
Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea
More informationThompson s Group F (p + 1) is not Minimally Almost Convex
Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig
More informationLinear Time-Invariant Systems
9/9/00 LIEAR TIE-IVARIAT SYSTES Uit, d Part Liear Time-Ivariat Sstems A importat class of discrete-time sstem cosists of those that are Liear Priciple of superpositio Time-ivariat dela of the iput sequece
More informationThe Adjacency Matrix and The nth Eigenvalue
Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationEvaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps
Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,
More informationIntroduction to FFT Processors
Itroductio to FFT Processors Chih-ei Liu VLSI Siga Processig Lab Departmet of Eectroics Egieerig atioa Chiao-Tug Uiversity FFT Desig FFT Cosists of a series of compe additios ad compe mutipicatios Agorithm
More informationSyddansk Universitet. The total irregularity of a graph. Abdo, H.; Brandt, S.; Dimitrov, D.
Syddask Uiversitet The total irregularity of a graph Abdo, H.; Bradt, S.; Dimitrov, D. Published i: Discrete Mathematics & Theoretical Computer Sciece Publicatio date: 014 Documet versio Publisher's PDF,
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationMinimum Spanning Trees
Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 0 Miimum Spaig Trees 0 Goodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig a Network Suppose
More informationCS473-Algorithms I. Lecture 2. Asymptotic Notation. CS 473 Lecture 2 1
CS473-Algorithms I Lecture Asymptotic Notatio CS 473 Lecture 1 O-otatio (upper bouds) f() = O(g()) if positive costats c, 0 such that e.g., = O( 3 ) 0 f() cg(), 0 c 3 c c = 1 & 0 = or c = & 0 = 1 Asymptotic
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures
Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)
More informationfound that now considerable work has been done in this started with some example, which motivates the later results.
8 Iteratioal Joural of Comuter Sciece & Emergig Techologies (E-ISSN: 44-64) Volume, Issue 4, December A Study o Adjacecy Matrix for Zero-Divisor Grahs over Fiite Rig of Gaussia Iteger Prajali, Amit Sharma
More informationOn Ryser s conjecture for t-intersecting and degree-bounded hypergraphs arxiv: v2 [math.co] 9 Dec 2017
O Ryser s cojecture for t-itersectig ad degree-bouded hypergraphs arxiv:1705.1004v [math.co] 9 Dec 017 Zoltá Király Departmet of Computer Sciece ad Egerváry Research Group (MTA-ELTE) Eötvös Uiversity Pázmáy
More informationMinimum Spanning Trees. Application: Connecting a Network
Miimum Spaig Tree // : Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. oodrich ad R. Tamassia, Wiley, Miimum Spaig Trees oodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig
More informationTHE STABLE PARAMETRIZED h-cobordism THEOREM. John Rognes. October 18th October 26th 1999
THE STABLE PARAMETRIZED h-cobordism THEOREM Joh Roges October 18th October 26th 1999 These are the author s otes for lectures o the paper: Spaces of PL maifolds ad categories of simple maps (the maifold
More informationILP Problem Formulation
ILP Probem Formuatio Ajay Kr. Dhamija (N-1/MBA PT 2006-09) Abstract Iteger iear programmig is a very importat cass of probems, both agorithmicay ad combiatoriay.foowig are some of the probems i computer
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationΣ P(i) ( depth T (K i ) + 1),
EECS 3101 York Uiversity Istructor: Ady Mirzaia DYNAMIC PROGRAMMING: OPIMAL SAIC BINARY SEARCH REES his lecture ote describes a applicatio of the dyamic programmig paradigm o computig the optimal static
More informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More informationUNIT 1 RECURRENCE RELATIONS
UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the
More information