Combinatorial Dimension in Fractional Cartesian Products
|
|
- Tobias Morris
- 5 years ago
- Views:
Transcription
1 Combinatorial Dimension in Fractional Cartesian Products Ron Blei, 1 Fuchang Gao 1 Department of Mathematics, University of Connecticut, Storrs, Connecticut 0668; blei@math.uconn.edu Department of Mathematics, University of Idaho, Moscow, Idaho ; fuchang@uidaho.edu Received 3 September 00; revised 18 December 003; accepted 5 July 004 DOI /rsa.0058 Published online 9 November 004 in Wiley InterScience ( ABSTRACT: The combinatorial dimension relative to an arbitrary fractional Cartesian product is defined. Relations between dimensions in certain archetypal instances are derived. Random sets with arbitrarily prescribed dimensions are produced; in particular, scales of combinatorial dimension are shown to be continuously and independently calibrated. A combinatorial concept of cylindricity is key. 004 Wiley Periodicals, Inc. Random Struct. Alg., 6, , DEFINITIONS, STATEMENT OF PROBLEM The idea of a fractional Cartesian product and a subsequent measurement of combinatorial dimension appeared first in a harmonic-analytic context in the course of filling analytic gaps between successive (ordinary) Cartesian products of spectral sets [, 3]. (Detailed accounts of this, and much more, appear in [5].) Succinctly put, combinatorial dimension is an index of interdependence. Attached to a subset of an ordinary Cartesian product, it gauges precisely the interdependence of restrictions to the set, of the canonical projections from the Cartesian product onto its independent coordinates. We can analogously gauge the interdependence of restrictions to the same set, of projections from the Cartesian product onto interdependent coordinates of a prescribed fractional Cartesian product. We thus obtain distinct indices of interpendences associated, respectively, with distinct fractional Cartesian products. A question naturally arises: What are the relationships between these various indices? Correspondence to: R. Blei 004 Wiley Periodicals, Inc. 146
2 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 147 To make matters precise, we first recall, and then extend basic notions found in Chapters XII and XIII of [5]. Let E 1,..., E n be sets, and let F E 1 E n.(we refer to E 1 E n as the ambient product of F.) For integers s > 0 define F (s) = max{ F (A 1 A n : A i E i, A i s, i [n]}, (1) where [n] ={1,..., n}.fora > 0, define The combinatorial dimension of F is d F (a) = sup{ F (s)/s a : s = 1,,...}. () dim F = sup{a : d F (a) = }=inf{a : d F (a) < }. (3) Next we define the fractional Cartesian products. For S [n], let π S denote the canonical projection from E 1 E n onto the product whose coordinates are indexed by S, π S ( y) = ( y i : i S), y = ( y 1,..., y n ) E 1 E n. Let U = (S 1,..., S m ) beacoverof[n] (i.e., S 1 [n],..., S m [n], and m j=1 S j =[n]), and define a fractional Cartesian products based on Utobe (E 1 E n ) U ={(π S1 (y),..., π S m(y)) :y E 1 E n }. We view (E 1 E n ) U as a subset of E S 1 E Sm, and measure its combinatorial dimension by solving a linear programming problem ([4, 8]): If E 1,..., E n, are infinite sets, and n α U = max x i : x i 0, x i 1 for j [m], i=1 i S j then dim(e 1 E n ) U = α U. (4) Examples 1. (Maximal and minimal fractional Cartesian products) For integers 1 k n, let U be a cover that is an enumeration of all k-subsets of [n], and let V be a cover of [n], all of whose elements are k-subsets of [n] such that, for every i [n], {S V:i S} = k. Then, α U = α V = n/k, and (taking E 1 = =E n = N) we obtain from (4) dim(n n ) U = dim(n n ) V = n k. The ambient product of (N n ) U is ( n k) -dimensional, and the ambient product of (N n ) V is n-dimensional. Generally, if k and n are relatively prime, then the dimension of the ambient product of any n -dimensional fractional Cartesian product is at least n, and k no greater than ( n k).. (Random constructions) Fractional Cartesian product are subsets of ambient products typically of high dimension. To wit, there are no nontrivial fractional Cartesian product in N, whereas for arbitrary α (1, ) there exists an abundance of random sets F N with dimf = α [6,7]. How to produce deterministically F N with dimf = α, where α (1, ) is arbitrary, is an open problem.
3 148 BLEI AND GAO 3. (An application) From α U = 3/ in the archetypal case n = 3, U = ({1, }, {, 3}, {1, 3}), we obtain that that the number of triangles formed from s given edges in a graph is less than s 3. More generally, following a canonical identification of a complex on n vertices with a cover U of [n], we obtain from (4) that the number of complexes formed from s given simplices is bounded by s α U. These results are closely related to the Kruskal-Katona Theorem (drawn to our attention by Joel Spencer); see [10, 9]. Definition 1. For F E 1 E n, and a cover U = (S 1,..., S m ) of [n], let F U ={(π S1 ( y),..., π S m( y)) : y F}, and write dim U F = dim F U. (5) We consider dim U as a gauge of interdependence of π S1 F,..., π S m F (projections π Si restricted to F). By (4), for infinite F, 1 dim U F α U. (6) We continue to write dim F in the extremal case U = ({1},..., {n}). Problem. Let E 1,..., E n be infinite sets, and let U be a cover of [n]. For F E E n, what are the relations between dim F and dim U F? In this article we analyze the first nontrivial case: n = 3, and U = (S 1, S, S 3 ), where S 1 ={1, }, S ={, 3}, S 3 ={1, 3}. Throughout, for convenience (and with no loss of generality), we take E 1 = E = E 3 = N.. GENERAL BOUNDS Theorem 3. If F N 3 and dim F, then dim F dim U F dim F dim F + 1. (7) We will prove the right-side inequality in (7) (the nontrivial part of the theorem) by the use of Littlewood-type inequalities in fractional dimensions. Let E 1,..., E d be sets. Consider scalar d-tensors on E 1 E d with finite support b = (b x :x= (x 1,..., x d ) E 1 E d ), and define (the d-fold injective tensor-norm of b) b d = b x r x1 r xd, (8) x E 1 E d
4 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 149 where r x1,..., r xd are Rademacher functions indexed by E 1,..., E d, whose respective domains are { 1, 1} E 1,...,{ 1, 1} E d (e.g., p. 19 in [5]). For F E 1 E d, and t 1, define ζ F (t) = sup 1/l b x l : b d 1. (9) x=(x 1,...,x d ) F The relation between the harmonic-analytic measurement ζ F and the combinatorial measurement d F is ( ) t ζ F (t) < d F <, t [1, ). (10) t (See Th. XIII.0 in [5].) To prepare for an application of (10), we define b U = b ijk r ij r jk r ik, (11) for b = (b ijk : (i, j, k) N 3 ) with finite support. We observe i,j,k 1 (N 3 ) U (i 1, i, i 3, i 4, i 5, i 6 ) = Er i1 (ω 1 )r i (ω )r i3 (ω )r i4 (ω 3 )r i5 (ω 1 )r i6 (ω 3 ), where 1 denotes indicator function, and E denotes expectation over ω 1, ω, ω 3. From this we deduce (an instance of Corollary XIII.7 in [5]) Lemma 4. and If b = ( b i :i N N N ) is a real-valued 3-tensor with finite support, b j = b πs1 ( j)π S ( j)π S3 ( j), j N 3, then b U b 3. (1) We require also a decomposition property, which follows from Lemma XIII.1 in [5]: if ϕ l (N n ), and 1 c n (ϕ) = sup ϕ(i) : s N, A v N, A v =s, v [n] s, i A 1 An then there exists a partition {Q 1,..., Q n } of N n such that, for v [n], ϕ(i) 1 Q v(i) c n (ϕ), sup k N i πv 1 {k} where π v is the vth canonical projection from N n onto N. Lemma 5. If ϕ l (N n ) is supported in F N n, then there exists a partition {Q 1,..., Q n } of N n such that for v [n], and p 1, ϕ(i) 1 Q v(i) d F (p) 1/p ϕ q, (13) where 1 p + 1 q = 1. sup k N i πv 1 {k}
5 150 BLEI AND GAO Proof. For S N, and s-sets A v N (i.e. A v =s), v [n], we estimate (by Hölder s inequality) 1 s i A 1 An ϕ(i) 1 s F (A 1 A n ) 1/p ϕ q. Then c n (ϕ) d F (p) 1/p ϕ p, and the lemma follows from the decomposition property above. Lemma 6. If F N 3,a, and d F (a) <, then ( ) 4a ζ FU <. (14) 3a + 1 Proof. Following Lemma 4 and the definition of ζ FU (a), we need to verify that if b = (b ijk : (i, j, k) N 3 ) is a scalar 3-tensor with finite support, and b U 1, then b ijk 4a/(3a+1) K, (i,j,k) F where K depends only on F and a. To this end we use duality, and the fractional mixed norm inequalities ( ) 1/ b ijk λ, i,j k i,k ( ) 1/ b ijk λ, j j,k ( ) 1/ b ijk λ, (15) i where λ>1is an absolute constant; see Lemma XII.1 in [5]. Suppose θ is an element in the unit ball of l a 1 4a (N 3 ), and that θ is supported in F. Apply Lemma 5 with p = a and ϕ = θ 4, thus obtaining a partition {Q 1, Q, Q 3 } of N 3, such that, for v = 1,, 3, θ(i) 4 1 Q v(i) d F (a) 1/a. sup l N i πv 1 {l} For l N, and v = 1,, 3, let F lv = F Q v π 1 v {l}. For convenience, designate T 1 = {, 3}, T ={1, 3}, T 3 ={1, }. For each l and v, apply Lemma 5 with p =, F = F lv (viewed as a subset of N ), and ϕ = θ 1 Flv (viewed as a function on N ), thus obtaining partitions {P l1v, P lv } of F lv, such that sup l N,i N j N sup l N,i N i N (( θ 1 Pl1v ) π T v)(i, j) d F (a) 1/a, (( θ 1 Plv ) π T v)(i, j) d F (a) 1/a. (16) (In applying here Lemma 5, we used d Flv () 1.) For u = 1,, and v = 1,, 3, let P uv = l N P luv,
6 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 151 and then write b i θ(i) = i N 3 b i θ(i) 1 P uv(i). (17) j N3 u {1,},v {1,,3} By applying to each of the six sums on the right side of (17) the mixed-norm inequalities (15), together with (16) (via Cauchy-Schwarz and Hölder), we obtain b i θ(i) i N 3 6λd F(a) 1/4a. Therefore (by duality and definition of ζ FU ), ( ) 4a ζ FU 3a + 1 6λd F (a) 1/4a. Proof of Theorem 3. Let A, B, C be arbitrary s-subsets of N. Then FU (s ) F U (A B) (B C) (A C) = F (A B C). Maximizing over A, B, C we obtain FU (s ) F (s), which implies ( a ) d FU d F (a), a > 0, and hence the left inequality in (7). ( If a > dim F, then d F (a) <. By Lemma 6, ζ 4a ) ( FU 3a+1 <. By (10), a dfu a+1) <, which implies dim F U a, and hence the right-side inequality in (7). a+1 3. CYLINDRICAL SETS For F N 3, v = 1,, 3, and k N, let Also, for E N and k N, we denote F v (k) = π 1 v {k} F. E 1,k ={(j : (j, k) E}, E,k ={(j : (k, j) E}. Definition 7. F N 3 is cylindrical in direction v (v = 1,, 3) if for all a d F (a) < sup{d F v(k)(a 1) : k N} <.
7 15 BLEI AND GAO F is cylindrical if it is cylindrical in at least one direction, and doubly-cylindrical if it is cylindrical in at least two directions. We say F N 3 is a cylinder if F = E H for E N (base) and H N (height). For such F, dim F = dim E + dim H. Note also that cylinders are obviously cylindrical, but cylindrical sets need not be cylinders. Theorem 8. (i) If F N 3 is cylindrical with dim F, then dim F dim U F 1 dim F 1. (18) (ii) If F N 3 is a cylinder with infinite base and infinite height, then 1 dim U F = dim F 1. (19) (iii) If F N 3 is doubly-cylindrical with dim F, then dim U F = dim F. (0) Proof. (i) The left inequality always holds (Theorem 3). We proceed to verify the inequality on the right, under the assumption that F is cylindrical in direction 3. Suppose a > dim F, and sup d F3 (k)(a 1) K <. (1) k N Let A, B, C be arbitrary s-subsets of N, and define H ={k : max{ B 1,k, C 1,k } s 1/(a 1) }. Then, H s (a )/(a 1), and 1 F (i, j, k)1 A (i, j)1 B (j, k)1 C (i, k) A s (a 3)/(a 1). () k H i,j k H From (1) we obtain 1 F (i, j, k)1 A (i, j)1 B (j, k)1 C (i, k) k / H i,j k / H k / H 1 F (i, j, k)1 B (j, k)1 C (i, k) i,j Ks a a 1 d F3 (k)(a 1) max{ B 1,k a 1, C 1,k a 1 } ( B 1,k + C 1,k ) k / H Ks a 3 a 1.
8 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 153 Combining this with (), we obtain F U (A B C) = i,j,k 1 F (i, j, k)1 A (i, j)1 B (j, k)1 C (i, k) s (a 3)/(a 1) + Ks (a 3)/(a 1). Therefore, FU (s) ( + K)s (a 3)/(a 1), which implies dim U F 1 a 1, and hence the right-side inequality in (18). (ii) We can assume F = E N with dim E > 1, and proceed to verify dim U F 1/(dim F 1). Fix 1 < a < dim E. Then, for arbitrarily large positive integers s, there exist s-sets A 1 N, A N, such that E (A 1 A ) =Ms a, and M > 0 is a large as we please. Let A = E (A 1 A ), B = A 1 [m], and C = A [m], where m is the integer satisfying m 1 < s a 1 m. Then, F U (A B C) = A m Ms a 1. Therefore, ψ FU (Ms a ) Ms a 1, which implies d FU ( 1 ) =, and hence the desired a conclusion. (iii) For v = 1,, we assume (F cylindrical in directions 1 and ), and proceed to show sup d F v(k)(a 1) K < (3) k N dim U F dim F. (4) Fix a > dim F, and let A, B, C be arbitrary s-subsets of N. We decompose A into two disjoint sets G and H, such that max i G 1,i s and max i H,i s (e.g., G = i {A,i : A,i > s}, H = i {A,i : A,i s}). We write F U (A B C) = F U (H B C) + F U (G B C), (5) and rewrite the first term on the right side of (5) as F U (H B C) = i,j,k 1 H (i, j)1 B (j, k)1 C (i, k)1 F (i, j, k) = i 1 H,i (j)1 B,i (k)1 C (j, k)1 F (i, j, k). (6) j,k
9 154 BLEI AND GAO Let D ={i : B,i H,i }. By applying (3) in the case v = 1, we estimate 1 H,i (j)1 B,i (k)1 C (j, k)1 F (i, j, k) 1 H,i (j)1 B,i (k)1 F (i, j, k) i D i D j,k j,k K H,i a 1. (7) i D For i / D, let m i be the largest integer such that m i B,i + 1, (8) H,i and decompose B,i into pairwise disjoint sets E 1,..., E mi such that E u H,i for u [m i ]. By applying (3) and (8), we estimate 1 H,i (j)1 B,i (k)1 C (j, k)1 F (i, j, k) m i 1 H,i (j)1 E u(k)1 F (i, j, k) i/ D i/ D j,k K i/ D u=1 j,k B,i H,i a + H,i a 1. Combining with (7), and then using H,i s, i B,i =s, i H,i s, we conclude that ( F U (H B C) Ks (a )/ H,i + ) B,i + H,i i D i D c Ks a/. By a similar argument (based on (3) in the case v = ), we obtain an identical estimate for the second term on the right side of (5). Combining the two estimates, we deduce F U (A B C) 4Ks a/. Therefore, d FU ( a ) 4K, which implies (4). 4. RANDOM CONSTRUCTIONS Next we produce random sets (cf. [6,7]), demonstrating that the dim-scale and the dim U - scale implied by Theorem 7 are continuous, and are independently calibrated: Theorem 9. (i) For all x [, 3] and y [ x, x 3 x 1 ], there exist cylindrical sets F N3 with dim F = x and dim U F = y. (ii) For all x [, 3], there exist doubly-cylindrical sets F N 3 with dim F = x and (hence) dim U F = x. The proof uses random constructions based on the following instance of the Prokhorov- Bennett probabilistic inequalities (e.g., [1]):
10 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 155 Lemma 10. If (X i : i N) is a sequence of (statistically) independent {0, 1}-valued random variables with mean δ, then, for all n N, ( ) n ( ) t P X i nδ > t exp, t (0, nδ), (9) 8nδ i=1 ( ) n ( P X i nδ > t exp t ( )) t 4 log, t nδ. (30) nδ i=1 In what follows below we use the notation A K m to mean m/k A Km. Lemma 11. For every α (1, ) there is n 0 (α) = n 0 > 0, so that for every N n 0 there exists E [N] such that, for u = 1,, and for all s-sets A [N], B [N], E u,i N α 1 for all 1 i N, (31) E (A B) 5s α. (3) Proof. Fix N 1, and let {X ij : (i, j) [N] } be a system of independent {0, 1}-valued random variables with mean N α. Consider the random set E ={(i, j) : X ij = 1}. The probability that E fails to satisfy (31) is no larger than ( ) ( ) N N P X ij N α 1 > N α 1 N N + P X ij N α 1 > N α 1, i=1 i=1 which, following (9), is no larger than 1/3 for all N n 0 for sufficiently large n 0. Also, the probability that E fails to satisfy (3) is no larger than N P X ij s N α > 4s α, s=1 A =s, B =s which, following (30), is no larger than s=1 (i,j) A B j=1 j=1 N ( ) ( N N exp( ( α)s α log s s )) < 1 3 for all N n 0 for sufficiently large n 0. We thus conclude that E satisfies the requirements of the lemma with probability at least 1/3. Lemma 1. For every α (1, ) and every β [0, α, 1) there is n 0 (α, β) = n 0 > 0, so that for every N n 0 there exists F [N] 3 satisfying the following: (i) There exists E [N] with E N α, such that, for all k [N], {(i, j) : (i, j, k) F, (i, j) E} 4 N α β ; (33)
11 156 BLEI AND GAO (ii) for all s-sets A [N] and B [N], and for all k [N], F (A B {k}) 5s α β, (34) (iii) For all s-sets S [N] [N], and for all C [N] with C s 1 1/α, F (S C) 5s 1/α β/α. (35) Proof. Choose E as in Lemma 11. If β = 0, then we simply let F = E [N]. For β (0, α 1), let {X ijk : (i, j) E,1 k N} be a system of independent {0, 1}-valued random variables with mean N β. Then, by argument similar to the one used to prove Lemma 11, we conclude that F ={(i, j, k) : X ijk = 1} satisfies the requirements of the lemma with positive probability. Proof of Theorem 9. (i) For x =, take F = N {1}, and for x = 3, take F = N 3.For x (, 3), let α = x and β = α + 1 x. Then, 1 <α, and 0 β<α 1. Let y 1 n 0 = n 0 (α, β) be as in Lemma 11, and for each integer n such that 3 n n 0, let F n be the set F obtained from Lemma 11 for N = 3 n. Define F = Claim 1: dim F = x. For all s-sets A N, B N, C N, where F (A B C) = n=n 0 {(3 n,3 n,3 n ) + F n }. ((3 n,3 n,3 n ) + F n ) (A B C) n=n 0 = F n ((A 3 n ) (B 3 n ) (C 3 n )) n=n 0 n=n 0 5s x n, s n = max{ (A 3 n ) [3 n ], (B 3 n ) [3 n ], (C 3 n ) [3 n ] }, and the inequality follows from (34). Note that x s x n s n n=n 0 n=n 0 ( A (3 n +[3 n ]) + B (3 n +[3 n ]) + C (3 n +[3 n ]) ) n=n 0 ( A + B + C ) x = 3 x s x. x
12 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 157 We thus conclude that F (s) 5 3 x s x. (36) On the other hand, choosing A = B = C = 3 n +[3 n ], we obtain from (33) F (A B C) = (3 n,3 n,3 n ) + F n = F n 1 4 (3n ) α β+1 = 1 4 (3n ) x. Therefore, F (3 n ) 1 4 (3n ) x, which together with (36), implies dim F = x. Claim : dim U F = y. We let A N, B N, C N be s-sets, and estimate F U (A B C). To this end, let H ={k : B 1,k > s 1/α or C, k > s 1/α }. Then, H s 1 1/α (because ( B 1,k + C,k ) = B + C =s). We note that F U (A B C) is less than or equal to F (C,k B 1,k {k}) + F (A {k}). (37) k / H k H To estimate the first sum in (37), we observe that for every k N, F (C,k B 1,k {k}) = ((3 l,3 l,3 l ) + F l ) (C,k B 1,k {k}), where 3 l k < 3 l+1. By (34), ((3 l,3 l,3 l ) + F l ) (C,k B 1,k {k}) = F l ((C,k 3 l ) (B 1,k 3 l ) (3{k} 3 l )) 5(max{ B 1,k, C,k }) α β. Therefore, F (C,k B 1,k {k}) 5(max{ B 1,k, C,k }) α β k / H k / H To estimate the second sum in (37), denote 5 k / H (max{ B 1,k, C,k })(s 1/α ) α β 1 5 s s 1 (1+β)/α = 50s (1+β)/α. (38) A (l) = A ((3 l,3 l ) +[3 l ] [3 l ]), H (l) = H (3 l +[3 t ]). Then F (A {k}) = k H = (3 l,3 l,3 l ) + F l (A (l) H (l) ) l=1 F l ((A (l) (3 l,3 l )) (H (l) 3 l )). (39) l=1
13 158 BLEI AND GAO By (35), each summand in (39) is bounded by { 5 A (l) (1/α) (β/α) if H (l) A (l) 1 1/α, 5 H (l) ( (1/α) (β/α))/(1 1/α) if H (l) > A (l) 1 1/α. Therefore, F (A {k}) k H 5 A (l) (1/α) (β/α) + 5 H (l) ( (1/α) (β/α))/(1 1/α) l=1 l=1 ( (1/α) (β/α) ( 5 A ) (l) + 5 A (l) l=1 l=1 5 A (1/α) (β/α) + 5 H ( (1/α) (β/α))/(1 1/α) ) ( (1/α) (β/α))/(1 1/α) 5(1 + α/(α 1) )s (1/α) (β/α), (40) where the last inequality holds because H s 1 1α. By combining (37), (38), and (40), we conclude that FU (s) (50 + 5(1 + α/(α 1) ))s 1/α β/α = 5(11 + α/(α 1) )s y, (41) which implies dim U F y. To obtain the opposite inequality, for n > n 0, let m be the integer such that m 1 < (3 n ) α 1 m. Let A = (3 n,3 n ) + E n, where E n = E is obtained from Lemma 1(i) for N = 3 n, and let B = (3 n,3 n ) +[3 n ] m and C = (3 n,3 n ) +[m] [3 n ]. Then A 3 αn, and B = C < 3 αn + 3 n. Applying (33), we obtain F U (A B C) = {(i, j, k) (3 n,3 n,3 n ) + F n : (i, j) A, (j, k) B, (k, i) C} = {(i, j, k) F n : (i, j) E n, k [m]} 4 (3 n ) α β m 1 4 (3αn ) y. Therefore, FU ( 3 αn ) 1 4 (3αn ) y, which implies dim U F y. Claim 3: F is cylindrical. We have shown that dim U F = α β + 1. For every k N, π 1 3 {k} F = only if 3 l k 3 l, in which case π 1 3 {k} F = π 1 3 {k} ((3 l,3 l,3 l ) + F l ) = (3 l,3 l,3 l ) + π 1 3 {k 3 l } F l. By (34), d π 1 (α β) 5 for all 1 k 3 {k} F 3 l 3l. Therefore, d π 1 3 {k} F(α β) 5 for all k N, and hence F is cylindrical in direction 3. (ii) The construction of (random) doubly-cylindrical sets with the desired dimension follows a blueprint similar to the one followed in (i). Indeed, if x (, 3), then for all N n 0 for sufficiently large n 0, by using independent {0, 1}-valued random variables with
14 COMBINATORIAL DIMENSION IN FRACTIONAL CARTESIAN PRODUCTS 159 a prescribed mean, we can produce (random sets) F N [N] 3 with the following properties: (a) for every positive integer s N, s-subsets A and B of [N], and every l [N], F N (A B {l}) s x 1, F N (A {l} B) s x 1, F N ({l} A B) s x 1 ; (b) for every l [N], F N ([N] {l} N x 1, F N ([N] {l} [N] N x 1, F N ({l} [N] N x 1. Then, F = n=n 0 (F 3 n + (3 n,3 n,3 n )) is cylindrical in each of the three directions, and dim F = x/. The verification is similar to the proof given in (i), and is omitted. REFERENCES [1] G. Bennett, Probability inequalities for sums of independent random variables, J Amer Statist Assoc 57 (196), [] R. Blei, Fractional Cartesian products of sets, Ann Inst Fourier, (Grenoble) 9 (1973), [3] R. Blei, Combinatorial dimension and certain norms in harmonic analysis, Amer J Math 106 (1984), [4] R. Blei, Fractional dimension and bounded fractional forms, Mem Amer Math Soc 57 (1985), [5] R. Blei, Analysis in integer and fractional dimensions, Cambridge University Press, Cambridge, 001. [6] R. Blei and T. W. Körner, Combiantorial dimension and random sets, Israel J Math, 47 (1984), [7] R. Blei, Y. Peres, and J. Schmerl, Fractional products of sets, Random Structures Algorithms 6 (1995), [8] R. Blei, and J. Schmerl, Combinatorial dimension of fractional Cartesian products, Proc Amer Math Soc 10 (1994), [9] G. Katona, External problems for hypergraphs, Combinatorics, J. H. Lint and M. Hall, Volume, Math Centrum, Amsterdam, [10] J. B. Kruskal, The number of simplices in a complex, Mathematical Optimization Techniques, University of California Press, Berkeley, 1963.
COMBINATORIAL DIMENSION OF FRACTIONAL CARTESIAN PRODUCTS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 120, Number 1, January 1994 COMBINATORIAL DIMENSION OF FRACTIONAL CARTESIAN PRODUCTS RON C. BLEI AND JAMES H. SCHMERL (Communicated by Jeffry N.
More informationColoring Uniform Hypergraphs with Few Colors*
Coloring Uniform Hypergraphs with Few Colors* Alexandr Kostochka 1,2 1 University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; e-mail: kostochk@mathuiucedu 2 Institute of Mathematics, Novosibirsk
More informationSum and shifted-product subsets of product-sets over finite rings
Sum and shifted-product subsets of product-sets over finite rings Le Anh Vinh University of Education Vietnam National University, Hanoi vinhla@vnu.edu.vn Submitted: Jan 6, 2012; Accepted: May 25, 2012;
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationBoundedly complete weak-cauchy basic sequences in Banach spaces with the PCP
Journal of Functional Analysis 253 (2007) 772 781 www.elsevier.com/locate/jfa Note Boundedly complete weak-cauchy basic sequences in Banach spaces with the PCP Haskell Rosenthal Department of Mathematics,
More informationPACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION
PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION DAVAR KHOSHNEVISAN AND YIMIN XIAO Abstract. In order to compute the packing dimension of orthogonal projections Falconer and Howroyd 997) introduced
More informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationPacking-Dimension Profiles and Fractional Brownian Motion
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 Packing-Dimension Profiles and Fractional Brownian Motion By DAVAR KHOSHNEVISAN Department of Mathematics, 155 S. 1400 E., JWB 233,
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationON MATCHINGS IN GROUPS
ON MATCHINGS IN GROUPS JOZSEF LOSONCZY Abstract. A matching property conceived for lattices is examined in the context of an arbitrary abelian group. The Dyson e-transform and the Cauchy Davenport inequality
More informationA DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A DECOMPOSITION THEOREM FOR FRAMES AND THE FEICHTINGER CONJECTURE PETER G. CASAZZA, GITTA KUTYNIOK,
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationPCA with random noise. Van Ha Vu. Department of Mathematics Yale University
PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationJordan Journal of Mathematics and Statistics (JJMS) 8(3), 2015, pp THE NORM OF CERTAIN MATRIX OPERATORS ON NEW DIFFERENCE SEQUENCE SPACES
Jordan Journal of Mathematics and Statistics (JJMS) 8(3), 2015, pp 223-237 THE NORM OF CERTAIN MATRIX OPERATORS ON NEW DIFFERENCE SEQUENCE SPACES H. ROOPAEI (1) AND D. FOROUTANNIA (2) Abstract. The purpose
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationKrzysztof Burdzy University of Washington. = X(Y (t)), t 0}
VARIATION OF ITERATED BROWNIAN MOTION Krzysztof Burdzy University of Washington 1. Introduction and main results. Suppose that X 1, X 2 and Y are independent standard Brownian motions starting from 0 and
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationSINGULAR MEASURES WITH ABSOLUTELY CONTINUOUS CONVOLUTION SQUARES ON LOCALLY COMPACT GROUPS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 10, Pages 2865 2869 S 0002-9939(99)04827-3 Article electronically published on April 23, 1999 SINGULAR MEASURES WITH ABSOLUTELY CONTINUOUS
More informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
More informationMathematics Department Stanford University Math 61CM/DM Inner products
Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector
More informationThe Measure Problem. Louis de Branges Department of Mathematics Purdue University West Lafayette, IN , USA
The Measure Problem Louis de Branges Department of Mathematics Purdue University West Lafayette, IN 47907-2067, USA A problem of Banach is to determine the structure of a nonnegative (countably additive)
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationA Kruskal-Katona Type Theorem for the Linear Lattice
A Kruskal-Katona Type Theorem for the Linear Lattice Sergei Bezrukov Department of Mathematics and Computer Science University of Paderborn Fürstenallee 11 D-33102 Paderborn, Germany Aart Blokhuis Department
More informationInjective semigroup-algebras
Injective semigroup-algebras J. J. Green June 5, 2002 Abstract Semigroups S for which the Banach algebra l (S) is injective are investigated and an application to the work of O. Yu. Aristov is described.
More informationWalk through Combinatorics: Sumset inequalities.
Walk through Combinatorics: Sumset inequalities (Version 2b: revised 29 May 2018) The aim of additive combinatorics If A and B are two non-empty sets of numbers, their sumset is the set A+B def = {a+b
More informationEGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS
#A5 INTEGERS 5 (205) EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS Steve Butler Department of Mathematics, Iowa State University, Ames, Iowa butler@iastate.edu Paul Erdős
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationMulti-normed spaces and multi-banach algebras. H. G. Dales. Leeds Semester
Multi-normed spaces and multi-banach algebras H. G. Dales Leeds Semester Leeds, 2 June 2010 1 Motivating problem Let G be a locally compact group, with group algebra L 1 (G). Theorem - B. E. Johnson, 1972
More informationZero-sum square matrices
Zero-sum square matrices Paul Balister Yair Caro Cecil Rousseau Raphael Yuster Abstract Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the
More informationAccumulation constants of iterated function systems with Bloch target domains
Accumulation constants of iterated function systems with Bloch target domains September 29, 2005 1 Introduction Linda Keen and Nikola Lakic 1 Suppose that we are given a random sequence of holomorphic
More informationarxiv: v2 [math.nt] 4 Nov 2012
INVERSE ERDŐS-FUCHS THEOREM FOR k-fold SUMSETS arxiv:12093233v2 [mathnt] 4 Nov 2012 LI-XIA DAI AND HAO PAN Abstract We generalize a result of Ruzsa on the inverse Erdős-Fuchs theorem for k-fold sumsets
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint
More informationA note on network reliability
A note on network reliability Noga Alon Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics Tel Aviv University, Tel Aviv, Israel Let G = (V, E) be a loopless undirected multigraph,
More informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationBanach Spaces II: Elementary Banach Space Theory
BS II c Gabriel Nagy Banach Spaces II: Elementary Banach Space Theory Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we introduce Banach spaces and examine some of their
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationWhere is matrix multiplication locally open?
Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationAn Asymptotic Property of Schachermayer s Space under Renorming
Journal of Mathematical Analysis and Applications 50, 670 680 000) doi:10.1006/jmaa.000.7104, available online at http://www.idealibrary.com on An Asymptotic Property of Schachermayer s Space under Renorming
More informationA CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS
A CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS JERZY WOJCIECHOWSKI Abstract. Nash-Williams [6] formulated a condition that is necessary and sufficient for a countable family A = (A i ) i
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationSections of Convex Bodies via the Combinatorial Dimension
Sections of Convex Bodies via the Combinatorial Dimension (Rough notes - no proofs) These notes are centered at one abstract result in combinatorial geometry, which gives a coordinate approach to several
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationMulti-colouring the Mycielskian of Graphs
Multi-colouring the Mycielskian of Graphs Wensong Lin Daphne Der-Fen Liu Xuding Zhu December 1, 016 Abstract A k-fold colouring of a graph is a function that assigns to each vertex a set of k colours,
More informationNew Negative Latin Square Type Partial Difference Sets in Nonelementary Abelian 2-groups and 3-groups
New Negative Latin Square Type Partial Difference Sets in Nonelementary Abelian 2-groups and 3-groups John Polhill Department of Mathematics, Computer Science, and Statistics Bloomsburg University Bloomsburg,
More informationA PROPERTY OF STRICTLY SINGULAR 1-1 OPERATORS
A PROPERTY OF STRICTLY SINGULAR - OPERATORS GEORGE ANDROULAKIS, PER ENFLO Abstract We prove that if T is a strictly singular - operator defined on an infinite dimensional Banach space X, then for every
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationConstructions of digital nets using global function fields
ACTA ARITHMETICA 105.3 (2002) Constructions of digital nets using global function fields by Harald Niederreiter (Singapore) and Ferruh Özbudak (Ankara) 1. Introduction. The theory of (t, m, s)-nets and
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationSome Algebraic and Combinatorial Properties of the Complete T -Partite Graphs
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 1 (2018), pp 131-138 DOI: 10.7508/ijmsi.2018.1.012 Some Algebraic and Combinatorial Properties of the Complete T -Partite Graphs Seyyede
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationBALANCING GAUSSIAN VECTORS. 1. Introduction
BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors
More informationA UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS
A UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS STEVO TODORCEVIC Abstract. We show that for each positive integer k there is a sequence F n : R k R of continuous functions which represents via point-wise
More informationON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA
ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA Holger Boche and Volker Pohl Technische Universität Berlin, Heinrich Hertz Chair for Mobile Communications Werner-von-Siemens
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationThe Erdős-Hajnal hypergraph Ramsey problem
The Erdős-Hajnal hypergraph Ramsey problem Dhruv Mubayi Andrew Suk February 28, 2016 Abstract Given integers 2 t k +1 n, let g k (t, n) be the minimum N such that every red/blue coloring of the k-subsets
More informationYour first day at work MATH 806 (Fall 2015)
Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies
More informationSPECTRAL PROPERTIES AND NODAL SOLUTIONS FOR SECOND-ORDER, m-point, BOUNDARY VALUE PROBLEMS
SPECTRAL PROPERTIES AND NODAL SOLUTIONS FOR SECOND-ORDER, m-point, BOUNDARY VALUE PROBLEMS BRYAN P. RYNNE Abstract. We consider the m-point boundary value problem consisting of the equation u = f(u), on
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More informationSlow P -point Ultrafilters
Slow P -point Ultrafilters Renling Jin College of Charleston jinr@cofc.edu Abstract We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin s Axiom,
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationOn a hypergraph matching problem
On a hypergraph matching problem Noga Alon Raphael Yuster Abstract Let H = (V, E) be an r-uniform hypergraph and let F 2 V. A matching M of H is (α, F)- perfect if for each F F, at least α F vertices of
More informationThe Arkhangel skiĭ Tall problem under Martin s Axiom
F U N D A M E N T A MATHEMATICAE 149 (1996) The Arkhangel skiĭ Tall problem under Martin s Axiom by Gary G r u e n h a g e and Piotr K o s z m i d e r (Auburn, Ala.) Abstract. We show that MA σ-centered
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationNOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS
NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS K. Jarosz Southern Illinois University at Edwardsville, IL 606, and Bowling Green State University, OH 43403 kjarosz@siue.edu September, 995 Abstract. Suppose
More informationHomotopy and homology groups of the n-dimensional Hawaiian earring
F U N D A M E N T A MATHEMATICAE 165 (2000) Homotopy and homology groups of the n-dimensional Hawaiian earring by Katsuya E d a (Tokyo) and Kazuhiro K a w a m u r a (Tsukuba) Abstract. For the n-dimensional
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationOne-sided power sum and cosine inequalities
Available online at www.sciencedirect.com Indagationes Mathematicae 24 (2013) 373 381 www.elsevier.com/locate/indag One-sided power sum and cosine inequalities Frits Beukers a, Rob Tideman b, a Mathematical
More informationMaximal perpendicularity in certain Abelian groups
Acta Univ. Sapientiae, Mathematica, 9, 1 (2017) 235 247 DOI: 10.1515/ausm-2017-0016 Maximal perpendicularity in certain Abelian groups Mika Mattila Department of Mathematics, Tampere University of Technology,
More informationThe Inclusion Exclusion Principle and Its More General Version
The Inclusion Exclusion Principle and Its More General Version Stewart Weiss June 28, 2009 1 Introduction The Inclusion-Exclusion Principle is typically seen in the context of combinatorics or probability
More informationAvoider-Enforcer games played on edge disjoint hypergraphs
Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More information6 Classical dualities and reflexivity
6 Classical dualities and reflexivity 1. Classical dualities. Let (Ω, A, µ) be a measure space. We will describe the duals for the Banach spaces L p (Ω). First, notice that any f L p, 1 p, generates the
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationExtensions of representations of the CAR algebra to the Cuntz algebra O 2 the Fock and the infinite wedge
Extensions of representations of the CAR algebra to the Cuntz algebra O 2 the Fock and the infinite wedge Katsunori Kawamura Research Institute for Mathematical Sciences Kyoto University, Kyoto 606-8502,
More informationarxiv: v1 [math.ds] 31 Jul 2018
arxiv:1807.11801v1 [math.ds] 31 Jul 2018 On the interior of projections of planar self-similar sets YUKI TAKAHASHI Abstract. We consider projections of planar self-similar sets, and show that one can create
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationDecomposition of Riesz frames and wavelets into a finite union of linearly independent sets
Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets Ole Christensen, Alexander M. Lindner Abstract We characterize Riesz frames and prove that every Riesz frame
More informationSOME INEQUALITIES FOR COMMUTATORS OF BOUNDED LINEAR OPERATORS IN HILBERT SPACES. S. S. Dragomir
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Filomat 5: 011), 151 16 DOI: 10.98/FIL110151D SOME INEQUALITIES FOR COMMUTATORS OF BOUNDED LINEAR
More informationFINITE CONNECTED H-SPACES ARE CONTRACTIBLE
FINITE CONNECTED H-SPACES ARE CONTRACTIBLE ISAAC FRIEND Abstract. The non-hausdorff suspension of the one-sphere S 1 of complex numbers fails to model the group s continuous multiplication. Moreover, finite
More information