LATTICE EXIT MODELS S. GILL WILLIAMSON
|
|
- Maria Fields
- 6 years ago
- Views:
Transcription
1 LATTICE EXIT MODELS S. GILL WILLIAMSON ABSTRACT. We discuss a class of problems wic we call lattice exit models. At one level, tese problems provide undergraduate level exercises in labeling te vertices of graps (e.g., dept first searc). At anoter level (teorems about large scale regularities of labels) tey provide concrete geometric examples of ZFC independence. We note some combinatorial and algoritmic implications.. INTRODUCTION We expand on some of te geometric and combinatorial concepts contained in te foundational work of H. Friedman ( [Fri97], [Fri98]). Let N be te set of nonnegative integers and k. For z = (n,..., n k ) N k, max{n i i =,..., k} will be denoted by max(z). Define min(z) similarly. Definition. (Downward directed grap). Let G = (N k, Θ) (vertex set N k, edge set Θ) be a directed grap. If every (x, y) of Θ satisfies max(x) > max(y) ten we call G a downward directed lattice grap. All lattice graps tat we consider will be downward directed. Definition. (Vertex induced subgrap G D ). For D N k let G D = (D, Θ D ) be te subgrap of G wit vertex set D and edge set Θ D = {(x, y) (x, y) Θ, x, y D}. We call G D te subgrap of G induced by D. Definition. (Pat and terminal pat in G D ). For t, a sequence of distinct vertices of G D, (x, x,..., x t ), is a pat of lengt t in G D if (x i, x i+ ) Θ D, i =,..., t. For x D, (x) as a pat of lengt. Te pat (x, x,..., x t ) is terminal if tere is no pat of te form Department of Computer Science and Engineering, University of California San Diego; ttp://cseweb.ucsd.edu/~gill/. Keywords: lattice exit models, ZFC independence, subset sum problem, order type equivalence, regressive regularity.
2 LATTICE EXIT MODELS FIGURE. Downward directed, k = (x, x,..., x t, x t+ ). We say x is a terminal vertex of G D if te pat (x) is a terminal pat in G D. Definition. (Cubes and Cartesian powers in N k ). Te set E E k, were E i N, E i = p, i =,..., k, are k-cubes of lengt p. If E i = E, i =,..., k, ten tis cube is E k := k E, te kt Cartesian power of E. Definition. (p D and significant labels). For finite D N k, let G D = (D, Θ D ). Let P D (z) be te set of all x wit a pat in G D from z to x (including te pat (z)). Define p D by p D (z) = min({min(x) x P D (z)}). We call p D te total pat label function. Te set {z p D (z) < min(z)} is te set of vertices wit significant labels. Te set {p D (z) p D (z) < min(z)} is te set of significant labels for p D. Definition. (ˆt D and significant labels). For finite D N k, let G D = (D, Θ D ). Let T D (z) be te set of all last vertices of terminal pats (x, x,..., x t ) were z = x. Define ˆt D by ˆt D (z) = max(z) if (z) terminal, else ˆt D (z) = min({min(x) x T D (z)})
3 LATTICE EXIT MODELS We call ˆt D te terminal pat label function. Te set {z ˆt D (z) < min(z)} is te set of vertices wit significant labels. Te set {ˆt D (z) ˆt D (z) < min(z)} is te set of significant labels for ˆt D. In definition.8 we define a variation on p D of definition. called ˆp D were ˆp D (z) = max(z) if (z) terminal. Tis convention and ˆt D (z) = max(z) if (z) terminal are used to uniquely distinguis terminal vertices wen te graps are downward (definition.). We next give some standard grap teory terminology. Definition.7. Let z D, G D = (D, Θ D ). Te adjacent vertices of z, GD z, are defined by GD z = {x (z, x) Θ D}. Non-terminal adjacent vertices of z, NT z, are defined by NT z = {x x GD z, (x) not terminal}. Te terminal adjacent vertices of z, T z, are defined by T z = GD z \ NT z. Definition.8 (Recursive definitions ˆp D, ˆt D ). Let z D, G D = (D, Θ D ). We define ˆt D (z) = max(z) if (z) is terminal. Else ˆt D (z) is te minimum over te set {ˆt D (x) x NT z } {min(x) x T z }. We define ˆp D (z) = max(z) if (z) is terminal. Else ˆp D (z) is te minimum over te set { ˆp D (x) x NT z } {min(x) x T z } {min(z)}. Note: ˆt D (z) = max(z) iff (z) is terminal, and ˆp D (z) = max(z) iff (z) is terminal. Lattice Exit Story (some intuition): We consider G D wit terminal label function ˆt D (case k = ). Tink of te digrap G D as a complex of caves (vertices) and tunnels (downward directed). Eac cave as a label on its wall giving its coordinates in N. Te value of ˆt D (z) is also written on te wall of cave z. An explorer is lowered into cave z and tasked wit finding a terminal cave x, accessible from z, tat as sortest distance to te boundary of te lattice (equal to ˆt D (z) and called te lattice exit distance ). Specifically, if ˆt D (z) min(z) ten no exploration is needed; cave z is closest to te boundary. If ˆt D (z) < min(z) ten te explorer finds a terminal pat z,..., x wit ˆt D (z) = min(x). Te pat (z,..., x) is ten written on te wall of cave z. Te set {z ˆt D (z) < min(z)} gives te caves were getting out of z gets one closer to te boundary. Te set {ˆt D (z) ˆt D (z) < min(z)} represents te distances obtained by suc explorations (i.e., significant labels for ˆt D ).
4 LATTICE EXIT MODELS ^t D(v)= ^t D(w)= ^ t D(z)= p ^ D(w)= p ^ D(z)= z w v FIGURE. Terminal vs. pat labels, k =. REGULARITIES COMFORTABLY IN ZFC We discuss te large scale regularties of ˆp D (z). We start wit a version of Ramsey s Teorem ([GRS90], p.). First we define order equivalence of k-tuples. Definition. (Equivalent ordered k-tuples). Two k-tuples in N k, x = (n,..., n k ) and y = (m,..., m k ), are order equivalent tuples (ot) if {(i, j) n i < n j } = {(i, j) m i < m j } and {(i, j) n i = n j } = {(i, j) m i = m j }. Note tat ot is an equivalence relation on N k. Te standard SDR (system of distinct representatives) for te ot equivalence relation is gotten by replacing x = (n,..., n k ) by ρ(x) := (ρ Sx (n ),..., ρ Sx (n k )) were ρ Sx (n j ) is te rank of n j in S x = {n,..., n k } (e.g, x = (, 8,,, 8), S x = {,, 8}, ρ(x) = (0,,, 0, )). Te number of equivalence classes is k j= σ(k, j) were σ(k, j) is te number of surjections from a k set to a j set. Teorem. (Ramsey s teorem version). If f : N r X, Im(f) = {f(z) z N r } finite, ten tere exists infinite H = { 0,,...} N s.t. f is constant on te order equivalence classes of H r. Definition. (X notation). Define X (statement) = 0 if statement false, and X (statement) = if statement true.
5 LATTICE EXIT MODELS [] [] [] [] [] 8 [] [] [] [] [] FIGURE. [ ˆp D (z)] (in brackets) and ˆt D (z) by dept first searc ((,), (,0), (,)) ((7,9), (,), (,)) ((7,9), (,0)) 9 () (0) 8 7 () (0) FIGURE. Basic idea for proof of teorem. Teorem. ( ˆp D large scale regularity structure). Let G = (N k, Θ). Tere exists an infinite H = { 0,,...} N suc tat for all z D = H k
6 LATTICE EXIT MODELS eiter ˆp D (z) = 0 < min(z) or ˆp D (z) min(z). Tus, ˆp D as at most one significant label: { ˆp D (z) ˆp D (z) < min(z)}. Proof. Recall definition. of te function ˆp D (z). Use Ramsey (. wit r = k) on N k : w = (n,... n k, m,... m k ) N k (x, y) N k N k, x = (n,... n k ), y = (m,... m k ). Let f (w) = X ((x, y) Θ), so tat Im( f ) = {0, }. By Ramsey s teorem, tere is an infinite H N suc tat f is constant on te order type equivalence classes of H k H k H k. We sow tat ˆp D (z) as at most one significant label on D = H k. Let z = x,..., x t be a sortest pat in G D from z to a vertex min(x t ) = ˆp D (z). We claim min(x t ) = 0. Oterwise, replace every minimum coordinate of x t by 0 to obtain ˆx t and note tat (x t, x t ) and (x t, ˆx t ) ave te same ot in H k. Tus, (x t, ˆx t ) Θ and z = x,..., ˆx t is a sortest pat required.. BASIC DEFINITIONS AND THEOREMS Definition. (decreasing sets of functions). Let f and g be functions wit domains contained in N k and ranges in N. Define f g by () domain( f ) domain(g) and () for all x domain( f ), f (x) g(x). A set S of suc functions is decreasing if for all f, g S wit domain( f ) domain(g), f g. Definition. (regressive value). Let X N k and f : X Y N. An integer n is a regressive value of f on X if tere exist x suc tat f (x) = n < min(x). Definition. (field of a function and reflexive functions). For A N k define field(a) to be te set of all coordinates of elements of A. A function f is reflexive in N k if domain( f ) N k and range( f ) field(domain( f )). Definition. (te set of functions T(k) ). T(k) denotes all reflexive functions wit finite domain: domain( f ) <. Definition. (full and jump free). Let Q T(k) denote a collection of reflexive functions in N k wose domains are finite subsets of N k. () full: Q is a full family of functions on N k if for every finite subset D N k tere is at least one function f in Q wose domain is D. () jump free: For D N k and x D define D x = {z z D, max(z) < max(x)}. Suppose tat for all f A and f B in Q, were f A as domain A and f B as domain B, te conditions
7 LATTICE EXIT MODELS 7 x A B, A x B x, and f A (y) = f B (y) for all y A x imply tat f A (x) f B (x). Ten Q will be called a jump free family of functions on N k. Definition. (Regressively regular over E). Let k, D N k, D finite, f : D N. We say f is regressively regular over E, E k D, if for eac ot eiter () or (): () decreasing mins: For all x, y E k of order type ot, f (x) = f (y) < min(e) () non decreasing mins: For all x E k of order type ot f (x) min(x). Teorem.7 (Decreasing class). Let k, p and S T(k) be a full and decreasing family of functions. Ten some f S as at most k k regressive values on some Cartesian power E k domain( f ), E = p. In fact, tere exists E A N, E = p and f S, domain( f ) = A k suc tat f is regressively regular over E. Teorem.8 (Jump free teorem ([Fri97], [Fri98])). Let p, k and S T(k) be a full and jump free family. Ten some f S as at most k k regressive values on some E k domain( f ), E = p. In fact, some f S is regressively regular over some E of cardinality p. z B A x a subset of B x x x=(x,x ) A A x B x max(x) z FIGURE. Basic jump free condition. We use ZFC for te axioms of set teory, Zermelo-Frankel plus te axiom of coice (see Wikipedia). Te jump free teorem can be proved in ZFC + ( n)( n-subtle cardinal) but not in ( n-subtle cardinal) for any fixed n (assuming tis teory is consistent). A proof is in Section of [Fri97], Applications of Large Cardinals to Grap Teory, October, 997, No. of Downloadable Manuscripts. Te decreasing class teorem is proved in Section of [Fri97] using tecniques witin ZFC (Ramsey teory in particular). Te jump free teorem is used to study lattice posets in [RW99] (Appendix A defines n-subtle cardinals). Te
8 LATTICE EXIT MODELS 8 B x = + A x = x=(,9) 9 ^ t A (y) = ^ t B (y) y є A x = > 8 x є A U B A x Bx U ^ (x) ^ (x) t A t B FIGURE. Dased edges not allowed by jump free. functions ˆp D define a full and decreasing class and tus ave large scale regularities of te form specified in Teorem.7. Te functions ˆt D form a full but not decreasing class. We will use te jump-free teorem to describe te large scale regularities of tese functions.. LARGE SCALE REGULARITIES OF MORE COMPLEX LATTICE EXIT MODELS Lemma. ({ˆt D } full, reflexive, jump free). Take S = {ˆt D D N k, D < } (see.). Ten S is full, reflexive, and jump free. Proof. See figures and. Full and reflexive is immediate. Let ˆt A and ˆt B satisfy te conditions of f A and f B in definition.. Note tat by definition, x / A x or B x. If (x) is terminal in A ten ˆt A (x) = max(x) ˆt B (x) by te downward condition on G. Else, let (x,..., y) be a terminal pat in G A. Ten ˆt B (y) = ˆt A (y) = max(y) implies (x,..., y) is a terminal pat in G B. Tus, ˆt A (x) ˆt B (x) as was to be sown. Teorem. (Jump free teorem for ˆt D ). Let S = {ˆt D D N k, D < } and let p, k. Ten some f S as at most k k regressive values on
9 LATTICE EXIT MODELS E={,,,8} ^t D FIGURE 7. Regressive regularity of ˆt D on E = {,,, 8} some E k domain( f ), E = p. In fact, some f S is regressively regular over some E of cardinality p. Proof. Follows from lemma. and te jump free teorem.8. See figure 7 for an example of regressive regularity. Following Friedman [Fri97]: Definition. (Partial selection). A function F wit domain a subset of X and range a subset of Y will be called a partial function from X to Y (denoted by F : X Y). If z X but z is not in te domain of F, we say F is not defined at z. Let r. A partial function F : N k (N k N) r N will be called a partial selection function if wenever F(x, ((y, n ), (y, n ),... (y r, n r ))) is defined we ave F(x, ((y, n ), (y, n ),... (y r, n r ))) = n i for some i r. Next we generalize te ˆt D to a function ŝ D. We refer to te former function as te terminal vertex model and to te latter as te committee model. Definition. (ŝ D for G D ). Let r, z D, G D = (D, Θ D ), D finite, G z D = {x (z, x) Θ D}. Let F : N k (N k N) r N be a partial selection function. We define ŝ D (z) recursively as follows. Let Φ D z := {F[z, (y, n ), (y, n ),..., (y r, n r )], y i G z D}
10 LATTICE EXIT MODELS 0 be te set of defined values of F were n i = ŝ D (y i ) if Φ D y i = and n i = min(y i ) if Φ D y i =. If Φ D z =, define ŝ D (z) = max(z). If Φ D z =, define ŝ D (z) be te minimum over Φ D z. NOTE: If Φz D = ten an induction on max(z) sows ŝ D (z) < max(z). Recall tat (G, Θ) is downward. Tus, Φz D = iff ŝ D (z) = max(z). Teorem. (Large scale regularities for ŝ D ). Let r, p, k. S = {ŝ D D N k, D < }. Ten some f S as at most k k regressive values over some E k domain( f ), E = p. In fact, some f S is regressively regular over some E of cardinality p. Proof. Recall.8. Let S = {ŝ D D N k, D < }. S is obviously full and reflexive. We sow S is jump free. We sow for all ŝ A and ŝ B in S, te conditions x A B, A x B x, and ŝ A (y) = ŝ B (y) for all y A x imply tat ŝ A (x) ŝ B (x). (i.e., S is jump free). If Φx A = ten ŝ A (x) = max(x) ŝ B (x). Let n = F[x, (y, n ), (y, n ),... (y r, n r )] Φx A were n i = ŝ A (y i ) if ŝ A (y i ) < max(y i ) and n i = min(y i ) if ŝ A (y i ) = max(y i ). But ŝ A (y i ) = ŝ B (y i ), i =,..., r, implies n Φx B and tus Φx A Φx B and ŝ A (x) = min(φx A ) min(φx B ) = ŝ B (x). F[x, ((,), )), ((,8), ), ((8,7), 7)] = C F[x, ((,8), )), ((8,7), 7)] = 7 C x=(7, ) () F[x, ((,8), )), ((, 7), )] = C (,) 0 Φ D x ={,, 7} sˆ D (x) = Φ 9 D C z ={} sˆ D (z) = max(z) C 7 e.g., z=(8,7) max(z)=8 8 D is all points sown: E={7,} and E x E= (,8) {(7,7), (7,), (,7),,)} 7 7 (7,7) (8,7)(8) (,7) (7) C E={7,}E={7,} (,) () () (7) E D (8) D () (9) F () () FIGURE 8. An example of ŝ D
11 LATTICE EXIT MODELS As an example of computing ŝ D, consider figure 8. Te values of te terminal vertices were Φ A x = are sown in parenteses, left to rigt: (), (), (), (), (), (8), (8), (9). Tese numbers are max((a, b)) for eac terminal vertex (a, b). We assume we ave a partial selection functions of te form F : N (N N) r N (r =, ere). To compute ŝ D (x) for x = (7, ) tere are tree defined values: F[x, ((, ), ), ((, 8), ), ((8, 7), 7)] =, F[x, ((, 8), ), ((8, 7), 7)] = 7, F[x, ((, 8), ), ((, 7), )] =. Intuitively, we tink of tese as (ordered) committees reporting values to te boss, x = (7, ). Te first committee, C, consists of subordinates, (, ), (, 8), (8, 7) reporting respectively,, 7. Te committee decides to report (indicated by C in figure 8). Te recursive construction starts wit terminal vertices reporting teir minimal coordinates. But, te value reported by eac committee is not, in general, te actual minimum of te reports of te individual members. Neverteless, te boss, x = (7, ) always takes te minimum of te values reported to im by te committees. In tis case te values reported by te committees are, 7, te boss takes (i.e., ŝ D (x) = for te boss, x = (7, )). Observe in figure 8 tat te values in parenteses, (), (), (), (), (), (8), (8), (9), don t figure into te recursive construction of ŝ D. Tey immediately pass teir minimum values on to te computation:,,,,,, 7,. Tis leads to te following generalization of definition.. Definition. ( ρ D for G D). Let r, k, z D, D finite, G D = (D, Θ D ). Let F : N k (N k N) r N be a partial selection function. Let ρ D : D N be suc tat min(x) ρ D (x). We define ρ D recursively on max. Let Φ D z := {F[z, (y, n ), (y, n ),..., (y r, n r )], y i G z D} be te set of defined values of F were n i = ρ D (y i) if Φy D i =, and n i = min(y i ) if Φy D i =. If Φz D =, define ρ D (z) to be te minimum over Φz D. If Φz D =, define ρ D (z) = ρ D(z). Note tat ρ D need not be reflexive on D. Lemma.7. Let E be of cardinality p. Ten ŝ D is regressively regular over E iff ρ D is regressively regular over E. In fact, ρ D (x) = ŝ D(x) < max(x) if Φ D x =. Proof. Let x, y E k. From te recursive definitions. and., te sets Φx D are te same for bot ρ D (x) and ŝ D(x). Tus, w = ŝ D (x) = ŝ D (y) < min(e) iff w = ρ D (x) = ρ D (y) < min(e) as tese relations imply bot Φx D = and Φy D =. Likewise, if Φx D = ten max(x) > ŝ D (x) =
12 LATTICE EXIT MODELS ρ D (x) min(x). If ΦD x =, by definition ρ D (x) = ρ D(x) min(x) and ŝ D (x) = max(x) min(x). Teorem.8 (Regressive regularity of ρ D ). Let r, p, k. Let G = (N k, Θ) be downward directed. Let S = { ρ D D Nk, D < }. Ten some f S as at most k k regressive values on some E k domain( f ) = D, E = p. In fact, some f S is regressively regular over some E of cardinality p. Proof. Follows from lemma.7 wic sows tat te sets, E, E = p, over wic ρ D is regressively regular don t depend on te function ρ D as defined. In fact, ρ D (x) = ŝ D(x) < max(x) if Φx D =. If Φx D = ten te values ρ D (x) = ρ D(x) are only constrained by te condition ρ D (x) min(x). Teorem. wit max(x) replaced by min(x) wen Φx D = as been sown by Friedman to be independent of ZFC (same large cardinals as te jump free teorem). See Teorem. troug Teorem. [Fri97]. Tus, a special case of teorem.8 (ρ D = min) is independent of ZFC. Lemma.7 sows tat teorem.8 for any ρ D results in exactly te same sets E of regressive regularity as teorem.. Hence, teorem.8 provides a family of ZFC independent jump free type teorems parameterized by te ρ D. Figure 9 sows an example of a regressively regular ρ D function over a set E. Te coices of F (definition.) aren t unique. We use ρ := ρ D. For z = (x, y) we define ρ(z) = x + y, labeling only E wit tese.. COMBINATORIAL FORMULATIONS We start by defining some canonical systems of distinct representatives (SDRs). Definition. (SDRs). Let SUR(k, j) be te surjective maps {0,..., k } to {0,..., j }. Let F kp = { f f : {0,... k } {0,..., p }}. Define OT(k, p) := p j=sur(k, j). OT(k, p) is te canonical SDR for te order type equivalence relation on F kp. Let E = {e 0,..., e p } be a subset of N, e 0 < < e p. Let E k = {e f f F kp } were e f = (e f (0),..., e f (p ) ). Define OT(k, p, E) = {e f f OT(k, p)}
13 LATTICE EXIT MODELS 0 For z E of ot (0, ), ρ D (z) = < min(e). For ot (0, 0), (, 0), ρ D (z) min(z) ρ(s, t) = s + t Construct ρ D regressively regular over E = {, 7, }. D is E plus circled vertices. Terminals: (, ), (, ), (, ), (, ), (, ), (, ), (9, ), (9, ), (7, 7), (9, 7), (, 7), (, ). We make up bosses and committees to define ρ D to be regressively regular over E. For boss (, 7) we assume committees {((, ), ), ((, ), ))} and {((, ), ), ((, ), )}, reporting values and. Te boss (, 7) takes te minimum,. Tus, ρ D ((, 7)) =. F((, 7), ((, ), ), ((, ), )) =, F((, 7), ((, ), ), ((, ), )) = implies D ((, 7)) =. Defining F((, ), ((, ), ), ((, ), )) = implies ρ D (, ) =. Defining F((, 8), ((, ), ), ((, ), )) = implies ρ D ((, 8)) =. F((, ), ((, 8), )) = F((7, ), ((, 8), )) = gives ρ D ((, )) = and ρ D ((7, )) =. F((, ), ((9, ), ), ((9, ), ), ((9, 7), 7)) = implies ρ D ((, )) = F((7, ), ((, ), )) = implies ρ D ((7, )) =. For terminal (s, t) define ρ(s, t) = s + t. FIGURE 9. Computing example of ρ D to be te canonical SDR for order type equivalence on E k. Define E k f = {e g g F kp, g f } to be te equivalence class in E k associated wit f OT(k, p).
14 LATTICE EXIT MODELS Referring to figure 0, E 0 = {(e, e, e 0 ), (e, e, e 0 ), (e, e e 0 ), (e, e, e )}. OTs {0,, } {0,,, } FIGURE 0. Canonical order type array T entries in F, Definition. ( Canonical order type array T). Define a canonical order type array, T, wit entries in F kp, as follows. Te first column of T is te vector T () = ( f, f,... f m ) were te f i are te elements of OT(k, p). Te sets SUR(k, j) are listed by j wit elements of eac set in lexicograpic order. Te row, T (i), i =,..., m, is T (i) = ( f i, f i,..., f ini ), te lexicograpically ordered equivalence class associated wit f i. Te entries T(i, j) = f ij were i = π( f i ), j = π( f ij ), are te positions of f i and f ij in te lists of column T () and row T (i) respectively. Definition. (TE k and gtk E ). Let T be a canonical order type array over F kp, E = {e 0,..., e p } N. Replacing eac f in T by e f (definition.) gives an array wic we denote by X = TE k. Tus, X(i, j) = e f ij. If domain(g) E k ten Y = gte k as Y(i, j) = g(e f ij ) = g(x(i, j)). Consider figure 9 were E = {, 7, }. T = T E = Using ρ D as in figure 9 we get e 00 e e e 0 e 0 e = e 0 e 0 e ρ D (, ) ρ D (7, 7) ρ D (, ) ρ D T E = ρ D (, 7) ρ D (, ) ρ D (7, ) = ρ D (7, ) ρ D (, ) ρ D (, wic displays te regressive regularity over E. (, ) (7, 7) (, ) (, 7) (, ) (7, ) (7, ) (, ) (, 7) 8 8
15 LATTICE EXIT MODELS Note tat te pair of arrays, (X, Y), were X = T E and Y = ρ D T E, X = (, ) (7, 7) (, ) (, 7) (, ) (7, ) (7, ) (, ) (, 7) completely specifies te function ρ D. and Y = 8 8 We use te notation of definition., lemma.7 and teorem.8. Definition. (D capped by E k D). For D N k, let max(d) be te maximum over max(z), z D. Let setmax(d) = {z z D, max(z) = max(d)}. If setmax(d) = setmax(e k ), we say tat D is capped by E k D wit te cap defined to be setmax(e k ). Definition. (Canonical capped bi-array). Let T be a canonical order type array over F kp, E = {e 0,..., e p } N. Te pair (X, Y) = (TE k, ρ D Tk E ) is a canonical bi-array representation of te function ρ D. Let D be capped by E k D. Te pair (X, Y) = (TE k, ρ D Tk E ) is a canonical capped bi-array representation of te function ρ D. We write (X, Y) p = (TE k, ρ D Tk E ) to indicate E = p. See figure 7 for an example were D is capped by E k D. Te downward condition on G implies it is always possible to coose D to satisfy tis condition witout canging te function (X, Y) = (T k E, ρ D Tk E ). Suc a D, capped by E k, contains a description of E k exposed in te cap, setmax(e k ). Note te following invariants of (X, Y) = (T k E, ρ D Tk E ). Any pair (X σ, Y σ ), were te rows are permuted by σ also represents te function ρ D and preserves te elements of te first column. Given a permutation τ on {,..., n i } wit τ() = te elements of rows X (i) and Y (i), i =,... m i, can be replaced by X(i, τ()),..., X(i, τ(i)) and Y(i, τ()),..., Y(i, τ(i)), preserving te elements of te first column wile still representing te function ρ D. We use te notation of definition., lemma.7 and teorem.8. Definition. (subsets of E k ). Let f be regressively regular over E N, E = p (definition.). Define subsets E k L := {x x Ek, f (x) < min(e)}, E k U := {x x Ek, f (x) min(x)}. For f = ρ D, Ek L = {x x Ek, ρ D (x) < min(e)}. Ek U is furter partitioned E k = = {x x Ek U, Φ D(x) = } and E k = {x x Ek U, Φ D(x) = }.
16 LATTICE EXIT MODELS Note tat bot EL k and Ek U, wen nonempty, are unions of elements (blocks) of OT(k, p, E) (definition.). By definition, te regressively regular f is constant on te blocks of te order type equivalence classes contained in EL k. Recall tat ρ D is restricted to E k in te recursive construction of ρ D and can be canged on tis set as long as te condition ρ D (z) min(z) olds. Suc canges in ρ D leave te sets of definition. invariant. As an example, consider figure 9. Tere, k =, p = wit E = {, 7, }; E is indicated by small squares, D by squares plus circles. Te SDR for order type equivalence on F, is OT(, ) = {(0, 0), (0, ), (, 0)}, OT(,, E) = {(e (0,0), e (0,), e (,0) } = {(e 0, e 0 ), (e 0, e ), (e, e 0 )} = {(, ), (, 7), (7, )}. We ave E k = {e f f F, } (figure 9.) EL k = {(, 7), (, ), (7, )} and, in tis case, te order equivalence class E k (0,) = Ek L. In tis example, E k U = Ek (0,0) Ek (,0) wit E k = diag(ek ) {(, 7)} and E k = = Ek L {(, ), (7, )} were diag(e k ) = {e 00, e, e } = {(, ), (7, 7), (, )}. It is easy to see in general tat EL k Ek = and tat eiter diag(ek ) E k or diag(e k ) EL k.. USING THE FLEXIBILITY OF ρ D Definition. (Regressive regularity for (X, Y)). A canonical (capped) bi-array (X, Y) = (T k E, ρ D Tk E ) is regressively regular if for eac row Y (i), i =,..., m, eiter or Y (i) (j) min(x (i) (j)), j n i Y (i) (s) = Y (i) (t) < min(e), s, t n i. Teorem. (Version of teorem.8 for bi-arrays). Let r, p, k. Let G = (N k, Θ) be downward directed. Tere is a canonically capped bi-array (X, Y) = (TE k, ρ D Tk E ), E = p, suc tat {Y(i, j) Y(i, j) < min(x(i, j))} < k k. In fact, tere exists a regressively regular canonical capped bi-array (X, Y) = (TE k, ρ D Tk E ), E = p. Proof. Restatement of teorem.8 for canonical capped bi-arrays.
17 LATTICE EXIT MODELS 7 Lemma. (Coosing ρ D ). Let r, p, k. Let G = (N k, Θ) be downward directed. Let (X, Y) = (TE k, ρ D Tk E ), E = p, be a regressively regular canonical capped bi-array. Assume EL k is nonempty and diag(ek ) E k. Let e 0 = (e 0, e 0,..., e 0 ) E k. Ten ρ D can be cosen suc tat () ρ D (z) + ρ D (e 0 ) = ( Ek L + )e 0. z EL k Proof. We can use te notation of eiter teorem. or teorem.8. We use te latter. Recall tat E k L = {z ρ D (z) < e 0} were e 0 = min(e). Setting S = z E k L ρ D (z) we ave S < Ek L e 0. But diag(e k ) E k implies ρ D (e 0 ) = ρ D(e 0 ) wic can be assigned any value ρ D(e 0 ) min(e 0 ) = e 0. Tus, assign ρ D (e 0 ) = e 0 + ( EL k e 0 S) > e 0 since EL k =. Tus () is satisfied. As an aside, in te notation of teorem. we can calculate E k L e 0 as follows: () E k L e 0 = e 0 m i= X (Y(i, ) < e 0 )n i. Also, () z E k L ρ D (z) = m i= X (Y(i, ) < e 0 ) n i j= Y(i, j). We engage in a tougt experiment by using teorem. and lemma. to construct a class of sequences of instances to te classical subset sum problem. We assume tat for eac z diag(n k ), te set of partial selection functions (see.) of te form F[z, (y, n ),...], z diag(n k ), is empty. Tis restricted diagonal condition guarantees tat, r, Φ D z = {F[z, (y, n ), (y, n ),..., (y r, n r )], y i G z D} is empty for z diag(e k ). Tis implies diag(e k ) E k as in lemma.. Let r, p, k. Let G = (N k, Θ) be downward directed and diagonally restricted. Let (X, Y) = (TE k, ρ D Tk E ), E = p =,,..., be a sequence of regressively regular canonical capped bi-arrays. Wit eac bi-array we associate te multiset M p = {Y(i, j) i m, j n i, Y(i, ) < e 0 } {Y(, ),... Y(, p)}. Assume first tat EL k =. For eac suc M p let t p = ( EL k + )e 0 as in lemma.. As in lemma., take Y(, ) = ρ D (e 0 ) as specified in lemma.. Lemma. states tat for tis instance tere is a solution to te subset sum problem. Coose Y(, ),..., Y(, p) suc tat tis solution is unique.
18 LATTICE EXIT MODELS 8 If E k L =, coose Y(, ),..., Y(, p) and t p suc tat tere is no solution. Tus, te instances to te subset sum problems just described ave solutions if and only if EL k =. Tis condition can be verified by inspecting te first column, Y () and comparing it wit te first column X () (because of regressive regularity). Te number of comparisons is m < k k, k fixed. To summarize, we ave defined a class of instances to te subset sum problem, parameterized by r, k and G = (N k, Θ), a downward directed and diagonally restricted grap. Te parameter p goes to infinity to measure te size of te instances. We fix k and vary r and G. Our procedure for cecking te solutions for tese instances is localized to te first columns of X and Y and tus bounded by k k. Te existence of tese instances and teir solution as been demonstrated by using a corollary to a teorem independent of ZFC (teorem.). No oter proof of existence is known to us. Te corollary we used is teorem. wit downward directed grap G = (N k, Θ) replaced by downward directed, diagonally restricted grap G = (N k, Θ). We conjecture tat tis corollary is also independent of ZFC. In tis case, te only proof of te existence of tese instances and teir solution would use a ZFC independent teorem. Acknowledgments: Te autor tanks Professors Jeff Remmel and Sam Buss (University of California San Diego, Department of Matematics) and Professor Emeritus Rod Canfield (University of Georgia, Department of Computer Science) for teir elpful comments and suggestions. REFERENCES [Fri97] Harvey Friedman. Applications of large cardinals to grap teory. Tecnical report, Department of Matematics, Oio State University, 997. [Fri98] Harvey Friedman. Finite functions and te necessary use of large cardinals. Ann. of Mat., 8:80 89, 998. [GRS90] R. L. Graam, B. L. Rotscild, and J. H. Spencer. Ramsey Teory nd Ed. Jon Wiley, New York, 990. [RW99] Jeffrey B. Remmel and S. Gill Williamson. Large-scale regularities of lattice embeddings of posets. Order, : 0, 999.
ZFC INDEPENDENCE AND SUBSET SUM
ZFC INDEPENDENCE AND SUBSET SUM S. GILL WILLIAMSON Abstract. Let Z be the integers and N the nonnegative integers. and let G = (N k, Θ) be a max-downward digraph. We study sets of functions H = {h ρ D
More informationHOMEWORK HELP 2 FOR MATH 151
HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,
More informationGeneric maximum nullity of a graph
Generic maximum nullity of a grap Leslie Hogben Bryan Sader Marc 5, 2008 Abstract For a grap G of order n, te maximum nullity of G is defined to be te largest possible nullity over all real symmetric n
More informationThe Complexity of Computing the MCD-Estimator
Te Complexity of Computing te MCD-Estimator Torsten Bernolt Lerstul Informatik 2 Universität Dortmund, Germany torstenbernolt@uni-dortmundde Paul Fiscer IMM, Danisc Tecnical University Kongens Lyngby,
More information1. Questions (a) through (e) refer to the graph of the function f given below. (A) 0 (B) 1 (C) 2 (D) 4 (E) does not exist
Mat 1120 Calculus Test 2. October 18, 2001 Your name Te multiple coice problems count 4 points eac. In te multiple coice section, circle te correct coice (or coices). You must sow your work on te oter
More informationSymmetry Labeling of Molecular Energies
Capter 7. Symmetry Labeling of Molecular Energies Notes: Most of te material presented in tis capter is taken from Bunker and Jensen 1998, Cap. 6, and Bunker and Jensen 2005, Cap. 7. 7.1 Hamiltonian Symmetry
More informationMA455 Manifolds Solutions 1 May 2008
MA455 Manifolds Solutions 1 May 2008 1. (i) Given real numbers a < b, find a diffeomorpism (a, b) R. Solution: For example first map (a, b) to (0, π/2) and ten map (0, π/2) diffeomorpically to R using
More informationDomination Problems in Nowhere-Dense Classes of Graphs
LIPIcs Leibniz International Proceedings in Informatics Domination Problems in Nowere-Dense Classes of Graps Anuj Dawar 1, Stepan Kreutzer 2 1 University of Cambridge Computer Lab, U.K. anuj.dawar@cl.cam.ac.uk
More informationEfficient algorithms for for clone items detection
Efficient algoritms for for clone items detection Raoul Medina, Caroline Noyer, and Olivier Raynaud Raoul Medina, Caroline Noyer and Olivier Raynaud LIMOS - Université Blaise Pascal, Campus universitaire
More informationExam 1 Review Solutions
Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),
More informationLIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT
LIMITS AND DERIVATIVES Te limit of a function is defined as te value of y tat te curve approaces, as x approaces a particular value. Te limit of f (x) as x approaces a is written as f (x) approaces, as
More informationHigher Derivatives. Differentiable Functions
Calculus 1 Lia Vas Higer Derivatives. Differentiable Functions Te second derivative. Te derivative itself can be considered as a function. Te instantaneous rate of cange of tis function is te second derivative.
More informationDifferentiation in higher dimensions
Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends
More informationVolume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households
Volume 29, Issue 3 Existence of competitive equilibrium in economies wit multi-member ouseolds Noriisa Sato Graduate Scool of Economics, Waseda University Abstract Tis paper focuses on te existence of
More informationContinuity and Differentiability Worksheet
Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;
More informationch (for some fixed positive number c) reaching c
GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan
More informationImproved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Journal of Combinatorial Optimization manuscript No. (will be inserted by te editor) Improved Algoritms for Largest Cardinality 2-Interval Pattern Problem Erdong Cen, Linji Yang, Hao Yuan Department of
More informationf a h f a h h lim lim
Te Derivative Te derivative of a function f at a (denoted f a) is f a if tis it exists. An alternative way of defining f a is f a x a fa fa fx fa x a Note tat te tangent line to te grap of f at te point
More information4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.
Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra
More informationMVT and Rolle s Theorem
AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state
More informationMathematics 5 Worksheet 11 Geometry, Tangency, and the Derivative
Matematics 5 Workseet 11 Geometry, Tangency, and te Derivative Problem 1. Find te equation of a line wit slope m tat intersects te point (3, 9). Solution. Te equation for a line passing troug a point (x
More informationBob Brown Math 251 Calculus 1 Chapter 3, Section 1 Completed 1 CCBC Dundalk
Bob Brown Mat 251 Calculus 1 Capter 3, Section 1 Completed 1 Te Tangent Line Problem Te idea of a tangent line first arises in geometry in te context of a circle. But before we jump into a discussion of
More information2.8 The Derivative as a Function
.8 Te Derivative as a Function Typically, we can find te derivative of a function f at many points of its domain: Definition. Suppose tat f is a function wic is differentiable at every point of an open
More informationMore on generalized inverses of partitioned matrices with Banachiewicz-Schur forms
More on generalized inverses of partitioned matrices wit anaciewicz-scur forms Yongge Tian a,, Yosio Takane b a Cina Economics and Management cademy, Central University of Finance and Economics, eijing,
More informationSolution. Solution. f (x) = (cos x)2 cos(2x) 2 sin(2x) 2 cos x ( sin x) (cos x) 4. f (π/4) = ( 2/2) ( 2/2) ( 2/2) ( 2/2) 4.
December 09, 20 Calculus PracticeTest s Name: (4 points) Find te absolute extrema of f(x) = x 3 0 on te interval [0, 4] Te derivative of f(x) is f (x) = 3x 2, wic is zero only at x = 0 Tus we only need
More information. If lim. x 2 x 1. f(x+h) f(x)
Review of Differential Calculus Wen te value of one variable y is uniquely determined by te value of anoter variable x, ten te relationsip between x and y is described by a function f tat assigns a value
More informationMath 161 (33) - Final exam
Name: Id #: Mat 161 (33) - Final exam Fall Quarter 2015 Wednesday December 9, 2015-10:30am to 12:30am Instructions: Prob. Points Score possible 1 25 2 25 3 25 4 25 TOTAL 75 (BEST 3) Read eac problem carefully.
More informationContinuity. Example 1
Continuity MATH 1003 Calculus and Linear Algebra (Lecture 13.5) Maoseng Xiong Department of Matematics, HKUST A function f : (a, b) R is continuous at a point c (a, b) if 1. x c f (x) exists, 2. f (c)
More information1. Consider the trigonometric function f(t) whose graph is shown below. Write down a possible formula for f(t).
. Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd, periodic function tat as been sifted upwards, so we will use
More informationOn convexity of polynomial paths and generalized majorizations
On convexity of polynomial pats and generalized majorizations Marija Dodig Centro de Estruturas Lineares e Combinatórias, CELC, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003 Lisboa, Portugal
More informationCombining functions: algebraic methods
Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)
More informationMath 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006
Mat 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006 f(x+) f(x) 10 1. For f(x) = x 2 + 2x 5, find ))))))))) and simplify completely. NOTE: **f(x+) is NOT f(x)+! f(x+) f(x) (x+) 2 + 2(x+) 5 ( x 2
More informationMaterial for Difference Quotient
Material for Difference Quotient Prepared by Stepanie Quintal, graduate student and Marvin Stick, professor Dept. of Matematical Sciences, UMass Lowell Summer 05 Preface Te following difference quotient
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc
More informationDerivatives. By: OpenStaxCollege
By: OpenStaxCollege Te average teen in te United States opens a refrigerator door an estimated 25 times per day. Supposedly, tis average is up from 10 years ago wen te average teenager opened a refrigerator
More informationDIGRAPHS FROM POWERS MODULO p
DIGRAPHS FROM POWERS MODULO p Caroline Luceta Box 111 GCC, 100 Campus Drive, Grove City PA 1617 USA Eli Miller PO Box 410, Sumneytown, PA 18084 USA Clifford Reiter Department of Matematics, Lafayette College,
More informationFunction Composition and Chain Rules
Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function
More informationMAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points
MAT 15 Test #2 Name Solution Guide Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points Use te grap of a function sown ere as you respond to questions 1 to 8. 1. lim f (x) 0 2. lim
More informationLecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines
Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to
More informationA Combinatorial Interpretation of the Generalized Fibonacci Numbers
ADVANCES IN APPLIED MATHEMATICS 19, 306318 1997 ARTICLE NO. AM970531 A Combinatorial Interpretation of te Generalized Fibonacci Numbers Emanuele Munarini Dipartimento di Matematica, Politecnico di Milano,
More informationLab 6 Derivatives and Mutant Bacteria
Lab 6 Derivatives and Mutant Bacteria Date: September 27, 20 Assignment Due Date: October 4, 20 Goal: In tis lab you will furter explore te concept of a derivative using R. You will use your knowledge
More information1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point
MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note
More informationCharacterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
Discrete Applied Matematics 156 (2008) 1711 1724 www.elsevier.com/locate/dam Caracterization of reducible exagons and fast decomposition of elementary benzenoid graps Andrej Taranenko, Aleksander Vesel
More informationDifferential Calculus (The basics) Prepared by Mr. C. Hull
Differential Calculus Te basics) A : Limits In tis work on limits, we will deal only wit functions i.e. tose relationsips in wic an input variable ) defines a unique output variable y). Wen we work wit
More information2.11 That s So Derivative
2.11 Tat s So Derivative Introduction to Differential Calculus Just as one defines instantaneous velocity in terms of average velocity, we now define te instantaneous rate of cange of a function at a point
More informationTHE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Math 225
THE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Mat 225 As we ave seen, te definition of derivative for a Mat 111 function g : R R and for acurveγ : R E n are te same, except for interpretation:
More informationHow to Find the Derivative of a Function: Calculus 1
Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te
More informationTest 2 Review. 1. Find the determinant of the matrix below using (a) cofactor expansion and (b) row reduction. A = 3 2 =
Test Review Find te determinant of te matrix below using (a cofactor expansion and (b row reduction Answer: (a det + = (b Observe R R R R R R R R R Ten det B = (((det Hence det Use Cramer s rule to solve:
More informationPacking polynomials on multidimensional integer sectors
Pacing polynomials on multidimensional integer sectors Luis B Morales IIMAS, Universidad Nacional Autónoma de México, Ciudad de México, 04510, México lbm@unammx Submitted: Jun 3, 015; Accepted: Sep 8,
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x
More informationMonoidal Structures on Higher Categories
Monoidal Structures on Higer Categories Paul Ziegler Monoidal Structures on Simplicial Categories Let C be a simplicial category, tat is a category enriced over simplicial sets. Suc categories are a model
More information3.4 Worksheet: Proof of the Chain Rule NAME
Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are
More informationSECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY
(Section 3.2: Derivative Functions and Differentiability) 3.2.1 SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY LEARNING OBJECTIVES Know, understand, and apply te Limit Definition of te Derivative
More informationTHE IMPLICIT FUNCTION THEOREM
THE IMPLICIT FUNCTION THEOREM ALEXANDRU ALEMAN 1. Motivation and statement We want to understand a general situation wic occurs in almost any area wic uses matematics. Suppose we are given number of equations
More informationFinding and Using Derivative The shortcuts
Calculus 1 Lia Vas Finding and Using Derivative Te sortcuts We ave seen tat te formula f f(x+) f(x) (x) = lim 0 is manageable for relatively simple functions like a linear or quadratic. For more complex
More informationWYSE Academic Challenge 2004 Sectional Mathematics Solution Set
WYSE Academic Callenge 00 Sectional Matematics Solution Set. Answer: B. Since te equation can be written in te form x + y, we ave a major 5 semi-axis of lengt 5 and minor semi-axis of lengt. Tis means
More information232 Calculus and Structures
3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE
More information1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)
Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of
More informationNotes on wavefunctions II: momentum wavefunctions
Notes on wavefunctions II: momentum wavefunctions and uncertainty Te state of a particle at any time is described by a wavefunction ψ(x). Tese wavefunction must cange wit time, since we know tat particles
More information2011 Fermat Contest (Grade 11)
Te CENTRE for EDUCATION in MATHEMATICS and COMPUTING 011 Fermat Contest (Grade 11) Tursday, February 4, 011 Solutions 010 Centre for Education in Matematics and Computing 011 Fermat Contest Solutions Page
More informationSolutions to the Multivariable Calculus and Linear Algebra problems on the Comprehensive Examination of January 31, 2014
Solutions to te Multivariable Calculus and Linear Algebra problems on te Compreensive Examination of January 3, 24 Tere are 9 problems ( points eac, totaling 9 points) on tis portion of te examination.
More informationChapters 19 & 20 Heat and the First Law of Thermodynamics
Capters 19 & 20 Heat and te First Law of Termodynamics Te Zerot Law of Termodynamics Te First Law of Termodynamics Termal Processes Te Second Law of Termodynamics Heat Engines and te Carnot Cycle Refrigerators,
More informationClick here to see an animation of the derivative
Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,
More informationContinuity and Differentiability of the Trigonometric Functions
[Te basis for te following work will be te definition of te trigonometric functions as ratios of te sides of a triangle inscribed in a circle; in particular, te sine of an angle will be defined to be te
More information1 Lecture 13: The derivative as a function.
1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple
More informationGradient Descent etc.
1 Gradient Descent etc EE 13: Networked estimation and control Prof Kan) I DERIVATIVE Consider f : R R x fx) Te derivative is defined as d fx) = lim dx fx + ) fx) Te cain rule states tat if d d f gx) )
More informationThe derivative function
Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Te derivative function Wat you need to know already: f is at a point on its grap and ow to compute it. Wat te derivative
More informationRegularized Regression
Regularized Regression David M. Blei Columbia University December 5, 205 Modern regression problems are ig dimensional, wic means tat te number of covariates p is large. In practice statisticians regularize
More informationParameter Fitted Scheme for Singularly Perturbed Delay Differential Equations
International Journal of Applied Science and Engineering 2013. 11, 4: 361-373 Parameter Fitted Sceme for Singularly Perturbed Delay Differential Equations Awoke Andargiea* and Y. N. Reddyb a b Department
More informationThe Cardinality of Sumsets: Different Summands
Te Cardinality of Sumsets: Different Summands Brendan Murpy, Eyvindur Ari Palsson and Giorgis Petridis arxiv:1309.2191v3 [mat.co] 17 Feb 2017 Abstract We offer a compete answer to te following question
More information5.1 We will begin this section with the definition of a rational expression. We
Basic Properties and Reducing to Lowest Terms 5.1 We will begin tis section wit te definition of a rational epression. We will ten state te two basic properties associated wit rational epressions and go
More informationAverage Rate of Change
Te Derivative Tis can be tougt of as an attempt to draw a parallel (pysically and metaporically) between a line and a curve, applying te concept of slope to someting tat isn't actually straigt. Te slope
More informationUnilateral substitutability implies substitutable completability in many-to-one matching with contracts
Unilateral substitutability implies substitutable completability in many-to-one matcing wit contracts Sangram Vilasrao Kadam April 6, 2015 Abstract We prove tat te unilateral substitutability property
More informationPreface. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my course tat I teac ere at Lamar University. Despite te fact tat tese are my class notes, tey sould be accessible to anyone wanting to learn or needing a refreser
More informationA SHORT INTRODUCTION TO BANACH LATTICES AND
CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,
More informationALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU. A. Fundamental identities Throughout this section, a and b denotes arbitrary real numbers.
ALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU A. Fundamental identities Trougout tis section, a and b denotes arbitrary real numbers. i) Square of a sum: (a+b) =a +ab+b ii) Square of a difference: (a-b)
More informationNumerical Differentiation
Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function
More informationSome Review Problems for First Midterm Mathematics 1300, Calculus 1
Some Review Problems for First Midterm Matematics 00, Calculus. Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd,
More informationTermination Problems in Chemical Kinetics
Termination Problems in Cemical Kinetics Gianluigi Zavattaro and Luca Cardelli 2 Dip. Scienze dell Informazione, Università di Bologna, Italy 2 Microsoft Researc, Cambridge, UK Abstract. We consider nondeterministic
More information(a) At what number x = a does f have a removable discontinuity? What value f(a) should be assigned to f at x = a in order to make f continuous at a?
Solutions to Test 1 Fall 016 1pt 1. Te grap of a function f(x) is sown at rigt below. Part I. State te value of eac limit. If a limit is infinite, state weter it is or. If a limit does not exist (but is
More informationUniversity Mathematics 2
University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at
More informationExponentials and Logarithms Review Part 2: Exponentials
Eponentials and Logaritms Review Part : Eponentials Notice te difference etween te functions: g( ) and f ( ) In te function g( ), te variale is te ase and te eponent is a constant. Tis is called a power
More informationApproximation of the Viability Kernel
Approximation of te Viability Kernel Patrick Saint-Pierre CEREMADE, Université Paris-Daupine Place du Marécal de Lattre de Tassigny 75775 Paris cedex 16 26 october 1990 Abstract We study recursive inclusions
More informationRelations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
Discrete Applied Matematics 156 (2008) 1809 1821 www.elsevier.com/locate/dam Relations between Clar structures, Clar covers, and te sextet-rotation tree of a exagonal system San Zou a, Heping Zang a,,
More informationQuantum Mechanics Chapter 1.5: An illustration using measurements of particle spin.
I Introduction. Quantum Mecanics Capter.5: An illustration using measurements of particle spin. Quantum mecanics is a teory of pysics tat as been very successful in explaining and predicting many pysical
More informationConsider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.
Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions
More informationChapter 2 Limits and Continuity
4 Section. Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 6) Quick Review.. f () ( ) () 4 0. f () 4( ) 4. f () sin sin 0 4. f (). 4 4 4 6. c c c 7. 8. c d d c d d c d c 9. 8 ( )(
More informationMath Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim
Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z
More informationINTRODUCTION AND MATHEMATICAL CONCEPTS
INTODUCTION ND MTHEMTICL CONCEPTS PEVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips of sine,
More informationWHEN GENERALIZED SUMSETS ARE DIFFERENCE DOMINATED
WHEN GENERALIZED SUMSETS ARE DIFFERENCE DOMINATED VIRGINIA HOGAN AND STEVEN J. MILLER Abstract. We study te relationsip between te number of minus signs in a generalized sumset, A + + A A, and its cardinality;
More informationMath 31A Discussion Notes Week 4 October 20 and October 22, 2015
Mat 3A Discussion Notes Week 4 October 20 and October 22, 205 To prepare for te first midterm, we ll spend tis week working eamples resembling te various problems you ve seen so far tis term. In tese notes
More information3.1 Extreme Values of a Function
.1 Etreme Values of a Function Section.1 Notes Page 1 One application of te derivative is finding minimum and maimum values off a grap. In precalculus we were only able to do tis wit quadratics by find
More informationOSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS. Sandra Pinelas and Julio G. Dix
Opuscula Mat. 37, no. 6 (2017), 887 898 ttp://dx.doi.org/10.7494/opmat.2017.37.6.887 Opuscula Matematica OSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS Sandra
More information2.3 Product and Quotient Rules
.3. PRODUCT AND QUOTIENT RULES 75.3 Product and Quotient Rules.3.1 Product rule Suppose tat f and g are two di erentiable functions. Ten ( g (x)) 0 = f 0 (x) g (x) + g 0 (x) See.3.5 on page 77 for a proof.
More informationSolving Continuous Linear Least-Squares Problems by Iterated Projection
Solving Continuous Linear Least-Squares Problems by Iterated Projection by Ral Juengling Department o Computer Science, Portland State University PO Box 75 Portland, OR 977 USA Email: juenglin@cs.pdx.edu
More information1 1. Rationalize the denominator and fully simplify the radical expression 3 3. Solution: = 1 = 3 3 = 2
MTH - Spring 04 Exam Review (Solutions) Exam : February 5t 6:00-7:0 Tis exam review contains questions similar to tose you sould expect to see on Exam. Te questions included in tis review, owever, are
More informationMath 1210 Midterm 1 January 31st, 2014
Mat 110 Midterm 1 January 1st, 01 Tis exam consists of sections, A and B. Section A is conceptual, wereas section B is more computational. Te value of every question is indicated at te beginning of it.
More informationIntroduction to Derivatives
Introduction to Derivatives 5-Minute Review: Instantaneous Rates and Tangent Slope Recall te analogy tat we developed earlier First we saw tat te secant slope of te line troug te two points (a, f (a))
More informationCS522 - Partial Di erential Equations
CS5 - Partial Di erential Equations Tibor Jánosi April 5, 5 Numerical Di erentiation In principle, di erentiation is a simple operation. Indeed, given a function speci ed as a closed-form formula, its
More information2.3 Algebraic approach to limits
CHAPTER 2. LIMITS 32 2.3 Algebraic approac to its Now we start to learn ow to find its algebraically. Tis starts wit te simplest possible its, and ten builds tese up to more complicated examples. Fact.
More information