ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH1006 SAHARON SHELAH
|
|
- Ζένια Σπανού
- 6 χρόνια πριν
- Προβολές:
Transcript
1 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH1006 SAHARON SHELAH Abstract. We deal with incompactness. Assume the existence of non-reflecting stationary subset of the regular cardinal λ of cofinality κ. We prove that one can define a graph G whose chromatic number is > κ, while the chromatic number of every subgraph G G, G < λ is κ. The main case is κ = ℵ 0. Date: January 31, Mathematics Subject Classification. Primary: 03E05; Secondary: 05C15. Key words and phrases. set theory, graphs, chromatic number, compactness, non-reflecting stationary sets. The author thanks Alice Leonhardt for the beautiful typing. First typed: July 3, Pf for J.: Sept
2 2 SAHARON SHELAH Anotated Content 0 Introduction, pg.3 (0A) The questions and results, pg.3 (0AB) Preliminaries, pg.3 1 From a non-reflecting stationary set, pg.5 [We show that S Sκ λ is stationary not reflecting implies imcompactness for length λ for chromatic number = κ.] 2 From almost free, pg.8 [Here we weaken the assumption in 1 to A κ Ord is almost free.]
3 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH Introduction {Introduction} {Thequestions} 0(A). The questions and results. During the Hajnal conference (June 2011) Magidor asked me on incompactness of having chromatic number ℵ 0 ; that is, there is a graph G with λ nodes, chromatic number > ℵ 0 but every subgraph with < λ nodes has chromatic number ℵ 0 when: ( ) 1 λ is regular > ℵ 1 with a non-reflecting stationary S S λ ℵ 0, possibly though better not, assuming some version of GCH. Subsequently also when: ( ) 2 λ = ℵ ω+1. Such problems were first asked by Erdös-Hajnal, see [EH74]; we continue [Sh:347]. First answer was using BB, see [Sh:309, 3.24] so assuming or just (a) λ = µ + (b) µ ℵ0 = µ (c) S {δ < λ : cf(δ) = ℵ 0 } is stationary not reflecting (a) λ = cf(λ) (b) α < λ α ℵ0 < λ (c) as above. However, eventually we get more: if λ = λ ℵ0 = cf(λ) and S S λ ℵ 0 is stationary non-reflective then we have λ-incompactness for ℵ 0 -chromatic. In fact, we replace ℵ 0 by κ = cf(κ) < λ using a suitable hypothesis. Moreover, if λ κ > λ we still get (λ κ,λ)-incompactness for κ-chromatic number. In 2 we use quite free family of countable sequences. In subsequent work we shall solve also the parallel of the second question of Magidor, i.e. ( ) 2 for regular κ ℵ 0 and n < ω there is a graph G of chromatic number > κ but every sub-graph with < ℵ κ n+1 nodes has chromatic number κ. In fact, considerably is proved, see [Sh:F1240]. We thank Menachem Magidor for asking, Peter Komjath for stimulating discussion and Paul Larson, Shimoni Garti and the referee for some comments. 0(B). Preliminaries. Definition 0.1. For a graph G, let ch(g), the chromatic number of G be the minimal cardinal χ such that there is colouring c of G with χ colours, that is c is a function from the set of nodes of G into χ or just a set of of cardinality χ such that c(x) = c(y) {x,y} / edge(g). {Preliminaries} {y3}
4 4 SAHARON SHELAH {y8} {y6} {y11} {y13} {y6} Definition ) We say we have λ-incompactness for the (< χ)-chromatic number or INC chr (λ,< χ) when: there is a graph G with λ nodes, chromatic number χ but every subgraph with < λ nodes has chromatic number < χ. 2) If χ = µ + we may replace < χ by µ; similarly in 0.3. {y8} We also consider Definition ) We say we have (µ, λ)-incompactness for (< χ)-chromatic number or INC chr (µ,λ,< χ) when there is an increasing continuous sequence G i : i λ of graphs each with µ nodes, G i an induced subgraph of G λ with ch(g λ ) χ but i < λ ch(g i ) < χ. 2) Replacing (in part (1)) χ by χ = (< χ 0,χ 1 ) means ch(g λ )) χ 1 and i < λ ch(g i ) < χ 0 ; similarly in 0.2 and parts 3),4) below. 3) We say we have incompactness for length λ for (< χ)-chromatic(or χ-chromatic) number when we fail to have(µ, λ)-compactness for(< χ)-chromatic(or χ-chromatic) number for some µ. 4)Wesaywehave[µ,λ]-incompactnessfor(< χ)-chromaticnumberorinc chr [µ,λ,< χ] when there is a graph G with µ nodes, ch(g) χ but G 1 G G 1 < λ ch(g 1 ) < χ. 5) Let INC + chr (µ,λ,< χ) be as in part (1) but we add that even the cl(g i), the colouring number of G i is < χ for i < λ, see below. 6) Let INC + chr [µ,λ,< χ] be as in part (4) but we add G1 G G 1 < λ cl(g 1 ) < χ. 7) If χ = κ + we may write κ instead of < χ. Definition ) For regular λ > κ let S λ κ = {δ < λ : cf(δ) = κ}. 2) We say C is a ( θ)-closed subset of a set B of ordinals when: if δ = sup(δ B) B,cf(δ) θ and δ = sup(c δ) then δ C. Definition 0.5. For a graph G, the colouring number cl(g) is the minimal κ such that there is a list a α : α < α( ) of the nodes of G such that α < α( ) κ > {β < α : {a β,a α } edge(g)}.
5 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH From non-reflecting stationary in cofinality ℵ 0 {From} {a3} Claim 1.1. There is a graph G with λ nodes and chromatic number > κ but every subgraph with < λ nodes have chromatic number κ when: (a) λ, κ are regular cardinals (b) κ < λ = λ κ (c) S S λ κ is stationary, not reflecting. Proof. Stage A: Let X = Xi : i < λ be a partition of λ to sets such that X i = λ or just X i = i+2 κ and min(x i ) i and let X <i = {X j : j < i} and X i = X <(i+1). For α < λ let i(α) be the unique ordinal i < λ such that α X i. We choose the set of points = nodes of G as Y = {(α,β) : α < β < λ,i(β) S and α < i(β)} and let Y <i = {(α,β) Y : i(β) < i}. Stage B: Note that if λ = κ +, the complete graph with λ nodes is an example (no use of the further information in ). So without loss of generality λ > κ +. Now choose a sequence satisfying the following properties, exists by[sh:g, Ch.III]: (a) C = Cδ : δ S (b) C δ δ = sup(c δ ) (c) otp(c δ ) = κ such that ( β C δ )(β +1,β +2 / C δ ) (d) C guesses 1 clubs. Let α δ,ε : ε < κ list C δ in increasing order. For δ S let Γ δ be the set of sequence β such that: β (a) β has the form βε : ε < κ (b) β is increasing with limit δ (c) α δ,ε < β 2ε+i < α δ,ε+1 for i < 2,ε < κ (d) β 2ε+i X <α δ,ε+1 \X α δ,ε for i < 2,ε < κ (e) (β 2ε,β 2ε+1 ) Y hence Y <α δ,ε+1 Y <δ for each ε < κ (can ask less). So Γ δ δ κ X δ λ hence we can choose a sequence β γ : γ X δ X δ listing Γ δ. Now we define the set of edges of G: edge(g) = {{(α 1,α 2 ),(min(c δ ),γ)} : δ S,γ X δ hence the sequence β γ = β γ,ε : ε < κ is well defined and we demand (α 1,α 2 ) {(β γ,2ε,β γ,2ε+1 ) : ε < κ}}. Stage C: Every subgraph of G of cardinality < λ has chromatic number κ. For this we shall prove that: 1 ch(g Y <i ) κ for every i < λ. This suffice as λ is regular, hence every subgraph with < λ nodes is included in Y <i for some i < λ. For this we shall prove more by induction on j < λ: 1 the guessing clubs are used only in Stage D.
6 6 SAHARON SHELAH 2,j if i < j,i / S,c 1 a colouring of G Y <i,rang(c 1 ) κ and u [κ] κ then thereisacolouringc 2 ofg Y <j extendingc 1 suchthatrang(c 2 (Y <j \Y <i )) u. Case 1: j = 0 Trivial. Case 2: j successor, j 1 / S Let i be such that j = i+1, but then every node from Y j \Y i is an isolated node in G Y <j, because if {(α,β),(α,β )} is an edge of G Y j then i(β),i(β ) S hence necessarily i(β) j 1 = i,i(β ) j 1 = i hence both (α,β),(α,β ) are from Y i. Case 3: j successor, j 1 S Let j 1 be called δ so δ S. But i / S by the assumption in 2,j hence i < δ. Let ε( ) < κ be such that α δ,ε( ) > i. Let u ε : ε κ be a sequence of subsets of u, a partition of u to sets each of cardinality κ; actually the only disjointness used is that u κ ( u ε ) =. We let i 0 = i,i 1+ε = {α δ,ε( )+1+ζ + 1 : ζ < 1 + ε} for ε < κ,i κ = δ and i κ+1 = δ +1 = j. Note that: ε < κ i ε / S j. ε<κ [Why? For ε = 0 by the assumption on i, for ε successor i ε is a successor ordinal and for i limit clearly cf(i ε ) = cf(ε) < κ and S S λ κ.] We now choose c 2,ζ by induction on ζ κ+1 such that: c 2,0 = c 1 c 2,ζ is a colouring of G Y <iζ c 2,ζ is increasing with ζ Rang(c 2,ζ (Y <iξ+1 \Y <iξ )) u ξ for every ξ < ζ. For ζ = 0,c 2,0 is c 1 so is given. For ζ = ε+1 < κ: use the induction hypothesis, possible as necessarily i ε / S. For ζ κ limit: take union. For ζ = κ+1, note that each node b of Y <iζ \Y <iκ is not connected to any other such node and if the node b is connected to a node from Y <iκ then the node b necessarily has the form (min(c δ ),γ),γ X δ, hence β γ is well defined, so the node b = (min(c δ ),γ) is connected in G, more exactly in G Y δ exactly to the κ nodes {(β γ,2ε,β γ,2ε+1 ) : ε < κ}, but for every ε < κ large enough, c 2,κ ((β γ,2ε,β γ,2ε+1 )) u ε hence / u κ and u κ = κ so we can choose a colour. Case 4: j limit By the assumption of the claim there is a club e of j disjoint to S and without loss of generality min(e) = i. Now choose c 2,ξ a colouring of Y <ξ by induction on ξ e {j}, increasing with ξ such that Rang(c 2,ξ (Y <ε \Y <i )) u and c 2,0 = c 1 For ξ = min(e) = i the colouring c 2,ξ = c 2,i = c 1 is given,
7 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH for ξ successor in e, i.e. nacc(e)\{i}, use the induction hypothesis with ξ,max(e ξ) hereplayingtheroleofj,ithererecallingmax(e ξ) e,e S = for ξ = sup(e ξ) take union. Lastly, for ξ = j we are done. Stage D: ch(g) > κ. Why? Toward a contradiction, assume c is a colouring of G with set of colours κ. For each γ < λ let u γ = {c((α,β)) : γ < α < β < λ and (α,β) Y}. So u γ : γ < λ is -decreasing sequence of subsets of κ and κ < λ = cf(λ), hence for some γ( ) < λ and u κ we have γ (γ( ),λ) u γ = u. Hence E = {δ < λ : δ is a limit ordinal > γ( ) and ( α < δ)((i(α) < δ) and for every γ < δ and i u there are α < β from (γ,δ) such that (α,β) Y and c((α,β)) = i} is a club of λ. Now recall that C guesses clubs hence for some δ S we have C δ E, so for everyε < κwecanchooseβ 2ε < β 2ε+1 from(α δ,ε,α δ,ε+1 )suchthat(β 2ε,β 2ε+1 ) Y and ε u c((β 2ε,β 2ε+1 )) = ε. So β ε : ε < κ is well defined, increasing and belongs to Γ δ, hence β γ = β ε : ε < κ for some γ X δ, hence (α δ,0,γ) belongs to Y and is connected in the graph to (β 2ε,β 2ε+1 ) for ε < κ. Now if ε u then c((β 2ε,β 2ε+1 )) = ε hence c((α δ,0,γ)) ε for every ε u, so c((α δ,0,γ)) κ\u. But u = u α δ,0 and c((α δ,0,γ)) κ\u, so we get contradiction to the definition of u α δ, Similarly Claim 1.2. There is an increasing continuous sequence G i : i λ of graphs each of cardinality λ κ such that ch(g λ ) > κ and i < λ implies ch(g i ) κ and even cl(g i ) κ when: (a) λ = cf(λ) (b) S {δ < λ : cf(δ) = κ} is stationary not reflecting. Proof. Like 1.1 but the X i are not necessarily λ or use 2.2. {a6} 1.2 {a3} {c3}
8 8 SAHARON SHELAH {Fromalmost} {c1} {c3} {y8} 2. From almost free Definition 2.1. Suppose η β κ Ord for every β < α( ) and u α( ), and α < β < α( ) η α η β. 1) We say {η α : α u} is free when there exists a function h : u κ such that {η α (ε) : ε [h(α),κ)} : α u is a sequence of pairwise disjoint sets. 2) We say {η α : α u} is weakly free when there exists a sequence u ε,ζ : ε,ζ < κ of subsets of u with union u, such that the function η α η α (ε) is a one-to-one function on u ε,ζ, for each ε,ζ < κ. Claim ) We have INC chr (µ,λ,κ) and even INC + chr (µ,λ,κ), see Definition 0.3(1),(5) when: (a) α( ) [µ,µ + ) and λ is regular µ and µ = µ κ (b) η = η α : α < α( ) (c) η α κ µ (d) u i : i λ is a -increasing continuous sequence of subsets of α( ) with u λ = α( ) (e) η u α is free iff α < λ iff η u α is weakly free. {y8} {c3} 2) We have INC chr [µ,λ,κ] and even INC + chr [µ,λ,κ], see Definition 0.3(4) when: 2 (a),(b),(c) as in from 2.2 (d) η is not free (e) η u is free when u [α( )] <λ. Proof. We concentrate on proving part (1) the chromatic number case; the proof of part (2) and of the colouring number are similar. For A κ Ord, we define τ A as the vocabulary {P η : η A} {F ε : ε < κ} where P η is a unary predicate, F ε a unary function (will be interpreted as possibly partial). Without loss of generality for each i < λ,u i is an initial segment of α( ) and let A = {η α : α < α( )} and let < A be the well ordering {(η α,η β ) : α < β < α( )} of A. We further let K A be the class of structures M such that (pedantically, K A depend also on the sequence η α : α < α( ) : Let K A 1 (a) M = ( M,F M ε,pm η ) ε<κ,η A (b) P M η : η A is a partition of M, so for a M let η a = η M a be the unique η A such that a PM η (c) if a l P M η l for l = 1,2 and F M ε (a 2) = a 1 then η 1 (ε) = η 2 (ε) and η 1 < A η 2. be the class of M such that 2 (a) M K A (b) M = µ (c) if η A,u κ and η ε < A η,η ε (ε) = η(ε) and a ε P M η ε for ε u then for some a P M η we have ε u F M ε (a) = a ε and ε κ\u F M ε (a) not defined.
9 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH Clearly 3 there is M K A. [Why? As µ = µ κ and A = µ.] 4 for M K A let G M be the graph with: set of nodes M set of edges {{a,f M ε (a)} : a M,ε < κ when FM ε (a) is defined}. Now 5 if u α( ), A u = {η α : α u} A and η u is free, and M K A then G M,Au := G M ( {P M η : η A u }) has chromatic number κ; moreover has colouring number κ. [Why? Let h : u κ witness that η u is free and for ε < κ let B ε := {η α : α u and h(α) = ε}, so B = {B ε : ε < κ}, hence it is enough to prove for each ε < κ that G µ,bε has chromatic number κ. To prove this, by induction on α α( ) we choose c ε α such that: 5.1 (a) c ε α is a function (b) c β : β α is increasing continuous (c) Dom(c ε α) = B ε α := {P M η β : β < α and η β B ε } (d) Rang(c ε α) κ (e) if a,b, Dom(c α ) and {a,b} edge(g M ) then c α (a) c α (b). Clearly this suffices. Why is this possible? If α = 0 let c ε α be empty, if α is a limit ordinal let cε α = {cε β : β < α} and if α = β +1 α(β) ε let c α = c β. Lastly, if α = β +1 h(β) = ε we define c ε α as follows for a Dom(cε α ),cε α (a) is: Case 1: a B ε β. Then c ε α(a) = c ε β (a). Case 2: a B ε α\b ε β. Then c ε α(a) = min(κ\{c ε β (FM ζ (a)) : ζ < ε and FM ζ (a) Dom(cε β )}). This is well defined as: 5.2 (a) Bα ε = Bβ ε PM η β (b) if a Bβ ε then cε β (a) is well defined (so case 1 is O.K.) (c) if {a,b} edge(g M ),a Pη M β and b Bα ε then b Bβ ε and b {Fζ M (a) : ζ < ε} (d) c ε α (a) is well defined in Case 2, too (e) c ε α is a function from Bε α to κ (f) c ε α is a colouring.
10 10 SAHARON SHELAH {c6} {c3} {c12} {c3} [Why? Clause (a) by 5.1 (c), clause (b) by the induction hypothesis and clause (c) by 1 (c)+ 4. Next, clause (d) holds as {c ε β (FM ζ (a)) : ζ < ε and FM ζ (a) Bε β = Dom(c ε β )} is a set of cardinality ε < κ. Clause (e) holds by the choices of the c ε α (a) s. Lastly, to check that clause (f) holds assume {a,b} is an edge of G M Bα ε, without loss of generality for some ζ < κ we have b = Fζ M(a), hence ηm a < A ηb M. If a,b Bβ ε use the induction hypothesis. Otherwise, ζ < ε by the definition of h witnesses η u is free and the choice of Bα ε in 5.1(c). Now use the choice of c ε α (a) in Case 2 above.] So indeed 5 holds.] 6 chr(g M ) > κ if M K A. Why? Toward contradiction assume c : G M κ is a colouring. For each η A and ε < κ let Λ η,ε = {ν : ν A,ν < A η,ν(ε) = η(ε) and for some a P M ν we have c(a) = ε}. Let B ε = {η A : Λ η,ε < κ}. Now if A {B ε : ε < κ} then pick any η A\ {B ε : ε < κ} and by induction on ε < κ choose ν ε Λ η,ε \{ν ζ : ζ < ε}, possible as η / B ε by the definition of B ε. By the definition of Λ η,ε there is a ε P M ν ε such that c(ν ε ) = ε. So as M K A there is a PM η such that ε < κ F M ε (a) = a ε, but {a,a ε } edge(g M ) hence c(a) c(a ε ) = ε for every ε < κ, contradiction. So A = {B ε : ε < κ}. For each ε < κ we choose ζ η < κ for η B ε by induction on < A such that ζ η / {ζ ν : ν Λ η,ε B ε }. Let B ε,ζ = {η B ε : ζ η = ζ} for ε,ζ < κ so A = {B ε,ζ : ε,ζ < κ} and clearly η η(ε) is a one-to-one function with domain B ε,ζ, contradiction to η = η u λ is not weakly free. 2.2 Observation ) If A κ µ and η ν A ( ε < κ)(η(ε) ν(ε)) then A is free iff A is weakly free. 2) The assumptions of 2.2(2) hold when: µ λ > κ are regular, S S κ µ stationary, η = η δ : δ S,η δ an increasing sequence of ordinals of length κ with limit δ such that u [λ] <λ Rang(η δ ) : η u has a one-to-one choice function. Conclusion 2.4. Assume that for every graph G, if H G H < λ chr(h) κ then chr(g) κ. Then: (A) if µ > κ = cf(µ) and µ λ then pp(µ) = µ + (B) if µ > cf(µ) κ and µ λ then pp(µ) = µ +, i.e. the strong hypothesis (C) if κ = ℵ 0 then above λ the SCH holds. Proof. Clause (A): By 2.2 and [Sh:g, Ch.II], [Sh:g, Ch.IX, 1]. Clause (B): Follows from (A) by [Sh:g, Ch.VIII, 1]. Clause (C): Follows from (B) by [Sh:g, Ch.IX, 1]. 2.4
11 ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH References [EH74] Paul Erdős and Andras Hajnal, Solved and Unsolved Problems in set theory, Proc. of the Symp. in honor of Tarksi s seventieth birthday in Berkeley 1971 (Leon Henkin, ed.), Proc. Symp in Pure Math., vol. XXV, 1974, pp [Sh:g] Saharon Shelah, Cardinal Arithmetic, Oxford Logic Guides, vol. 29, Oxford University Press, [Sh:309], Black Boxes,, arxiv: [Sh:347], Incompactness for chromatic numbers of graphs, A tribute to Paul Erdős, Cambridge Univ. Press, Cambridge, 1990, pp [Sh:F1240], More on compactness of chromatic numbers. Einstein Institute of Mathematics, Edmond J. Safra Campus, Givat Ram, The Hebrew University of Jerusalem, Jerusalem, 91904, Israel, and, Department of Mathematics, Hill Center - Busch Campus, Rutgers, The State University of New Jersey, 110 Frelinghuysen Road, Piscataway, NJ USA address: shelah@math.huji.ac.il URL:
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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSINGULAR CARDINALS AND SQUARE PROPERTIES
SINGULAR CARDINALS AND SQUARE PROPERTIES MENACHEM MAGIDOR AND DIMA SINAPOVA Abstract. We analyze the effect of singularizing cardinals on square properties. By work of Džamonja-Shelah and of Gitik, if
Διαβάστε περισσότεραOn density of old sets in Prikry type extensions.
On density of old sets in Prikry type extensions. Moti Gitik December 31, 2015 Abstract Every set of ordinals of cardinality κ in a Prikry extension with a measure over κ contains an old set of arbitrary
Διαβάστε περισσότεραarxiv: v4 [math.lo] 15 Jun 2010
DIAMONDS arxiv:0711.3030v4 [math.lo] 15 Jun 2010 SAHARON SHELAH Abstract. If λ = χ + = 2 χ > ℵ 1 then diamond on λ holds. Moreover, if λ = χ + = 2 χ and S {δ < λ : cf(δ) cf(χ)} is stationary then S holds.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραarxiv: v2 [math.lo] 21 Jun 2010
BLACK BOXES arxiv:0812.0656v2 [math.lo] 21 Jun 2010 SAHARON SHELAH Abstract. We shall deal comprehensively with Black Boxes, the intention being that provably in ZFC we have a sequence of guesses of extra
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότερα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:
Διαβάστε περισσότεραSplitting stationary sets from weak forms of Choice
Splitting stationary sets from weak forms of Choice Paul Larson and Saharon Shelah February 16, 2008 Abstract Working in the context of restricted forms of the Axiom of Choice, we consider the problem
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g
Cardinals 1. Introduction to Cardinals We work in the base theory ZF. The definitions and many (but not all) of the basic theorems do not require AC; we will indicate explicitly when we are using choice.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότερα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
Διαβάστε περισσότεραPCF: THE ADVANCED PCF THEOREMS E69 SAHARON SHELAH
PCF: THE ADVANCED PCF THEOREMS E69 SAHARON SHELAH Abstract. This is a revised version of [Sh:430, 6]. Date: January 21, 2016. The author thanks Alice Leonhardt for the beautiful typing. I thank Peter Komjath
Διαβάστε περισσότερα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
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότερα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
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότερα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)
Διαβάστε περισσότεραKnaster-Reichbach Theorem for 2 κ
Knaster-Reichbach Theorem for 2 κ Micha l Korch February 9, 2018 In the recent years the theory of the generalized Cantor and Baire spaces was extensively developed (see, e.g. [1], [2], [6], [4] and many
Διαβάστε περισσότεραTHE GENERAL INDUCTIVE ARGUMENT FOR MEASURE ANALYSES WITH ADDITIVE ORDINAL ALGEBRAS
THE GENERAL INDUCTIVE ARGUMENT FOR MEASURE ANALYSES WITH ADDITIVE ORDINAL ALGEBRAS STEFAN BOLD, BENEDIKT LÖWE In [BoLö ] we gave a survey of measure analyses under AD, discussed the general theory of order
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότερα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
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραHomomorphism of Intuitionistic Fuzzy Groups
International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραarxiv:math/ v1 [math.lo] 15 Oct 1996
ISRAEL JOURNAL OF MATHEMATICS 95 (1996), 61 114 FURTHER CARDINAL ARITHMETIC BY arxiv:math/9610226v1 [math.lo] 15 Oct 1996 Saharon Shelah Institute of Mathematics The Hebrew University of Jerusalem, Jerusalem,
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότερα12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα 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
Διαβάστε περισσότεραQuadratic Expressions
Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots
Διαβάστε περισσότεραChapter 2. Ordinals, well-founded relations.
Chapter 2. Ordinals, well-founded relations. 2.1. Well-founded Relations. We start with some definitions and rapidly reach the notion of a well-ordered set. Definition. For any X and any binary relation
Διαβάστε περισσότερα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
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότερα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
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραNOTES ON SQUARES, SCALES, AND REFLECTION
NOTES ON SQUARES, SCALES, AND REFLECTION MAXWELL LEVINE 1. Some Basic Facts Proposition 1. If κ
Διαβάστε περισσότεραSome new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
Διαβάστε περισσότεραIntuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΟΣ ΣΥΝΔΕΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY 21 ος ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ Δεύτερος Γύρος - 30 Μαρτίου 2011
Διάρκεια Διαγωνισμού: 3 ώρες Απαντήστε όλες τις ερωτήσεις Μέγιστο Βάρος (20 Μονάδες) Δίνεται ένα σύνολο από N σφαιρίδια τα οποία δεν έχουν όλα το ίδιο βάρος μεταξύ τους και ένα κουτί που αντέχει μέχρι
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότερα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.
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότεραGAUGES OF BAIRE CLASS ONE FUNCTIONS
GAUGES OF BAIRE CLASS ONE FUNCTIONS ZULIJANTO ATOK, WEE-KEE TANG, AND DONGSHENG ZHAO Abstract. Let K be a compact metric space and f : K R be a bounded Baire class one function. We proved that for any
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCompleteness Theorem for System AS1
11 The Completeness Theorem for System AS1 1. Introduction...2 2. Previous Definitions...2 3. Deductive Consistency...2 4. Maximal Consistent Sets...5 5. Lindenbaum s Lemma...6 6. Every Maximal Consistent
Διαβάστε περισσότεραSequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραOperation Approaches on α-γ-open Sets in Topological Spaces
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 10, 491-498 Operation Approaches on α-γ-open Sets in Topological Spaces N. Kalaivani Department of Mathematics VelTech HighTec Dr.Rangarajan Dr.Sakunthala
Διαβάστε περισσότεραSOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότερα