ON NONNEGATIVE COSINE POLYNOMIALS WITH NONNEGATIVE INTEGRAL COEFFICIENTS
|
|
- Samuel Hart
- 5 years ago
- Views:
Transcription
1 PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 120, Number I, January 1994 ON NONNEGATIVE COSINE POLYNOMIALS WITH NONNEGATIVE INTEGRAL COEFFICIENTS MIHAIL N. KOLOUNTZAKIS (Communicated by J. Marshall Ash) Dedicated to S. K. Pichorides Abstract. We show that there exist Po > 0 ar>d P\,, Pn nonnegative integers, such that 0 < p(x) = Po + Pi cosx + + Pn cos Nx and po -C s1/3 for.s = J2'J=oPj < improving on a result of Odlyzko who showed the existence of such a polynomial p that satisfies Po < (.slogs)1/3. Our result implies an improvement of the best known estimate for a problem of Erdos and Szekeres. As our method is nonconstructive, we also give a method for constructing an infinite family of such polynomials, given one good "seed" polynomial. 1. Introduction We consider nonnegative cosine polynomials of the form 0 < p{x) = po + P\ cos x + P2 cos 2x -\-h Pn cos Nx, x e [0, In], where p} > 0. We also write p(0) = po Notice that p{0) - Y!j=oP) *s tne maximum of p(x). We are interested in estimating the size of M(s) = inf p(0) p(0)>s for 5 oo. That is, we want to find polynomials of the above form for which Po 2^ JQwp(x)dx is small compared to the maximum of p(x). In what follows C denotes an arbitrary positive constant and a < b means a < Cb for some C. If no more restrictions are imposed on the cosine polynomial p(x) then M(s) = 0 for all 5. This is because the Fejer kernel J A _/ 1 has constant coefficient 1, has KA(0)» A, and is nonnegative. Received by the editors April 24, Mathematics Subject Classification. Primary 42A05, 42A American Mathematical Society /93 $ $.25 per page 157
2 158 M. N. KOLOUNTZAKIS If we restrict the coefficients P\,..., Pn to be either 0 or 1, we have the classical cosine problem, about which we know that for some e > 0 (1) 2' ^ <M{s)<sl/2. The upper bound in (1) is easily proved by considering the polynomial (2) f(x)=\t/cosyx\. A A (3) = A + ^ 53 cos (2 * Vx) + X! (cos (3* + 3')x + cos (3* ~ 3')*)- ;'=i fc,/=i fc>/ All cosines in (3) have distinct frequencies. Define f\{x) = f(x) + \A - i^=1cos(2.3j'x). Then f(x) > 0, /,(0)» A2, f(0) «A, and /, has nonconstant coefficients which are either 0 or 1. The lower bound in (1) is much harder to prove and is due to Bourgain [3]. Earlier, Roth [8] had obtained M(s)» (logs/log log s)1/2. From this point on, we will study the case of p\,..., Pn being arbitrary nonnegative integers. This case was studied by Odlyzko [7] who showed that (4) M(s)<z (slogs)1/3. The method is the following. Consider the nonnegative polynomial q(x) = aka(x) = q0 + q\ cosx H-1- (^ cos,4.x, whose coefficients are not necessarily integers (a > 0). We modify q so that its nonconstant coefficients are integers, by adding to it a random polynomial r(x) = r\ cos x -\-h ra cos Ax. The coefficients rj are independent random variables which take values such that rj + qj is always an integer. A theorem of Salem and Zygmund [9] guarantees that Hrlloo is small with high probability, and the nonnegative polynomial p(x) = q(x) + r(x) + Hrlloo achieves (4) when a is appropriately chosen as a function of A. Odlyzko studied this problem in connection with a problem posed by Erdos and Szekeres [4]. The problem is to estimate n E(«) = infmax TT(1 -z*) where a\,..., a may be any positive integers. The inequality (5) log («)«/v/(«)log(«) holds (see [7]), so that Odlyzko's result implies \oge(n) < n1/3log4/3n. In this paper we replace the random modification in Odlyzko's argument with a more careful modification, based, again, partly on randomization. We use a recent theorem of Spencer [10] which in some cases does better than the Salem- Zygmund theorem. We show in 3 that, when p\,..., Pn are restricted to be
3 NONNEGATIVE COSINE POLYNOMIALS 159 nonnegative integers, we have M(s) <C s1/3. By (5) this implies \oge(n) <?C n'/3 log n. Our method is similar to that used by Beck [2] on a different problem, posed by Littlewood.' Both the Salem-Zygmund theorem and Spencer theorem are nonconstructive. In 4 we give a deterministic procedure which, given a polynomial p(x) with nonnegative integral Fourier coefficients (in other words, Pj is a nonnegative even integer, for j > 1) and with p(0) < {p(0))a, for some a > 0, produces a sequence of polynomials p - /?(0), p(1), /?(2),..., such that degp(n) -» oo, /?<">(0)-» oo, and (p{n)t(0) < (p^(0))a. This shows M{s) < Csxla, with C dependent on the initial p only. 2. Bounds on random trigonometric polynomials In [7] the following classical theorem was used to estimate the size of a random polynomial. Theorem 1 (Salem and Zygmund [9; 5, p. 69]). Let f\{x),..., fn(x) be trigonometric polynomials of degree at most m and fr,..., be independent random variables, which satisfy EeXiJ < el I1 for all j and X > 0 (subnormal random variables). Write Then, for some C > 0, f{x) = J2Zjfj(x). j=l ( (" V2\ 1 pr n/iu>cmi/xiog < 2. Theorem 1 was used in [7] to change the coefficients of a polynomial to integers without a big loss: Corollary 1. Let p(x) = Po + J2j=iPj cosjx and define the random polynomial r(x) so that p(x) + r(x) always has integral coefficients (except perhaps the constant coefficient): N r(x) = ^2 jcosjx with t\j = 0 if Pj is an integer, else p j \Pj\ ~ Pj ^h Probability \pj\ - Pj, j ~ \ \pj\ - Pj with probability Pj - [pj]. Then Pr (HrH^ «(/VlogiV)1/2) -> 1, as N-+ oo. Proof of Corollary 1. The above defined j are subnormal (see, e.g., [1, p. 235, Lemma A.6]). Theorem 1 can now be applied. 'After this paper was submitted for publication the author learned that the method employed for the proof of the basic result has also appeared in [6].
4 160 M. N. KOLOUNTZAKIS The following theorem of Spencer [10] is sometimes better than the Salem- Zygmund theorem, though unfortunately only in the symmetric case / = ±1 (Rademacher random variables). Theorem 2 (Spencer [10]). Let a\j, i = \,..., n\, j = 1,..., n2. be such that \atj\ < 1. Then there are signs \,..., e 2 6 { 1, 1} such that, for all i, (6) J eja,j <Cn\12. ;=i Notice there is no dependence of the bound on n2. Corollary 2. Let f\(x),..., fn(x), /} oo < C, be trigonometric polynomials of degree at most m. Then there is a choice of signs i,...,e e{-l,l} such that J2Ejfj j=i J CO <Cm1'2. a Proof of Corollary 2. For i = I,..., 10m, j \,..., n, define a,; = fj(x{), where x, = i-^. Let i,..., e be the sequence of signs given by Theorem 2 for the matrix a\j and write / = Y%=\ Ejfj There is Xo 6 [0, 2n] such that /(xo) = H/lloo For some k we have \Xk - x0\ < -^ By Bernstein's inequality, \\f'\\oo < >" / oc, we get which, since \^ < 1, implies \f(x0) ~ f(xk)\ < T^II/'Hoo < ^ /(*0) n ll/iu = /(x0) < C\f(xk)\ = C Y,&iaxj Cw'/2> ;=i and the proof is complete. Corollary 2 is better than Theorem 1 only when m/logm = o(n). It is a strictly symmetric result and cannot directly be applied to modify a polynomial p(x) so that it has integral coefficients, as we need to do in our case. We show in 3 that a sequence of applications of Corollary 2 is needed. 3. Proof of the inequality M(s) < s1/3 Since Corollary 2 only allows us to choose random signs, we cannot use it directly (as we used the Salem-Zygmund theorem) to modify the coefficients of a polynomial to integers, while controlling the size of the change. In this section we show how to modify the coefficients little by little to achieve the same result. Let a > 0 and define A a(x) = aka(x) = ^ j=0 a,- cos jx.
5 NONNEGATIVE COSINE POLYNOMIALS 161 Suppose e > 0 and the nonnegative integer ko is such that for some nonnegative integers bj \aj-bj2-^\ <e for all j = 1,..., A. We shall define a finite sequence of polynomials A a{0)(x) = a0 + '52bJ2-kocosjx, aw(x),..., a^(x) j=i inductively, so that if a(k\x) = <2n + f=i afcosjx then, for each j = 1,...,A, (7) af = bf]2k-^ for some nonnegative integers M ^. We define inductively the coefficients of a(fe+1> as follows. If bf, j > 0, is even then af+l) = af. Else define (8) af+i) = af + ef)2k-k where ej ' {-1, 1} are such that (9) ^ efcosjx <CAXI2. bf odd The existence of the signs * is guaranteed by Corollary 2. Notice that (8) implies the preservation of (7) by the inductive definition. We deduce from (9) that (10) a(fc+1>-a<*:> 00<C2fc-^1/2. The polynomial c#o) has integral coefficients (except perhaps for the constant coefficient). Summing (10) we get \\a - a^hoo < fl - a(0) oo + \\am - a^'lu < Ae + CA1'2. Choose e = l/a to get a a(*") 0O < CAXI2. On the other hand, the coefficients of a and a(/co) differ by at most 1, and this implies that for the nonnegative polynomial p(x) a^ \x) + \\a - a(fco) oo we have (11) p(0)>a(0)-a>caa-a, (12) p(0) = a + \\a-a^)\\oo <a + CA1'2. Select a = Ax>2 to get p(0) < A1/2 and p(0) > ^3/2. Since p has integral coefficients, we have exhibited a polynomial that achieves M(s) < s1//3, and the proof is complete. Remark on cosine sums. Applying the method of the preceding proof on the coefficients of the Fejer kernel KA(x), one ends up with a nonnegative polynomial
6 162 M. N. KOLOUNTZAKIS of degree at most A, which is of the form k p(x) = po + 2y^cosXjX ;=i where Xj {1,..., A} are distinct. We have \\KA -p oo < Al/2 which, since Po = 2i So'pWdx> implies Po< A[/2 and p(0)»a. Thus p is a new example of a cosine sum that achieves the upper bound in (1). It is not as simple as the one mentioned in the introduction but the spectrum of it is much denser: \A + 0(All2) cosines with frequencies from 1 to A. Since the Dirichlet kernel (13) DA(x)=j^e<J* j=-a A (14) = 1 + 2^ cos;'* j=i (15) =sm(a+j)x sin f has a minimum asymptotically equal to -j^a, it is conceivable that one may be able to raise the above number of cosine from \A + 0(A{l2) to (l-*.)a + o(a). In other words, since A 2 min y^ cos jx = - A + o(a), 7=1 one must remove at least j^a cosines from the above sum in order to make its minimum o(a) in absolute value. Note added in proof. The author has now proved that \A + o(a) is best possible. 4. The construction Suppose we are given a polynomial p(x) > 0 of degree d, whose nonconstant coefficients are even nonnegative integers, which satisfies p(0) < (p(0))a for some a > 0. Define the infinite sequence of nonnegative polynomials p = po) t p(2) > pci),..., with the recursive formula (16) p{k+l\x)=p^((d+l)x)-p(x).
7 NONNEGATIVE COSINE POLYNOMIALS 163 Since p has even nonconstant coefficients, the Fourier coefficients of all p^k) are nonnegative integers. The spectrum of the first factor in (16) is supported by the multiples of d + 1, and that of the second factor is supported by the interval [-d, d]. This implies that (p(fc+1)r0) = (p(k)t(0)p(0). We obviously have p<*+l>(0) = p^k\0)p(0). We conclude that for all k > 0 and consequently (p{k)t(0) = (P(0))k and p^(0) = (p(0))k, (p(k)no) < (P{k)(o)r. So, if s is a power of p(0), we have M(s) < sa, and for any s we have M(s) < Csa, where C = (p(0))a. As an example we give 10 p(x) = 4 + 4cosx + 2^cos/x which can be checked numerically to be positive and has constant coefficient p(0) = 4 and p(0) = 26. This gives a = log 4/ log 26 = In view of the above construction, finding a single polynomial p with p(0) < (p(0))a, with a < 5, will prove that the result in this paper is not the best possible. The above example was actually found by a computer, but if no more insight is gained into how these good "seed" polynomials look, the computing time grows dramatically as we increase the degree of the polynomial. Acknowledgment I would like to thank P. J. Cohen and A. M. Odlyzko for their help. References 1. N. Alon and J. Spencer, The probabilistic method, Wiley Interscience Series in Discrete Mathematics and Optimization, J. Beck, Flat polynomials on the unit circle Note on a problem of Littlewood, Bull. London Math. Soc. 23 (1991), J. Bourgain, Sur le minimum d'une somme de cosinus, Acta Arith. 45 (1986), P. Erdos and G. Szekeres, On the product 112=10 ~~ z"k) Acad- Serbe Sci. Publ. Inst. Math. 13(1959), J.-P. Kahane, Some random series of functions, 2nd ed., Cambridge Stud. Adv. Math., vol. 5, Cambridge Univ. Press, Cambridge and New York, L. Lovasz, J. Spencer, and K. Vesztergombi, Discrepancy of set systems and matrices, European J. Combin. 7 (1986), A. M. Odlyzko, Minima of cosine sums and maxima of polynomials on the unit circle, J. London Math. Soc. (2) 26 (1982), K. F. Roth, On cosine polynomials corresponding to sets of integers, Acta Arith. 24 (1973), R. Salem and A. Zygmund, Some properties of trigonometric series whose terms have random signs, Acta Math. 91 (1954), J. Spencer, Six standard deviations suffice, Trans. Amer. Math. Soc. 289 (1985), Department of Mathematics, Stanford University, Stanford, California address: kolountqcauchy. Stanford. edu j=2
2 K cos nkx + K si" nkx) (1.1)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 71, Number 1, August 1978 ON THE ABSOLUTE CONVERGENCE OF LACUNARY FOURIER SERIES J. R. PATADIA Abstract. Let / G L[ it, -n\ be 27r-periodic. Noble
More informationON EQUIVALENCE OF ANALYTIC FUNCTIONS TO RATIONAL REGULAR FUNCTIONS
J. Austral. Math. Soc. (Series A) 43 (1987), 279-286 ON EQUIVALENCE OF ANALYTIC FUNCTIONS TO RATIONAL REGULAR FUNCTIONS WOJC3ECH KUCHARZ (Received 15 April 1986) Communicated by J. H. Rubinstein Abstract
More informationUniform convergence of N-dimensional Walsh Fourier series
STUDIA MATHEMATICA 68 2005 Uniform convergence of N-dimensional Walsh Fourier series by U. Goginava Tbilisi Abstract. We establish conditions on the partial moduli of continuity which guarantee uniform
More informationLet D be the open unit disk of the complex plane. Its boundary, the unit circle of the complex plane, is denoted by D. Let
HOW FAR IS AN ULTRAFLAT SEQUENCE OF UNIMODULAR POLYNOMIALS FROM BEING CONJUGATE-RECIPROCAL? Tamás Erdélyi Abstract. In this paper we study ultraflat sequences (P n) of unimodular polynomials P n K n in
More informationON THE GIBBS PHENOMENON FOR HARMONIC MEANS FU CHENG HSIANG. 1. Let a sequence of functions {fn(x)} converge to a function/(se)
ON THE GIBBS PHENOMENON FOR HARMONIC MEANS FU CHENG HSIANG 1. Let a sequence of functions {fn(x)} converge to a function/(se) for x0
More informationRoot systems and the Erdős Szekeres Problem
ACTA ARITHMETICA LXXXI.3 (1997) Root systems and the Erdős Szekeres Problem by Roy Maltby (Burnaby, B.C.) 1. Introduction. An n-factor pure product is a polynomial which can be expressed in the form n
More informationA CONVERGENCE CRITERION FOR FOURIER SERIES
A CONVERGENCE CRITERION FOR FOURIER SERIES M. TOMIC 1.1. It is known that the condition (1) ta(xo,h) sf(xo + h) -f(x0) = oi-r--- -V A-*0, \ log  / for a special x0 does not imply convergence of the Fourier
More informationUNIMODULAR ROOTS OF RECIPROCAL LITTLEWOOD POLYNOMIALS
J. Korean Math. Soc. 45 (008), No. 3, pp. 835 840 UNIMODULAR ROOTS OF RECIPROCAL LITTLEWOOD POLYNOMIALS Paulius Drungilas Reprinted from the Journal of the Korean Mathematical Society Vol. 45, No. 3, May
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada {jdixon,daniel}@math.carleton.ca
More information252 P. ERDÖS [December sequence of integers then for some m, g(m) >_ 1. Theorem 1 would follow from u,(n) = 0(n/(logn) 1/2 ). THEOREM 2. u 2 <<(n) < c
Reprinted from ISRAEL JOURNAL OF MATHEMATICS Vol. 2, No. 4, December 1964 Define ON THE MULTIPLICATIVE REPRESENTATION OF INTEGERS BY P. ERDÖS Dedicated to my friend A. D. Wallace on the occasion of his
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationarxiv:math/ v2 [math.nt] 3 Dec 2003
arxiv:math/0302091v2 [math.nt] 3 Dec 2003 Every function is the representation function of an additive basis for the integers Melvyn B. Nathanson Department of Mathematics Lehman College (CUNY) Bronx,
More informationON THE DIVERGENCE OF FOURIER SERIES
ON THE DIVERGENCE OF FOURIER SERIES RICHARD P. GOSSELIN1 1. By a well known theorem of Kolmogoroff there is a function whose Fourier series diverges almost everywhere. Actually, Kolmogoroff's proof was
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More information(1-2) fx\-*f(x)dx = ^^ Z f(x[n)) + R (f), a > - 1,
MATHEMATICS OF COMPUTATION, VOLUME 29, NUMBER 129 JANUARY 1975, PAGES 93-99 Nonexistence of Chebyshev-Type Quadratures on Infinite Intervals* By Walter Gautschi Dedicated to D. H. Lehmer on his 10th birthday
More informationSOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS
SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS A. G. SHANNON* University of Papua New Guinea, Boroko, T. P. N. G. A. F. HORADAIVS University of New Engl, Armidale, Australia. INTRODUCTION In this
More informationSMOOTHNESS OF FUNCTIONS GENERATED BY RIESZ PRODUCTS
SMOOTHNESS OF FUNCTIONS GENERATED BY RIESZ PRODUCTS PETER L. DUREN Riesz products are a useful apparatus for constructing singular functions with special properties. They have been an important source
More informationON UNICITY OF COMPLEX POLYNOMIAL L, -APPROXIMATION ALONG CURVES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 86, Number 3, November 1982 ON UNICITY OF COMPLEX POLYNOMIAL L, -APPROXIMATION ALONG CURVES A. KROÓ Abstract. We study the unicity of best polynomial
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics NEWER APPLICATIONS OF GENERALIZED MONOTONE SEQUENCES L. LEINDLER Bolyai Institute, University of Szeged, Aradi vértanúk tere 1 H-6720 Szeged, Hungary
More informationSOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1<j<co be
SOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1
More informationSome problems related to Singer sets
Some problems related to Singer sets Alex Chmelnitzki October 24, 2005 Preface The following article describes some of the work I did in the summer 2005 for Prof. Ben Green, Bristol University. The work
More informationON CONVERGENCE OF STOCHASTIC PROCESSES
ON CONVERGENCE OF STOCHASTIC PROCESSES BY JOHN LAMPERTI(') 1. Introduction. The "invariance principles" of probability theory [l ; 2 ; 5 ] are mathematically of the following form : a sequence of stochastic
More information, > --1. [P(" )(x) (1 x) (1 x)dx. ( )(0) t( )P, (cos 0)(sin 0/2)+1/2(cos 0/2) +1/ A TRANSPLANTATION THEOREM FOR JACOBI SERIES
A TRANSPLANTATION THEOREM FOR JACOBI SERIES BY 1. Introduction Let P( )(x) be the Jacobi polynomial of degree n, order (a, ), defined by - [P(" )(x) (1 x) (1 x)dx (1 x)"(1 + x)p(" )(x) (-1) a [(1 x)+"(1
More informationMATH 409 Advanced Calculus I Lecture 11: More on continuous functions.
MATH 409 Advanced Calculus I Lecture 11: More on continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if for any ε > 0 there
More informationWHAT STRONG MONOTONICITY CONDITION ON FOURIER COEFFICIENTS CAN MAKE THE RATIO \\f-sn(f)\\/en(f) BOUNDED? S. P. ZHOU. (Communicated by J.
proceedings of the american mathematical society Volume 121, Number 3, July 1994 WHAT STRONG MONOTONICITY CONDITION ON FOURIER COEFFICIENTS CAN MAKE THE RATIO \\f-sn(f)\\/en(f) BOUNDED? S. P. ZHOU (Communicated
More informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
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 informationBernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces ABSTRACT 1. INTRODUCTION
Malaysian Journal of Mathematical Sciences 6(2): 25-36 (202) Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces Noli N. Reyes and Rosalio G. Artes Institute of Mathematics, University of
More information1. Introduction. The aim of this paper is to revisit some of the questions put forward in the paper [E-S] of Erdos and Szekeres.
ON A PAPER OF ERDÖS AND SZEKERES J. BOURGAIN AND M.-C. CHANG ABSTRACT. Propositions..3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products n ( zaj,
More informationError Estimates for Trigonometric Interpolation. of Periodic Functions in Lip 1. Knut Petras
Error Estimates for Trigonometric Interpolation of Periodic Functions in Lip Knut Petras Abstract. The Peano kernel method is used in order to calculate the best possible constants c, independent of M,
More informationA proof of a partition conjecture of Bateman and Erdős
proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:
More informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationarxiv:math/ v3 [math.co] 15 Oct 2006
arxiv:math/060946v3 [math.co] 15 Oct 006 and SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds
More informationA PROPERTY OF ALGEBRAIC UNIVOQUE NUMBERS
Acta Math. Hungar., 119 (1-2) (2008), 57-62. DOI: 10.1007/sl0474-007-6252-x First published online September 21, 2007 A PROPERTY OF ALGEBRAIC UNIVOQUE NUMBERS M. DE VRIES* Delft University of Technology,
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationA NOTE ON TRIGONOMETRIC MATRICES
A NOTE ON TRIGONOMETRIC MATRICES garret j. etgen Introduction. Let Q(x) he an nxn symmetric matrix of continuous functions on X: 0^x
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationAN INEQUALITY OF TURAN TYPE FOR JACOBI POLYNOMIALS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 32, Number 2, April 1972 AN INEQUALITY OF TURAN TYPE FOR JACOBI POLYNOMIALS GEORGE GASPER Abstract. For Jacobi polynomials P^^Hx), a, ß> 1, let RAX)
More informationMarkov s Inequality for Polynomials on Normed Linear Spaces Lawrence A. Harris
New Series Vol. 16, 2002, Fasc. 1-4 Markov s Inequality for Polynomials on Normed Linear Spaces Lawrence A. Harris This article is dedicated to the 70th anniversary of Acad. Bl. Sendov It is a longstanding
More informationCOMBINATORIAL 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 informationOn Weird and Pseudoperfect
mathematics of computation, volume 28, number 126, april 1974, pages 617-623 On Weird and Pseudoperfect Numbers By S. J. Benkoski and P. Krdö.s Abstract. If n is a positive integer and
More informationA NEW METHOD OF INVERSION OF THE LAPLACE TRANSFORM* ATHANASIOS PAPOULIS. Polytechnic Institute of Brooklyn
405 A NEW METHOD OF INVERSION OF THE LAPLACE TRANSFORM* BY ATHANASIOS PAPOULIS Polytechnic Institute of Brooklyn Introduction. In determining a function r(t) from its Laplace transform R(p) R(p) = [ e"'r(t)
More informationExact exponent in the remainder term of Gelfond s digit theorem in the binary case
ACTA ARITHMETICA 136.1 (2009) Exact exponent in the remainder term of Gelfond s digit theorem in the binary case by Vladimir Shevelev (Beer-Sheva) 1. Introduction. For integers m > 1 and a [0, m 1], define
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Oktay Duman; Cihan Orhan µ-statistically convergent function sequences Czechoslovak Mathematical Journal, Vol. 54 (2004), No. 2, 413 422 Persistent URL: http://dml.cz/dmlcz/127899
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationMonochromatic Solutions to Equations with Unit Fractions
Monochromatic Solutions to Equations with Unit Fractions Tom C. Brown and Voijtech Rödl Citation data T.C. Brown and V. Rödl, Monochromatic solutions to equations with unit fractions, Bull. Aus. Math.
More informationON THE SET OF ALL CONTINUOUS FUNCTIONS WITH UNIFORMLY CONVERGENT FOURIER SERIES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number, November 996 ON THE SET OF ALL CONTINUOUS FUNCTIONS WITH UNIFORMLY CONVERGENT FOURIER SERIES HASEO KI Communicated by Andreas R. Blass)
More informationASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES
ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES KAI LAI CHUNG The limiting distribution of the maximum cumulative sum 1 of a sequence of independent random variables
More informationA PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS
#A INTEGERS 9 (9), 7-37 A PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS Shu-Juan Duan School of Math. and Computational Sciences, Xiangtan University, Hunan, China jjmmcn@6.com
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada fjdixon,danielg@math.carleton.ca
More informationTHE METHOD OF CONDITIONAL PROBABILITIES: DERANDOMIZING THE PROBABILISTIC METHOD
THE METHOD OF CONDITIONAL PROBABILITIES: DERANDOMIZING THE PROBABILISTIC METHOD JAMES ZHOU Abstract. We describe the probabilistic method as a nonconstructive way of proving the existence of combinatorial
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationON FINITE INVARIANT MEASURES FOR MARKOV OPERATORS1 M. FALKOWITZ
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 38, Number 3, May 1973 ON FINITE INVARIANT MEASURES FOR MARKOV OPERATORS1 M. FALKOWITZ Abstract. Two lemmas on proper vectors of convex linear combination
More informationRecursive definitions on surreal numbers
Recursive definitions on surreal numbers Antongiulio Fornasiero 19th July 2005 Abstract Let No be Conway s class of surreal numbers. I will make explicit the notion of a function f on No recursively defined
More informationCertain Properties of Pyramidal and. Figúrate Numbers. By M. Wunderlich. It is well known that despite some extensive computation [1], the only two
482 M. WUNDERLICH p Factors of Mp 8167 76835137 8171 9412993 8209 14759783 8221 9667897-18480809 8269 19630607 8273 28062017-62014409 8287 36877151 8377 134033 787439 2596871 8429 455167-927191 8467 6655063
More informationON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION
ON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION M. KAC 1. Introduction. Consider the algebraic equation (1) Xo + X x x + X 2 x 2 + + In-i^" 1 = 0, where the X's are independent random
More informationBounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers
3 47 6 3 Journal of Integer Seuences, Vol. (7), rticle 7..3 ounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers Roger Woodford Department of Mathematics University
More informationÇ. Asma, R. Çolak ON THE KÔTHE-TOEPLITZ DUALS OF SOME GENERALIZED SETS OF DIFFERENCE SEQUENCES
DEMONSTRATIO MATHEMATICA Vol. XXXIII No 4 2000 Ç. Asma, R. Çolak ON THE KÔTHE-TOEPLITZ DUALS OF SOME GENERALIZED SETS OF DIFFERENCE SEQUENCES Abstract. In this paper we define the sequence sets {u, A,p),
More informationFunctions of several variables of finite variation and their differentiability
ANNALES POLONICI MATHEMATICI LX.1 (1994) Functions of several variables of finite variation and their differentiability by Dariusz Idczak ( Lódź) Abstract. Some differentiability properties of functions
More informationIRREGULARITIES OF DISTRIBUTION. V WOLFGANG M. SCHMIDT
IRREGULARITIES OF DISTRIBUTION. V WOLFGANG M. SCHMIDT Abstract. It is shown that for any finite or countable number of points with positive weights on the sphere, there is always a spherical cap such that
More informationn»i \ v f(x + h)-f(x-h)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 72, Number 2, November 1978 SYMMETRIC AND ORDINARY DIFFERENTIATION C. L. BELNA, M. J. EVANS AND P. D. HUMKE Abstract. In 1927, A. Khintchine proved
More informationA LOWER BOUND FOR THE FUNDAMENTAL FREQUENCY OF A CONVEX REGION
proceedings of the american mathematical society Volume 81, Number 1, January 1981 A LOWER BOUND FOR THE FUNDAMENTAL FREQUENCY OF A CONVEX REGION M. H. PROTTER1 Abstract. A lower bound for the first eigenvalue
More informationAsymptotics of generating the symmetric and alternating groups
Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Ontario K2G 0E2 Canada jdixon@math.carleton.ca October 20,
More informationNOTES ON FOURIER ANALYSIS (XLVIII): UNIFORM CONVERGENCE OF FOURIER SERIES SHIN-ICHI IZUMI AND GEN-ICHIRO SUNOUCHI. (Received April 5, 1951)
NOTES ON FOURIER ANALYSIS (XLVIII): UNIFORM CONVERGENCE OF FOURIER SERIES SHIN-ICHI IZUMI AND GEN-ICHIRO SUNOUCHI (Received April 5, 1951) 1. G. H. Hardy and J. E. Littlewood [1] proved that THEOREM A.
More informationlim f f(kx)dp(x) = cmf
proceedings of the american mathematical society Volume 107, Number 3, November 1989 MAGNIFIED CURVES ON A FLAT TORUS, DETERMINATION OF ALMOST PERIODIC FUNCTIONS, AND THE RIEMANN-LEBESGUE LEMMA ROBERT
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationRandom Bernstein-Markov factors
Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit
More informationThe Hilbert Transform and Fine Continuity
Irish Math. Soc. Bulletin 58 (2006), 8 9 8 The Hilbert Transform and Fine Continuity J. B. TWOMEY Abstract. It is shown that the Hilbert transform of a function having bounded variation in a finite interval
More informationTHE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 91, Number 3, July 1984 THE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY AKIRA TOMINAGA ABSTRACT.
More informationOmega result for the mean square of the Riemann zeta function. Yuk-Kam Lau and Kai-Man Tsang
Omega result for the mean square of the Riemann zeta function Yuk-Kam Lau and Kai-Man Tsang Abstract A recent method of Soundararajan enables one to obtain improved Ω-result for finite series of the form
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-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS
SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems
More informationOn the lines passing through two conjugates of a Salem number
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 On the lines passing through two conjugates of a Salem number By ARTŪRAS DUBICKAS Department of Mathematics and Informatics, Vilnius
More informationSYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime
More informationnx ~p Us x Uns2"'-1,» i
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 4, April 1986 LOOP SPACES OF FINITE COMPLEXES AT LARGE PRIMES C. A. MCGIBBON AND C. W. WILKERSON1 ABSTRACT. Let X be a finite, simply
More informationSTATISTICAL LIMIT POINTS
proceedings of the american mathematical society Volume 118, Number 4, August 1993 STATISTICAL LIMIT POINTS J. A. FRIDY (Communicated by Andrew M. Bruckner) Abstract. Following the concept of a statistically
More informationGAUSSIAN PROCESSES GROWTH RATE OF CERTAIN. successfully employed in dealing with certain Gaussian processes not possessing
1. Introduction GROWTH RATE OF CERTAIN GAUSSIAN PROCESSES STEVEN OREY UNIVERSITY OF MINNESOTA We will be concerned with real, continuous Gaussian processes. In (A) of Theorem 1.1, a result on the growth
More informationTOPOLOGICAL AND MEASURE THEORETIC PROPERTIES OF ANALYTIC SETS
TOPOLOGICAL AND MEASURE THEORETIC PROPERTIES OF ANALYTIC SETS MAURICE SION 1. Introduction. G. Choquet's definition [l] of an analytic set in a topological space as the continuous image of a Kc has proved
More informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationINTERMINGLED ASCENDING WAVE M-SETS. Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York
INTERMINGLED ASCENDING WAVE M-SETS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu and Caitlin Cremin, Will Daniel, and Quer Xiang 1 Abstract Given
More informationarxiv:math/ v1 [math.nt] 6 May 2003
arxiv:math/0305087v1 [math.nt] 6 May 003 The inverse problem for representation functions of additive bases Melvyn B. Nathanson Department of Mathematics Lehman College (CUNY) Bronx, New York 10468 Email:
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationS. Lie has thrown much new light on this operation. The assumption
600 MATHEMATICS: A. E. ROSS PRoc. N. A. S. The operation of finding the limit of an infinite series has been one of the most fruitful operations of all mathematics. While this is not a group operation
More informationarxiv: v1 [math.co] 25 Nov 2018
The Unimodality of the Crank on Overpartitions Wenston J.T. Zang and Helen W.J. Zhang 2 arxiv:8.003v [math.co] 25 Nov 208 Institute of Advanced Study of Mathematics Harbin Institute of Technology, Heilongjiang
More informationON THE HURWITZ ZETA-FUNCTION
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 2, Number 1, Winter 1972 ON THE HURWITZ ZETA-FUNCTION BRUCE C. BERNDT 1. Introduction. Briggs and Chowla [2] and Hardy [3] calculated the coefficients of the
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Florian Luca Please send all communications concerning ADVANCED PROBLEMS AND SOLU- TIONS to FLORIAN LUCA, IMATE, UNAM, AP. POSTAL 61-3 (XANGARI),CP 58 089, MORELIA, MICHOACAN, MEXICO, or by e-mail
More informationTHE ZECKENDORF ARRAY EQUALS THE WYTHOFF ARRAY
Clark Kimberllng University of Evansville, Evansville, IN 47722 (Submitted February 1993) 1. INTRODUCTION It is well known that every n in the set N of positive integers is uniquely a sum of nonconsecutive
More informationStudy of some equivalence classes of primes
Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN 2367-8275 Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University
More informationPartitions with Parts in a Finite Set and with PartsOutsideaFiniteSet
Partitions with Parts in a Finite Set with PartsOutsideaFiniteSet Gert lmkvist CONTENTS Introduction Partitions into Parts in a Finite Set 3 Partitions with Parts Outside a Finite Set References Exact
More informationRational Trigonometry. Rational Trigonometry
There are an infinite number of points on the unit circle whose coordinates are each rational numbers. Indeed every Pythagorean triple gives one! 3 65 64 65 7 5 4 5 03 445 396 445 3 4 5 5 75 373 5 373
More informationChebyshev coordinates and Salem numbers
Chebyshev coordinates and Salem numbers S.Capparelli and A. Del Fra arxiv:181.11869v1 [math.co] 31 Dec 018 January 1, 019 Abstract By expressing polynomials in the basis of Chebyshev polynomials, certain
More informationDYNAMIC ONE-PILE NIM Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208
Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics, UNC Charlotte, Charlotte, NC 28223 James Riidzinski Undergraduate, Dept. of Math., UNC Charlotte,
More informationOn the Distribution of Multiplicative Translates of Sets of Residues (mod p)
On the Distribution of Multiplicative Translates of Sets of Residues (mod p) J. Ha stad Royal Institute of Technology Stockholm, Sweden J. C. Lagarias A. M. Odlyzko AT&T Bell Laboratories Murray Hill,
More informationON CLASSES OF EVERYWHERE DIVERGENT POWER SERIES
ON CLASSES OF EVERYWHERE DIVERGENT POWER SERIES G. A. KARAGULYAN Abstract. We prove the everywhere divergence of series a n e iρn e inx, and 1 [ρn] a n cos nx, for sequences a n and ρ n satisfying some
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationEXTENSIONS OF THE BLOCH PÓLYA THEOREM ON THE NUMBER OF REAL ZEROS OF POLYNOMIALS
EXTENSIONS OF THE BLOCH PÓLYA THEOREM ON THE NUMBER OF REAL ZEROS OF POLYNOMIALS Tamás Erdélyi Abstract. We prove that there are absolute constants c 1 > 0 and c 2 > 0 for every {a 0, a 1,..., a n } [1,
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More information