CALCULATIONS FOR NEWMAN POLYNOMIALS
|
|
- Virgil Miller
- 5 years ago
- Views:
Transcription
1 iauliai Math. Semin., 4 (12), 2009, CALCULATIONS FOR NEWMAN POLYNOMIALS Tomas PLANKIS Vilnius University, Naugarduko 24, LT Vilnius, Lithuania; topl@hypernet.lt Abstract. In this paper, we will search for an eective algorithm to calculate the quantity min (deg(p ) + 1) H(P 2 ) P P (1) for Newman polynomials P 2 of degree at most 36. We will also give a few computational results and answer an open question mentioned in one of the earlier papers. Key words and phrases: algorithm, Newman polynomials Mathematics Subject Classication: 11C08, 11Y16, 68Q Introduction Let P (x) = a 0 + a 1 x a n x n C[x], where a n 0. We say that n = deg P is the degree of P, and H(P ) = max a i is its height. Then P (x) 0 i n is called a Newman polynomial (after [6]) if its every coecient belongs to the set {0, 1}. Sidon sets were studied by Martin and O'Bryant in [5]. As a result, some problems could be solved with the help of Newman polynomials. In [7], Yu considered the quantity lim inf k deg(p k )H(P 2 k ) P k (1) 2, where P k, k = 1, 2,..., is a sequence of Newman polynomials with deg(p 1 ) < deg(p 2 ) <... He conjectured (see Conjecture 2 in [7]) that this limit is always at least 1 if 0 as k. Berenhaut and Saidak [1] proved P k (1) deg P k
2 158 T. Plankis P k (1) deg(p k ) that the condition lim = 0 is indeed necessary in this conjecture. k More precisely, they showed that there is a sequence of Newman polynomials for which the above limit is 8 9. Martin and O'Bryant in their paper gave a lower bound for Sidon sets (see Theorem 1.4) which was obtained using probabilistic methods. This result was also obtained in [2] by Cilleruelo for Newman polynomials. It was shown that a corresponding limit can be as small as π 4 and so the conjecture of [7] was disproved. Similar result was obtained by Kolountzakis in [4]. Dubickas [3] proved that it is sucient to consider the quantity: Q 2 (P ) = (deg(p ) + 1)H(P 2 ) P (1) 2, because there is always a sequence of Newman polynomials P k, k = 1, 2,..., with increasing degrees such that lim inf Q 2(P k ) = Q 2 (P ) (see Theorem 1 in k [3]). In this paper, we will give concrete values of Q 2 (P ) for Newman polynomials of degrees 3 to 36 with the help of computer calculations and will search for an eective algorithm to calculate the minimum of Q 2 (P ) for polynomials of a given degree. We will answer one of the open questions in [1] as well. 2. Main result Let P n be the set of Newman polynomials of degree n, and let P = n=1 P n. For every P = a 0 + a 1 x a n x n, let P = a n + a n 1 x a 0 x n be its reciprocal polynomial. We say that P P n is self-symmetrical if P = P. Note that reciprocal polynomials are symmetric with respect to the height function H. Symmetry leads to the following simple conclusions. The set P n can be divided into three disjoint subsets of self-symmetrical polynomials, a set of polynomials S and a set of their reciprocals S. According to symmetry, it is enough to check two of them: self-symmetrical polynomials and the set S. Also, we can only consider Newman polynomials with the coecient a 0 = 1. Our main result is the following. Theorem 1. For each Newman polynomial P of degree at most 36, we have Q 2 (P ) Q 2 (P 0 ) = = ,
3 Calculations for Newman polynomials 159 where the coecients of the polynomial P 0 of degree 35 in ascing order are given by According to Table 2 and Table 3, we can answer one question of [1]. In the paper mentioned above, author asked the following question: is it true that the same value of Q 2 occurs only for families of polynomials for which P (1) deg P is the same? As we can see, for Q 2 = , there are at least two dierent Newman polynomials of degrees 23 and 29. The following table will provide such Q 2. This answers the second open question in [1]. Q 2 8 Degrees P (1) deg P 3, 7, 11, 15 1, 6, , 9 1, , 27, 34, , 4 5, 25 27, , , 29, Table 1: Values of Q 2 (P ) for some P with dierent degree Now we will analyze some data. The following two tables represent our calculations. Here are given the values min (Q 2 ) of the given polynomial set P P n. Degree min (Q 2 ) P(1) H(P 2 ) Coecients of polynomial: a 0, a 1,..., a Degree Table 2: Calculations (PC)
4 160 T. Plankis How many polynomials in P n give us min (Q 2 )? The answer is not so P simple. It looks obvious that this number deps on degree n, which is wrong. With the slight modication of the algorithm given below, we can get all such polynomials for a given degree n. We have calculated them for polynomials from degree 2 to 20 and got some interesting results. Degree min (Q 2) P(1) H(P 2 ) Coecients of polynomial: a 0, a 1,..., a Degree Table 3: Calculations (Supercomputer) The number of such polynomials t to increase when the degree is increasing. However, the uctuation is very high, especially for prime numbers. Table 4 shows this. The next question would be: does these polynomials have something in common? In fact, almost nothing, because for a given degree such polynomials can be: all prime; all composite; mixed. Degree n Solutions Table 4: Number of polynomials Unfortunately, this characteristic does not dep on primality of the degree n. The only thing in common is that P (1) is the same for the solutions mentioned above. These coecients form the linear regression y = a+bx (see Figure 1). Using Maple, we calculated the coecients and got the equation y = x
5 Calculations for Newman polynomials 161 with dispersion d = Calculated correlation coecients are very close to 1, and that shows that linear model ts almost perfect. The main question would be: is the dispersion correct, or does it t to increase? We do not know the answer Figure 1: Graph for P (1) Next we will look at asymptotic behaviour of the value of min P P n Q 2 (P ). For this purpose we will use the regression analysis. As we can see from Figure 1, data t to decrease according to a particular function. We tried a few most common nonlinear models for this case: logarithmic; power; asymptotic regression (Metcherlich Law of Diminishing Returns). The last one proved itself to be useful. Other models have limit going to innity. The model mentioned above has the form a + be cx. With the help of SPSS 16.0 (Statistical Package for the Social Sciences) we calculated these coecients. Results can be found in Table 5. Parameter Estimate Std. Error 95% Condence Interval Lover Bound Upper Bound a b c Table 5: Coecients for model
6 162 T. Plankis We get an estimate for asymptotic behavior because lim a + x be cx = a (see Figure 2). We must notice that this limit is very close to π 4. In fact, if we take standard error into consideration, we will see that π can be a good candidate for the lower bound (see Theorem 2 in [2]). We will notice that these data look almost periodic with the period T = 3. To be precise, from 23rd degree it looks that data is periodic with period T = 3. If that is true, then we need to calculate not all Newman polynomials, but only those with deg P = 2 (mod 3) in order to nd the next possible minimum. 0,96 0,94 0,92 0,90 0,88 0,86 0,84 0, Figure 2: Graph for Q 2 Now we will give the basic algorithm to calculate Q(P ). 3. Basic algorithm We need to calculate Q 2 (P ) for every P P n. So we need to go trough every polynomial and calculate two additional parameters: height H(P 2 ); length P (1) 2. Before giving the algorithm, let us consider how we will describe the polynomial. It is natural to describe polynomial using its coecients. For this purpose, programming languages contain few convenient data structures. We will use vector associating its indexes with the indexes of coecients of a polynomial. Let A be a vector. Then A[0] = a 0, A[1] = a 1,... Because of conclusions mentioned above it is sucient to do essential work with coecients a 1,..., a deg P 1.
7 Calculations for Newman polynomials 163 Data: deg(p) Result: min Q 2(P ) P P initialization; for i 1 to 2 deg(p 1) 1 do increment vector by 1; create polynomial of degree deg(p ) adding a 0 and a deg P ; calculate H(P 2 ); calculate P (1); calculate Q(P ); Algorithm 1: Basic algorithm The increase of the vector could be achieved by applying the sum modulo 2. The complexity of this part is deg P. Next we need to calculate P 2. We give the simple algorithm for this: for i 0 to deg P do for j 0 to deg P do calculating new polynomial P 2 [i + j] = P 2 [i + j] + P [i] P [j]; Algorithm 2: Squaring a polynomial The complexity of this part is (deg(p )) 2, and to nd H(P 2 ) the complexity is 2 deg(p ). To calculate P (1), the complexity is deg P. All this gives us the complexity for calculating Q(P ) for some P is 4 deg P + (deg P ) 2. This leads to overall complexity of (4n + n 2 ) 2 n 1 for nding the smallest Q(P ) for all P P n. Working code was written in C++ and implemented on PC (2.4 GHz Intel Core 2 Duo) and supercomputer (SGI Altix 4700). As we see, this algorithm is not very fast. If the power of polynomial increases by 1, the amount of time needed to compute Q 2 for all possible polynomials doubles. According to conclusions mentioned in the rst section, we can cut approximately half of the time, but that does not change the fact that the complexity of this algorithm is exponential. In the next section we will talk about possible improvements. 4. Improvements First of all we will mention that, for deg P = 22, supercomputer needs about 20 seconds to nish the algorithm above. It is quite obvious that, for deg(p ) = 36, we will need a few days to accomplish calculations. What improvements can be done?
8 164 T. Plankis Instead of searching through all polynomials of degree n, we could search only for polynomials with the same P (1) if the exact P (1) would be known (for further notice we call subset). That would lead to checking just a very small amount of polynomials compared to all P. More precisely, according to the combinatoric (see permutations with repetitions) we will need to check (deg(p ) 1)! n 1!n 2! polynomials, where n 1 = P (1) 2 and n 2 = deg(p ) 1 n 1. The last section gives us a hint that we could check the interval [[y d], [y + d]]. This means we need to check nine subsets. The algorithm looks as follows. Data: deg P Result: min Q2(P ) P P initialization; for i [y d] to [y + d] do calculate subset for i; for all j in subset do create polynomial of degree deg P adding a 0 and a deg P ; calculate H(P 2 ); calculate P (1); calculate Q(P ); Algorithm 3: Improved algorithm It is dicult to calculate the complexity of the algorithm. But it should be less than n! n 2! n!, where n = deg P 1. Because n! 2πn( n e )n, we get 2 the complexity deg(p ) 2 2deg P deg P. Let look at deg P = 35. Predicted N(P ) = We need to calculate polynomials for interval [21,29]. That means we need to check 1'971'173'936 polynomials, and by our estimation it would be 2'333'606'220. There is a possibility to use 'periodicity' (see residual analysis) in order to predict P (1) more precisely. Then we could reduce from 1'971'173'936 polynomials to 493'212'976 or even less. This could be the next research. References [1] K. S. Berenhaut, F. Saidak, A note on the maximal coecients of squares of Newman polynomials, J. Number Theory 125, (2007). [2] J. Cilleruelo, Maximal coecients of squares of Newman polynomials, preprint (2008).
9 Calculations for Newman polynomials 165 [3] A. Dubickas, Heights of powers of Newman and Littlewood polynomials, Acta Arith. 128(2), (2007). [4] M. N. Kolountzakis, Coecients of squares of Newman polynomials, preprint (2008), [5] G. Martin, K. O'Bryant, Continuous Ramsey theory and Sidon sets, preprint (2002), arxiv:math/ v1. [6] D. J. Newman, An L 1 extremal problem for polynomials, Proc. Amer. Math. Soc. 16, (1965). [7] G. Yu, An upper bound for B 2 [g] sets, J. Number Theory 122, (2007). Received 26 January 2009
Some 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 THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationPERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A42 PERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M Artūras Dubickas Department of Mathematics and Informatics, Vilnius University,
More informationAn upper bound for B 2 [g] sets
Journal of Number Theory 1 (007) 11 0 www.elsevier.com/locate/jnt An upper bound for B [g] sets Gang Yu Department of Mathematics, LeConte College, 153 Greene street, University of South Carolina, Columbia,
More informationAuxiliary polynomials for some problems regarding Mahler s measure
ACTA ARITHMETICA 119.1 (2005) Auxiliary polynomials for some problems regarding Mahler s measure by Artūras Dubickas (Vilnius) and Michael J. Mossinghoff (Davidson NC) 1. Introduction. In this paper we
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
More informationThe average dimension of the hull of cyclic codes
Discrete Applied Mathematics 128 (2003) 275 292 www.elsevier.com/locate/dam The average dimension of the hull of cyclic codes Gintaras Skersys Matematikos ir Informatikos Fakultetas, Vilniaus Universitetas,
More informationA NOTE ON B 2 [G] SETS. Gang Yu 1 Department of Mathematical Sciences, Kent State University, Kent, OH
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (8), #A58 A NOTE ON B [G] SETS Gang Yu Department of Mathematical Sciences, Kent State University, Kent, OH 444 yu@math.kent.edu Received:
More informationstrengthened. In 1971, M. M. Dodson [5] showed that fl(k; p) <c 1 if p>k 2 (here and below c 1 ;c 2 ;::: are some positive constants). Various improve
Nonlinear Analysis: Modelling and Control, Vilnius, IMI, 1999, No 4, pp. 23-30 ON WARING'S PROBLEM FOR A PRIME MODULUS A. Dubickas Department of Mathematics and Informatics, Vilnius University, Naugarduko
More information2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene
Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationWXML Final Report: Primality of Polynomials
WXML Final Report: Primality of Polynomials William Stein, Travis Scholl, Astrid Berge, Daria Micovic, Xiaowen Yang Autumn 016 1 Introduction The density of certain types of primes is a classical question
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Providence College Math/CS Colloquium April 2, 2014
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Providence College Math/CS Colloquium April 2, 2014 Let s begin with products. Take the N N multiplication table. It has
More informationOn intervals containing full sets of conjugates of algebraic integers
ACTA ARITHMETICA XCI4 (1999) On intervals containing full sets of conjugates of algebraic integers by Artūras Dubickas (Vilnius) 1 Introduction Let α be an algebraic number with a(x α 1 ) (x α d ) as its
More informationUniversal Juggling Cycles
Universal Juggling Cycles Fan Chung y Ron Graham z Abstract During the past several decades, it has become popular among jugglers (and juggling mathematicians) to represent certain periodic juggling patterns
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 informationSum and shifted-product subsets of product-sets over finite rings
Sum and shifted-product subsets of product-sets over finite rings Le Anh Vinh University of Education Vietnam National University, Hanoi vinhla@vnu.edu.vn Submitted: Jan 6, 2012; Accepted: May 25, 2012;
More informationMulticolour Ramsey Numbers of Odd Cycles
Multicolour Ramsey Numbers of Odd Cycles JOHNSON, JR; Day, A 2017 Elsevier Inc This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Combinatorial Theory, Series
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA International Number Theory Conference in Memory of Alf van der Poorten, AM 12 16 March, 2012 CARMA, the University of Newcastle
More informationarxiv: v2 [math.nt] 15 May 2013
INFINITE SIDON SEQUENCES JAVIER CILLERUELO arxiv:09036v [mathnt] 5 May 03 Abstract We present a method to construct dense infinite Sidon sequences based on the discrete logarithm We give an explicit construction
More informationA talk given at the University of California at Irvine on Jan. 19, 2006.
A talk given at the University of California at Irvine on Jan. 19, 2006. A SURVEY OF ZERO-SUM PROBLEMS ON ABELIAN GROUPS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093 People s
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationTHE SUPREMUM OF AUTOCONVOLUTIONS, WITH APPLICATIONS TO ADDITIVE NUMBER THEORY
Illinois Journal of Mathematics Volume 53, Number 1, Spring 2009, Pages 219 235 S 0019-2082 THE SUPEMUM OF AUTOCONVOLUTIONS, WITH APPLICATIONS TO ADDITIVE NUMBE THEOY GEG MATIN AND KEVIN O BYANT Abstract.
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationDiscrete uniform limit law for additive functions on shifted primes
Nonlinear Analysis: Modelling and Control, Vol. 2, No. 4, 437 447 ISSN 392-53 http://dx.doi.org/0.5388/na.206.4. Discrete uniform it law for additive functions on shifted primes Gediminas Stepanauskas,
More informationAN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER
AN ADDITIVE PROBLEM IN FINITE FIELDS WITH POWERS OF ELEMENTS OF LARGE MULTIPLICATIVE ORDER JAVIER CILLERUELO AND ANA ZUMALACÁRREGUI Abstract. For a given finite field F q, we study sufficient conditions
More informationIncreasing and decreasing intervals *
OpenStax-CNX module: m15474 1 Increasing and decreasing intervals * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 A function is
More informationMath 61CM - Solutions to homework 2
Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationOn the modification of the universality of the Hurwitz zeta-function
ISSN 392-53 Nonlinear Analysis: Modelling and Control, 206, Vol. 2, No. 4, 564 576 http://dx.doi.org/0.5388/na.206.4.9 On the modification of the universality of the Hurwitz zeta-function Antanas Laurinčikas,
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 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 informationNUMBER FIELDS WITHOUT SMALL GENERATORS
NUMBER FIELDS WITHOUT SMALL GENERATORS JEFFREY D. VAALER AND MARTIN WIDMER Abstract. Let D > be an integer, and let b = b(d) > be its smallest divisor. We show that there are infinitely many number fields
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More informationFinite Mathematics : A Business Approach
Finite Mathematics : A Business Approach Dr. Brian Travers and Prof. James Lampes Second Edition Cover Art by Stephanie Oxenford Additional Editing by John Gambino Contents What You Should Already Know
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA. Dartmouth Mathematics Society May 16, 2012
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Dartmouth Mathematics Society May 16, 2012 Based on joint work with P. Kurlberg, J. C. Lagarias, & A. Schinzel Let s begin
More informationMath 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid
Math 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid Like much of mathematics, the history of the distribution of primes begins with Euclid: Theorem
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 informationOn a combinatorial method for counting smooth numbers in sets of integers
On a combinatorial method for counting smooth numbers in sets of integers Ernie Croot February 2, 2007 Abstract In this paper we develop a method for determining the number of integers without large prime
More informationAn upper bound on the domination number of n-vertex connected cubic graphs
Discrete Mathematics 309 (2009) 1142 1162 www.elsevier.com/locate/disc An upper bound on the domination number of n-vertex connected cubic graphs A.V. Kostochka a,b,, B.Y. Stodolsky a a Department of Mathematics,
More informationOn explicit Ramsey graphs and estimates of the number of sums and products
On explicit Ramsey graphs and estimates of the number of sums and products Pavel Pudlák Abstract We give an explicit construction of a three-coloring of K N,N in which no K r,r is monochromatic for r =
More informationLecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67.
Lecture 7 January 5, 208 Facts about primes Since this is an Effective Number Theory school, we should list some effective results. Proposition. (i) The inequality < π() holds for all 67. log 0.5 (ii)
More informationAPPROXIMATING THE COMPLEXITY MEASURE OF. Levent Tuncel. November 10, C&O Research Report: 98{51. Abstract
APPROXIMATING THE COMPLEXITY MEASURE OF VAVASIS-YE ALGORITHM IS NP-HARD Levent Tuncel November 0, 998 C&O Research Report: 98{5 Abstract Given an m n integer matrix A of full row rank, we consider the
More informationAppending Digits to Generate an Infinite Sequence of Composite Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 2011, Article 11.5.7 Appending Digits to Generate an Infinite Sequence of Composite Numbers Lenny Jones and Daniel White Department of Mathematics
More informationCSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function
CSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function that is reasonably random in behavior, then take any
More informationin the company. Hence, we need to collect a sample which is representative of the entire population. In order for the sample to faithfully represent t
10.001: Data Visualization and Elementary Statistical Analysis R. Sureshkumar January 15, 1997 Statistics deals with the collection and the analysis of data in the presence of variability. Variability
More informationSelf-Witnessing Polynomial-Time Complexity. and Prime Factorization. Michael R. Fellows. University of Victoria. Neal Koblitz
Self-Witnessing Polynomial-Time Complexity and Prime Factorization Michael R. Fellows Department of Computer Science University of Victoria Victoria, B.C. V8W 2Y2 Canada Neal Koblitz Department of Mathematics
More informationAlgorithms CMSC Homework set #1 due January 14, 2015
Algorithms CMSC-27200 http://alg15.cs.uchicago.edu Homework set #1 due January 14, 2015 Read the homework instructions on the website. The instructions that follow here are only an incomplete summary.
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 informationFamilies that remain k-sperner even after omitting an element of their ground set
Families that remain k-sperner even after omitting an element of their ground set Balázs Patkós Submitted: Jul 12, 2012; Accepted: Feb 4, 2013; Published: Feb 12, 2013 Mathematics Subject Classifications:
More informationLecture Notes 17. Randomness: The verifier can toss coins and is allowed to err with some (small) probability if it is unlucky in its coin tosses.
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 17 March 31, 2010 Scribe: Jonathan Ullman 1 Interactive Proofs ecall the definition of NP: L NP there exists a polynomial-time V and polynomial
More informationOn the complexity of approximate multivariate integration
On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 USA ioannis.koutis@cs.cmu.edu January 11, 2005 Abstract
More informationarxiv:math/ v2 [math.gm] 4 Oct 2000
On Partitions of Goldbach s Conjecture arxiv:math/000027v2 [math.gm] 4 Oct 2000 Max See Chin Woon DPMMS, Cambridge University, Cambridge CB2 2BZ, UK WatchMyPrice Technologies, 200 West Evelyn Ave, Suite
More informationON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES
MATH. SCAND. 99 (2006), 136 146 ON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES ARTŪRAS DUBICKAS Abstract In this paper, we prove that if t 0,t 1,t 2,... is a lacunary sequence, namely, t n+1 /t n 1 + r
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationChapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn
Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
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 informationBlankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus
Blankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus Amina Dozier, Charles Fahringer, Martin Harrison, Jeremy Lyle Dr. Neil Calkin, Dr. Kevin James, Dr. Dave Penniston July 13, 2006
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
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 informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationarxiv: v1 [math.ca] 7 Apr 2019
SanD primes and numbers. Freeman J. Dyson, Norman E. Frankel, Anthony J. Guttmann Institute of Advanced Study, Princeton, NJ 08540, USA. School of Physics, The University of Melbourne, Victoria 3010, Australia.
More informationPerfect Power Riesel Numbers
Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA 24450 b Department of Mathematics, Shippensburg University, Shippensburg,
More informationRECENT PROGRESS ON FINITE B h [g] SETS. 1. Introduction
RECENT PROGRESS ON FINITE B h [g] SETS ALAIN PLAGNE 1. Introduction At the very beginning, there was Simon Sidon. This Hungarian mathematician was born in 1892. According to Babai [1], he was employed
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More information3. G. Groups, as men, will be known by their actions. - Guillermo Moreno
3.1. The denition. 3. G Groups, as men, will be known by their actions. - Guillermo Moreno D 3.1. An action of a group G on a set X is a function from : G X! X such that the following hold for all g, h
More information1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)
Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row
More informationFinding a derangement
Finding a derangement Peter J. Cameron, CSG, January 203 Derangements A derangement, or fixed-point-free permutation, is a permutation on a set Ω which leaves no point fixed. Dante Alighieri, in the Inferno
More informationA PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS
A PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let f r (k) = p k r
More informationOn the number of F -matchings in a tree
On the number of F -matchings in a tree Hiu-Fai Law Mathematical Institute Oxford University hiufai.law@gmail.com Submitted: Jul 18, 2011; Accepted: Feb 4, 2012; Published: Feb 23, 2012 Mathematics Subject
More informationTHE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS*
THE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS* CLAYTON PETSCHE Abstract. Given a number field k and a non-archimedean place v of k, we give a quantitative lower bound on the height of non-torsion algebraic
More informationON SPECTRAL CANTOR MEASURES. 1. Introduction
ON SPECTRAL CANTOR MEASURES IZABELLA LABA AND YANG WANG Abstract. A probability measure in R d is called a spectral measure if it has an orthonormal basis consisting of exponentials. In this paper we study
More informationA talk given at the City Univ. of Hong Kong on April 14, ON HILBERT S TENTH PROBLEM AND RELATED TOPICS
A talk given at the City Univ. of Hong Kong on April 14, 000. ON HILBERT S TENTH PROBLEM AND RELATED TOPICS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 10093 People s Republic of China
More informationOn the Fractional Parts of a n /n
On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev
More informationRate-Monotonic Scheduling with variable. execution time and period. October 31, Abstract
Rate-Monotonic Scheduling with variable execution time and period Oldeld Peter October 31, 1997 Abstract Abstract is something cannot be understood. 1 Rate Monotonic Model Let Ti be a task. Let Pi be the
More informationTHE LIND-LEHMER CONSTANT FOR 3-GROUPS. Stian Clem 1 Cornell University, Ithaca, New York
#A40 INTEGERS 18 2018) THE LIND-LEHMER CONSTANT FOR 3-GROUPS Stian Clem 1 Cornell University, Ithaca, New York sac369@cornell.edu Christopher Pinner Department of Mathematics, Kansas State University,
More informationAn exploration of matrix equilibration
An exploration of matrix equilibration Paul Liu Abstract We review three algorithms that scale the innity-norm of each row and column in a matrix to. The rst algorithm applies to unsymmetric matrices,
More informationHeuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn
Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,
More informationMotivation Automatic asymptotics and transseries Asymptotics of non linear phenomena. Systematic theorie. Eective theory ) emphasis on algebraic aspec
Introduction to automatic asymptotics by Joris van der Hoeven CNRS Universite d'orsay, France email: vdhoeven@math.u-psud.fr web: http://ultralix.polytechnique.fr/~vdhoeven MSRI, Berkeley, 6-0-998 Motivation
More informationPartial Sums of Powers of Prime Factors
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec
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 informationASYMPTOTIC DIOPHANTINE APPROXIMATION: THE MULTIPLICATIVE CASE
ASYMPTOTIC DIOPHANTINE APPROXIMATION: THE MULTIPLICATIVE CASE MARTIN WIDMER ABSTRACT Let α and β be irrational real numbers and 0 < ε < 1/30 We prove a precise estimate for the number of positive integers
More informationDAVID ELLIS AND BHARGAV NARAYANAN
ON SYMMETRIC 3-WISE INTERSECTING FAMILIES DAVID ELLIS AND BHARGAV NARAYANAN Abstract. A family of sets is said to be symmetric if its automorphism group is transitive, and 3-wise intersecting if any three
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationUnique Difference Bases of Z
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 14 (011), Article 11.1.8 Unique Difference Bases of Z Chi-Wu Tang, Min Tang, 1 and Lei Wu Department of Mathematics Anhui Normal University Wuhu 41000 P.
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More informationMathematical Competition for Students of the Department of Mathematics and Informatics of Vilnius University Problems and Solutions
Mathematical Competition for Students of the Department of Mathematics and Informatics of Vilnius University Problems and Solutions Paulius Drungilas, Artūras Dubickas and Jonas Jankauskas 3 6--6 PROBLEMS
More informationON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS
ON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS Abstract. Given k 2 let α 1,..., α k be transcendental numbers such that α 1,..., α k 1 are algebraically independent over Q and α k Q(α 1,...,
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationLecture 5. 1 Review (Pairwise Independence and Derandomization)
6.842 Randomness and Computation September 20, 2017 Lecture 5 Lecturer: Ronitt Rubinfeld Scribe: Tom Kolokotrones 1 Review (Pairwise Independence and Derandomization) As we discussed last time, we can
More informationDecision Problems Concerning. Prime Words and Languages of the
Decision Problems Concerning Prime Words and Languages of the PCP Marjo Lipponen Turku Centre for Computer Science TUCS Technical Report No 27 June 1996 ISBN 951-650-783-2 ISSN 1239-1891 Abstract This
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationOn the second smallest prime non-residue
On the second smallest prime non-residue Kevin J. McGown 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093 Abstract Let χ be a non-principal Dirichlet
More information15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu)
15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) First show l = c by proving l c and c l. For a maximum matching M in G, let V be the set of vertices covered by M. Since any vertex in
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationDense product-free sets of integers
Dense product-free sets of integers Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Joint Mathematics Meetings Boston, January 6, 2012 Based on joint work with P. Kurlberg, J. C. Lagarias,
More informationMyung-Hwan Kim and Byeong-Kweon Oh. Department of Mathematics, Seoul National University, Seoul , Korea
REPRESENTATIONS OF POSITIVE DEFINITE SENARY INTEGRAL QUADRATIC FORMS BY A SUM OF SQUARES Myung-Hwan Kim and Byeong-Kweon Oh Department of Mathematics Seoul National University Seoul 151-742 Korea Abstract.
More information