On a theorem of V. Bernik in the metrical theory of Diophantine approximation

Size: px
Start display at page:

Download "On a theorem of V. Bernik in the metrical theory of Diophantine approximation"

Transcription

1 Acta Arthmetca 117, no.1 (2005) On a theorem of V. Bern n the metrcal theory of Dophantne approxmaton by V. Beresnevch (Mns) 1 1. Introducton. We begn by ntroducng some notaton: #S wll denote the number of elements n a fnte set S; the Lebesgue measure of a measurable set S R wll be denoted by S ; P n wll be the set of ntegral polynomals of degree n. Gven a polynomal P, H(P ) wll denote the heght of P,.e. the maxmum of the absolute values of ts coeffcents; P n (H) = {P P n : H(P ) = H}. The symbol of Vnogradov n the expresson A B means A CB, where C s a constant. The symbol means both and. Gven a pont x R and a set S R, dst(x, S) = nf{ x s : x S}. Throughout, Ψ wll be a postve functon. Mahler s problem. In 1932 K. Mahler [10] ntroduced a classfcaton of real numbers x nto the so-called classes of A, S, T and U numbers accordng to the behavor of w n (x) defned as the supremum of w > 0 for whch P (x) < H(P ) w holds for nfntely many P P n. By Mnovs s theorem on lnear forms, one readly shows that w n (x) n for all x R. Mahler [9] proved that for almost all x R (n the sense of Lebesgue measure) w n (x) 4n, thus almost all x R are n the S-class. Mahler has also conjectured that for almost all x R one has the equalty w n (x) = n. For about 30 years the progress n Mahler s problem was lmted to n = 2 and 3 and to partal results for n > 3. V. Sprndzu proved Mahler s conjecture n full (see [12]). A. Baer s conjecture. Let W n (Ψ) be the set of x R such that there are nfntely many P P n satsfyng (1) P (x) < Ψ(H(P )). 1 The wor has been supported by EPSRC grant GR/R90727/01 Key words and phrases: Dophantne approxmaton, Metrc theory of Dophantne approxmaton, the problem of Mahler 2000 Mathematcs Subject Classfcaton: 11J13, 11J83, 11K60 1

2 A. Baer [1] has mproved Sprndžu s theorem by showng that W n (Ψ) = 0 f Ψ 1/n (h) < and Ψ s monotonc. h=1 He has also conjectured a stronger statement proved by V. Bern [4] that W n (Ψ) = 0 f the sum (2) h n 1 Ψ(h) h=1 converges and Ψ s monotonc. Later V. Beresnevch [5] has shown that R \ W n (Ψ) = 0 f (2) dverges and Ψ s monotonc. We prove Theorem 1. Let Ψ : R R + be arbtrary functon (not necessarly monotonc) such that the sum (2) converges. Then W n (Ψ) = 0. Theorem 1 s no longer mprovable as, by [5], the convergence of (2) s crucal. Notce that for n = 1 the theorem s smple and nown (see, for example, [8, p. 121]). Therefore, from now on we assume that n Subcases of Theorem 1. Let δ > 0. We defne the followng 3 sets denoted by W bg (Ψ), W med (Ψ) and W small (Ψ) consstng of x R such that there are nfntely many P P n smultaneously satsfyng (1) and one of the followng nequaltes (3) 1 P (x), (4) H(P ) δ P (x) < 1, (5) P (x) < H(P ) δ respectvely. Obvously W n (Ψ) = W bg (Ψ) W med (Ψ) W small (Ψ). Hence to prove Theorem 1 t suffces to show that each of the sets has zero measure. Snce sum (2) converges, H n 1 Ψ(H) tends to 0 as H. Therefore, (6) Ψ(H) = o(h n+1 ) as H. 2

3 3. The case of a bg dervatve. The am of ths secton s to prove that W bg (Ψ) = 0. Let B n (H) be the set of x R such that there exsts a polynomal P P n (H) satsfyng (3). Then (7) W bg (Ψ) = N=1 H=N B n (H). Now W bg (Ψ) = 0 f W bg (Ψ) I = 0 for any open nterval I R satsfyng (8) 0 < c 0 (I) = nf{ x : x I} < sup{ x : x I} = c 1 (I) <. Therefore we can fx an nterval I satsfyng (8). By (7) and the Borel-Cantell Lemma, W bg (Ψ) I = 0 whenever (9) B n (H) I <. H=1 By the convergence of (2), condton (9) wll follow on showng that (10) B n (H) I H n 1 Ψ(H) wth the mplct constant n (10) ndependent of H. Gven a P P n (H), let σ(p ) be the set of x I satsfyng (3). Then (11) B n (H) I = σ(p ). P P n (H) Lemma 1. Let I be an nterval wth endponts a and b. Defne the followng sets I = [a, a + 4Ψ(H)] [b 4Ψ(H), b] and I = I \ I. Then for all suffcently large H for any P P n (H) such that σ(p ) I, for any x 0 σ(p ) I there exsts α I such that P (α) = 0, P (α) > P (x 0 ) /2 and x 0 α < 2Ψ(H) P (α) 1. The proof of ths Lemma nearly concdes wth the one of Lemma 1 n [5] and s left for the reader. There wll be some changes to constants and notaton and one also wll have to use (6). Gven a polynomal P P n (H) and a real number α such that P (α) 0, defne σ(p ; α) = {x I : x α < 2Ψ(H) P (α) 1 }. Let I and I be defned as n Lemma 1. For every polynomal P P n (H), we defne the set Z I (P ) = {α I : P (α) = 0 and P (α) 1/2}. 3

4 By Lemma 1, for any P P n (H) we have the ncluson (12) σ(p ) I σ(p ; α). α Z I (P ) Gven Z wth 0 n, defne P n (H, ) = {P = a n x n + + a 0 P n (H) : a = 0} and for R P n (H, ) let P n (H,, R) = {P P n (H) : P R = a x }. It s easly observed that (13) P n (H) = n =0 R P n (H,) P n(h,, R) and (14) #P n (H, ) H n 1 for every. Tang nto account (11), (13), (14) and that I Ψ(H), t now becomes clear that to prove (10) t s suffcent to show that for every fxed and fxed R P n (H, ) (15) σ(p ) I Ψ(H). P P n (H,,R) Let and R be fxed. Defne the ratonal functon R(x) = x R(x). By (8), there exsts a collecton of ntervals [w 1, w ) I ( = 1,..., s), whch do not ntersect parwse and cover I, such that R(x) s monotonc and does not change the sgn on every nterval [w 1, w ). It s clear that s depends on n only. Let Z I,R = P P Z n(h,,r) I(P ), = #(Z I,R [w 1, w )) and Z I,R [w 1, w ) = {α (1),..., α ( ) }, where α (j) < α (j+1). Gven a P P n (H,, R), we obvously have the dentty x P (x) x 1 P (x) x 2 = ( ) P (x) = R(x). Tang x to be α Z I (P ) leads to P (α) α = R(α). By (8), P (α) R(α). Now, by Lemma 1, σ(p ; α) Ψ(H) P (α) 1 Ψ(H) R (α) 1. x 4

5 Usng (12), we get P P n (H,,R) σ(p ) I s Ψ(H) =1 j=1 1 (j) R(α ) Now to show (15) t suffces to prove that for every (1 s) (16) j=1 R (α (j) ) 1 1. Fx an ndex (1 s). If 2 then we can consder two sequental roots α (j) and α (j+1) of two ratonal functons R + a,j and R + a,j+1 respectvely. For convenence let us assume that R s ncreasng and postve on [w 1, w ). Then R s strctly monotonc on [w 1, w ), and we have a,j a,j+1. It follows that a,j a,j+1 1. Usng The Mean Value Theorem and the monotoncty of R, we get where α (j) α (j+1) 1 j=1 1 a,j 0 a,j+1 0 = R (α (j) ) R (α (j+1) ) = = R ( α (j) ) α (j) α (j) α (j+1) s a pont between α (j), whence we readly get R (α (j+1) ) 1 1 j=1 ( α (j+1) R (α (j+1) ) α (j) α (j+1), and α (j+1). Ths mples R (α (j+1) ) 1 ) α (j) = α ( ) α (1) w w 1. The last nequalty and R (α (1) ) P (α (1) ) 1 yeld (16). It s easly verfed that (16) holds for every wth 2 and s certanly true when = 1 or = 0. Ths completes the proof of the case of a bg dervatve. 4. The case of a medum dervatve. As above we fx an nterval I satsfyng (8). The statement W med (Ψ) = 0 wll now follow from W med (Ψ) I = 0. We wll use the followng Lemma 2 (see Lemma 2 n [6]). Let α 0,..., α 1, β 1,..., β R {+ } be such that α 0 > 0, α j > β j 0 for j = 1,..., 1 and 0 < β < +. 5

6 Let f : (a, b) R be a C () functon such that nf x (a,b) f () (x) β. Then, the set of x (a, b) satsfyng { f(x) α 0, β j f (j) (x) α j (j = 1,..., 1) s a unon of at most ( + 1)/2 + 1 ntervals wth lengths at most mn 06<j6 3 (j +1)/2 (α /β j ) 1/(j ). Here we adopt c = + for c > 0. 0 Gven a polynomal P P n (H), we redefne σ(p ) to be the set of solutons of (4). Snce P (n) (x) = n!a n, we can apply Lemma 2 to P wth = n and α 0 = Ψ(H), α 1 = 1, β 1 = nf P (x) H δ, β n = 1, x σ(p ) α 2 = = α n 1 = +, β 2 = = β n 1 = 0. Then we conclude that σ(p ) s a unon of at most n(n + 1)/2 + 1 ntervals of length α 0 /β 1. There s no loss of generalty n assumng that the sets σ(p ) are ntervals as, otherwse, we would treat the ntervals of σ(p ) separately. We also can gnore those P for whch σ(p ) s empty. For every P we also defne a pont γ P σ(p ) such that nf x σ(p ) P (x) 1 P (γ 2 P ). The exstence s easly seen. Now we have (17) σ(p ) Ψ(H) P (γ P ) 1. It also follows from the choce of γ P that (18) H(P ) δ P (γ P ) < 1. Now defne expansons of σ(p ) as follows: σ 1 (P ) := {x I : dst(x, σ(p )) < (H P (γ P ) ) 1 }, σ 2 (P ) := {x I : dst(x, σ(p )) < H 1+2δ }. By (4), σ 1 (P ) σ 2 (P ). Moreover, t s easy to see that (19) σ 1 (P ) σ 2 (Q) for any Q P n (H) wth σ 1 (Q) σ 1 (P ). It s readly verfed that σ 1 (P ) (H P (γ P ) ) 1, and therefore, by (17), σ(p ) σ 1 (P ) HΨ(H). 6

7 Tae any x σ 2 (P ). Usng the Mean Value Theorem, (18) and x γ P H 1+2δ, we get P (x) P (γ P ) + P ( x)((x γ P ) 1 + H H 1+2δ H 2δ, where x s between x and γ P. Smlarly we estmate P (x) resultng n (20) P (x) H 1+4δ, P (x) H 2δ for any x σ 2 (P ). Now for every par (, m) of ntegers wth 0 < m n we defne P n (H,, m) = {R = a n x n + + a 0 P n (H) : a = a m = 0} and for a gven polynomal R P n (H,, m) we defne P n (H,, m, R) = {P = R + a m x m + a x P n (H)}. The ntervals σ(p ) wll be dvded nto 2 classes of essental and nonessental ntervals. The nterval σ(p ) wll be essental f for any choce of (, m, R) such that P P n (H,, m, R) for any Q P n (H,, m, R) other than P we have σ 1 (P ) σ 1 (Q) =. For fxed, m and R summng the measures of essental ntervals gves σ(p ) HΨ(H) σ1 (P ) HΨ(H) I HΨ(H). As #P n (H,, m) H n 2 and there are only n(n + 1)/2 dfferent pars (, m) we obtan the followng estmate σ(p ) H n 1 Ψ(H). essental ntervals σ(p ) wth P P n(h) Thus, by the Borel-Cantell Lemma and the convergence of (2), the set of ponts x of W med (Ψ) I whch belong to nfntely many essental ntervals s of measure zero. Now let σ(p ) be non-essental. Then, by defnton and (19) there s a choce of, m, R such that P P n (H,, m, R) and there s a Q P n (H,, m, R) dfferent from P such that σ(p ) σ 1 (P ) σ 2 (P ) σ 2 (Q). On the set σ 2 (P ) σ 2 (Q) both P and Q satsfy (20) and so does the dfference P (x) Q(x) = b m x m + b x. It s not dffcult to see that b m 0 f H s bg enough. Therefore usng (20)we get (21) x m + b H 1+4δ H 1+4δ and max{ b m, b } H 2δ. b m b m 7

8 Now let x belongs to nfntely many non-essental ntervals. Wthout loss of generalty we assume that x s transcendental as otherwse t belongs to a countable set, whch s of measure zero. Therefore (21) s satsfed for nfntely many b m, b Z. Hence, the nequalty x m p < q 1 5δ 2δ q holds for nfntely many p, q Z. Tang δ = 1 1 5δ so that becomes 2 + δ 10 2δ and applyng standard Borel-Cantell arguments (see [8, p. 121]) we complete the proof of the case of a medum dervatve for non-essental ntervals. 5. The case of a small dervatve. In ths secton we prove that W small (Ψ) = 0. We wll mae use of Theorem 1.4 n [7]. By tang d = 1, f = (x, x 2,..., x n ), U = R, T 1 =... = T n = H, θ = H n+1, K = H δ n that theorem, we arrve at mn(δ,n 1) Theorem 2. Let x 0 R and δ =. Then there exsts a fnte (n+1)(2n 1) nterval I 0 R contanng x 0 and a constant E > 0 such that { } x I 0 : P (x) < H n+1, P (x) < H δ EH δ. P P n, 0<H(P )6H In partcular Theorem 2 mples that for any δ > 0 the set of x R, for whch there are nfntely many polynomals P P n satsfyng the system (22) P (x) < H(P ) n+1, P (x) < H(P ) δ, has zero measure. Indeed, ths set conssts of ponts x I 0 whch belong to nfntely many sets τ m = {x I 0 : (22) holds for some P P n wth 2 m 1 < H(P ) 2 m } By Theorem 2, τ m 2 mδ wth δ > 0. Therefore, m=1 τ m < and the Borel-Cantell Lemma completes the proof of the clam. Tang nto account (6), ths completes the proof of the case of a small dervatve and the proof of Theorem Concludng remars. An analogue of Theorem 1 when P s assumed to be rreducble over Q and prmtve (.e. wth coprme coeffcents) can also be sought. To mae t more precse, let P n(h) be the subset of 8

9 P n (H) consstng of prmtve rreducble polynomals P of degree deg P = n and heght H(P ) = H. Now the set of prmtve rreducble polynomals of degree n s Pn = H=1 P n(h). Let Wn(Ψ) be the set of x R such that there are nfntely many P P satsfyng (1). Theorem 3. Let Ψ : R R + be arbtrary functon such that the sum (23) H=1 converges. Then W n(ψ) = 0. #P n(h) H Ψ(H) For n = 1 the proof of Theorem 3 s a straghtforward applcaton of the Borel-Cantell Lemma and we agan refer to [8, p. 121]. For n > 1 the proof follows from the followng 2 observatons: 1) W n(ψ) W n (Ψ) and 2) #P n(h) H n. The second one guarantees the converges of (2), whch now mples 0 W n(ψ) W n (Ψ) = 0. The proof of the relaton #P n(h) H n s elementary and s left for the reader. In fact, one can easly estmate the number of prmtve reducble polynomals n P n and tae them off the set of all prmtve polynomals n P n whch s well nown to contan at least constant #P n (H). The Duffn-Schaeffer conjecture. The conjecture states that for n = 1 f (23) dverges then R \ W n(ψ) = 0. The multple #P 1 (H) n sum (23) becomes ϕ(h), where ϕ s the Euler functon. The followng problem can be regarded as the generalzaton of the Duffn-Schaeffer conjecture for ntegral polynomals of hgher degree: Prove that R \ W n(ψ) = 0 whenever (23) dverges. Alternatvely, for n > 1 one mght nvestgate the measure of R\W n (Ψ). So far t s unclear f for n > 1 R\W n(ψ) = 0 s equvalent to R\W n (Ψ) = 0, whch s another ntrcate queston. A remar on manfolds. In the metrc theory of Dophantne approxmaton on manfolds one usually studes sets of Ψ-approxmable ponts lyng on a manfold wth respect to the measure nduced on that manfold. Mahler s problem and ts generalsatons can be regarded as Dophantne approxmaton on the Veronese curve (x, x 2,..., x n ). A pont f R n s called Ψ-approxmable f a f < Ψ( a ), 9

10 for nfntely many a Z n, where a = max 166n a for a = (a 1,..., a n ), x = mn{ x z : z Z} and Ψ : R R +. Let f : U R n be a map defned on an open set U R d. We say that f s non-degenerate at x 0 U f for some l N the map f s l tmes contnuously dfferentable on a suffcently small ball centered at x 0 and there are n lnearly ndependent over R partal dervatves of f at x 0 of orders up to l. We say that f s non-degenerate f t s non-degenerate almost everywhere on U. The non-degeneracy of a manfold s naturally defned va the non-degeneracy of ts local parametersaton. In 1998 D. Klenboc and D. Marguls proved the Baer-Sprndžu conjecture by showng that any non-degenerate manfold s strongly extremal. In partcular, ths mples an analogue of Mahler s problem for non-degenerate manfolds. A few years later an analogue of A. Baer s conjecture wth monotonc Ψ (normally called a Groshev type theorem for convergence) has ndependently been proven by V. Beresnevch [6] and by V. Bern, D. Klenboc and G. Marguls [7] for non-degenerate manfolds. It s also remarable that the proofs were gven wth dfferent methods. The dvergence counterpart (also for monotonc Ψ) has been establshed n [3]. In [7] a multplcatve verson of the Groshev type theorem for convergence has also been gven. Theorem 1 of ths paper can be readly generalsed for non-degenerate curves: Gven a non-degenerate map f : I R n defed on an nterval I, for any functon Ψ : R R + such that the sum (2) converges for almost all x I the pont f(x) s not Ψ-approxmable. Even further, usng the slcng technque of Pyartly [11] one can extend ths for a class of n-dfferentable non-degenerate manfolds whch can be folated by non-degenerate curves. In partcular, ths class ncludes arbtrary non-degenerate analytc manfold. However wth the technque n our dsposal we are currently unable to prove the followng Conjecture. Let f : U R n be a non-degenerate map, where U s an open subset of R d. Then for any functon Ψ : R R + such that the sum (2) converges for almost all x U the pont f(x) s not Ψ-approxmable. References [1] A. Baer, On a theorem of Sprndžu, Proc. Royal Soc. Seres A 292 (1966),

11 [2], A concse ntroducton to number theory, Cambrdge Unversty Press, Cambrdge, [3] V.V. Beresnevch, V.I. Bern, D.Y. Klenboc, and G.A. Marguls, Metrc Dophantne approxmaton: The Khntchne Groshev theorem for non-degenerate manfolds, Moscow Mathematcal Journal 2 (2002), no. 2, [4] V.I. Bern, On the exact order of approxmaton of zero by values of ntegral polynomals, Acta Arthmetca 53 (1989), 17 28, (In Russan). [5] V.V. Beresnevch, On approxmaton of real numbers by real algebrac numbers, Acta Arthmetca 90 (1999), no. 2, [6], A Groshev type theorem for convergence on manfolds, Acta Mathematca Hungarca 94 (2002), no. 1-2, [7] V.I. Bern, D.Y. Klenboc, and G.A. Marguls, Khntchne-type theorems on manfolds: the convergence case for standard and multplcatve versons, Internatonal Mathematcs Research Notces (2001), no. 9, [8] J.W.S. Cassels, An ntroducton to Dophantne Approxmaton, Cambrdge Unversty Press, Cambrdge, [9] K. Mahler, Über das Maßder Menge aller S-Zahlen, Math. Ann. 106 (1932), [10], Zur Approxmaton der Exponental functon und des Logarthmus, J. rene und angew. Math. 166 (1932), [11] A. Pyartl, Dophantne approxmaton on submanfolds of eucldean space, Funts. Anal. Prlosz. 3 (1969), 59 62, (In Russan). [12] V.G. Sprndžu, Mahler s problem n the metrc theory of numbers, vol. 25, Amer. Math. Soc., Provdence, RI, 1969, Translatons of Mathematcal Monographs. Insttute of Mathematcs Academy of Scences of Belarus , Surganova 11, Mns, Belarus beresnevch@m.bas-net.by 11

On approximation of real numbers by real algebraic numbers

On approximation of real numbers by real algebraic numbers ACTA ARITHMETICA XC.2 (1999) On approxmaton of real numbers by real algebrac numbers by V. Beresnevch (Mnsk) 1. Introducton. In ths paper we consder several related problems of the theory of Dophantne

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Bernoulli Numbers and Polynomials

Bernoulli Numbers and Polynomials Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Restricted divisor sums

Restricted divisor sums ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng

More information

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

More information

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N) SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

9 Characteristic classes

9 Characteristic classes THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). This is tight for all admissible values of t, k and n. k t + + n t MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

On the size of quotient of two subsets of positive integers.

On the size of quotient of two subsets of positive integers. arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

ON THE JACOBIAN CONJECTURE

ON THE JACOBIAN CONJECTURE v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871

More information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2]. Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland

More information

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Société de Calcul Mathématique SA

Société de Calcul Mathématique SA Socété de Calcul Mathématque SA Outls d'ade à la décson Tools for decson help Probablstc Studes: Normalzng the Hstograms Bernard Beauzamy December, 202 I. General constructon of the hstogram Any probablstc

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY

DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY JOHN D. MCCARTHY AND JON G. WOLFSON 0. Introducton In hs book, Partal Dfferental Relatons, Gromov ntroduced the symplectc analogue of the complex

More information

Random Partitions of Samples

Random Partitions of Samples Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

On the irreducibility of a truncated binomial expansion

On the irreducibility of a truncated binomial expansion On the rreducblty of a truncated bnomal expanson by Mchael Flaseta, Angel Kumchev and Dmtr V. Pasechnk 1 Introducton For postve ntegers k and n wth k n 1, defne P n,k (x = =0 ( n x. In the case that k

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

On the Operation A in Analysis Situs. by Kazimierz Kuratowski

On the Operation A in Analysis Situs. by Kazimierz Kuratowski v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor

More information

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1 MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε

More information

Group Analysis of Ordinary Differential Equations of the Order n>2

Group Analysis of Ordinary Differential Equations of the Order n>2 Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

THE Hadamard product of two nonnegative matrices and

THE Hadamard product of two nonnegative matrices and IAENG Internatonal Journal of Appled Mathematcs 46:3 IJAM_46_3_5 Some New Bounds for the Hadamard Product of a Nonsngular M-matrx and Its Inverse Zhengge Huang Lgong Wang and Zhong Xu Abstract Some new

More information

Differential Polynomials

Differential Polynomials JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Beyond Zudilin s Conjectured q-analog of Schmidt s problem Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs

More information

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Supplement to Clustering with Statistical Error Control

Supplement to Clustering with Statistical Error Control Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve

More information

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

Research Article A Generalized Sum-Difference Inequality and Applications to Partial Difference Equations

Research Article A Generalized Sum-Difference Inequality and Applications to Partial Difference Equations Hndaw Publshng Corporaton Advances n Dfference Equatons Volume 008, Artcle ID 695495, pages do:0.55/008/695495 Research Artcle A Generalzed Sum-Dfference Inequalty and Applcatons to Partal Dfference Equatons

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

On C 0 multi-contractions having a regular dilation

On C 0 multi-contractions having a regular dilation SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

arxiv: v6 [math.nt] 23 Aug 2016

arxiv: v6 [math.nt] 23 Aug 2016 A NOTE ON ODD PERFECT NUMBERS JOSE ARNALDO B. DRIS AND FLORIAN LUCA arxv:03.437v6 [math.nt] 23 Aug 206 Abstract. In ths note, we show that f N s an odd perfect number and q α s some prme power exactly

More information

arxiv: v1 [math.ca] 31 Jul 2018

arxiv: v1 [math.ca] 31 Jul 2018 LOWE ASSOUAD TYPE DIMENSIONS OF UNIFOMLY PEFECT SETS IN DOUBLING METIC SPACE HAIPENG CHEN, MIN WU, AND YUANYANG CHANG arxv:80769v [mathca] 3 Jul 08 Abstract In ths paper, we are concerned wth the relatonshps

More information

Characterizing the properties of specific binomial coefficients in congruence relations

Characterizing the properties of specific binomial coefficients in congruence relations Eastern Mchgan Unversty DgtalCommons@EMU Master's Theses and Doctoral Dssertatons Master's Theses, and Doctoral Dssertatons, and Graduate Capstone Projects 7-15-2015 Characterzng the propertes of specfc

More information

Projective change between two Special (α, β)- Finsler Metrics

Projective change between two Special (α, β)- Finsler Metrics Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant

More information

On quasiperfect numbers

On quasiperfect numbers Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

The L(2, 1)-Labeling on -Product of Graphs

The L(2, 1)-Labeling on -Product of Graphs Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information