The Characteristic Polynomial of a Random Permutation Matrix
|
|
- Katrina Jackson
- 5 years ago
- Views:
Transcription
1 The Characteristic Polynomial of a Random Permutation Matrix B.M. Hambly,, Peter Keevash 3, Neil O'Connell, Dudley Stark Basic Research Institute in the Mathematical Sciences HP Laboratories Bristol HPL-BRIMS-- 7 th January, * random matrix theory, characteristic polynomial permutations, central limit theorem We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle. BRIMS, Hewlett-Packard Labs, Bristol, BS34 8QZ, UK Department of Mathematics, University of Bristol, University Walk, Bristol, BS8 TW, UK 3 Department of Pure Mathematics and Mathematical Statistics University of Cambridge, CB SB, UK Internal Accession Date Only Copyright Hewlett-Packard Company
2 The characteristic polynomial of a random permutation matrix B. M. Hambly, Peter Keevash 3, Neil O'Connell and Dudley Stark BRIMS, Hewlett-Packard Labs Bristol, BS34 8QZ, UK Department of Mathematics, University of Bristol University Walk, Bristol, BS8 TW, UK 3 Department of Pure Mathematics and Mathematical Statistics University of Cambridge, 6 Mill Lane, Cambridge, CB SB, UK Abstract We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle. Introduction and summary The spectral properties of random matrices have received a lot of attention in recent years, and this is largely due to the striking (statistical) similarity between eigenvalue distributions of certain random matrices and the distribution of the zeros of the Riemann zeta function along the critical line. This similarity was rst observed by Montgomery [6] (through conversations with Freeman Dyson in the early 97's) and has since been supported by various numerical and analytic results (see, for example, [7, 8, 3]). Most of this work has focused on random matrices with continuous distributions, such as Haar measure on the unitary group (the CUE ensemble) or random hermitian matrices with complex iid Gaussian entries (the GUE ensemble). The discrete analogue of the unitary group is the symmetric group. The spectrum of a permutation matrix is completely determined by the cycle structure of the corresponding permutation, and the cycle structure of random permutations is very well understood. In both cases all of the eigenvalues lie on the unit circle. One might expect the spectrum of a random permutation matrix to look very dierent from that of a random unitary matrix, and indeed it does,
3 but in many respects it is surprisingly similar. This was rst observed in the PhD thesis of Wieand [] (see also []) where it is shown that the order of the uctuations for the number of eigenvalues in a (nice) subset of the circle is the same as in the unitary case. The main result of this paper is that a similar statement is true for values of the characteristic polynomial. The characteristic polynomial of a random unitary matrix was rst studied by Keating and Snaith [4]. They propose a renormalized version of this random polynomial as a model for the Riemann zeta function along the critical line. They also prove acentral theorem for the value distribution of the polynomial which is consistent with Selberg's central limit theorem for the value distribution of the Riemann zeta function along the critical line [9]. In order to state the theorem of Keating and Snaith, and the results of this paper, we need to introduce some notation. For an n by n matrix U let U (s) =det(u ; si) denote the characteristic polynomial and set U (s) = det I ; s U = ; s n U (s): We denote the restriction of U to the unit circle by Z U () =(e i ) ( <): Note that U and U have the same zeros, and U (s)! ass!. This allows us to choose a canonical branch of log U (s) as follows. A branch of the log function can only be dened in a simply connected domain that does not include, so for each of the n zeros of Z (eigenvalues) we cutthe complex plane from to this value. We thenchoose the branch oflog U (s) of the rest of the plane which converges to zero as s!. We use this to dene a function on the unit circle: ( log ZU () where dened, L U () = otherwise: Keating and Snaith [4] prove the following central limit theorem. It is also shown in [] that the oint distributions for the numbers of eigenvalues in collections of intervals has essentially the same covariance structure as in the unitary case.
4 Theorem.. Fix <. Let U n bearandom n by n unitary matrix, chosen according to Haar measure on the unitary group. Then both the real and imaginary parts of L Un () q log n converge in distribution to a standard normal random variable. In fact, although it is not proved, it is clear from the arguments in [4] that the oint distribution of the real and imaginary parts converges to a standard bivariate normal. The main result of this paper is the following. Theorem.. (i) Suppose < and = is an irrational of nite type. Let P n be a n by n permutation matrix, chosen uniformly at random. Then both the real and imaginary parts of L Pn () q log n converge in distribution to a standard normal random variable. (ii) Moreover, for any irrational =, Im L Pn() ; EL Pn () q log n converges in distribution to a standard normal random variable. The notion of type will be explained in Section. Here we will simply remark that the set of numbers which are not of nite type has Hausdor dimension zero. We can relate this result to a central limit theorem of Wieand, by considering the imaginary part of L Pn. This is described in Section 4. Let Xn l denote the number of eigenvalues of P n which lie in the half open subinterval of the unit circle ( e il ]. A particular case of the main result in [], which we now state, follows from a straightforward modication of the proof of Theorem.. 3
5 Theorem.3 (Wieand). If l is irrational, X l n ; EXl n ; 3 log n = converges in distribution to a standard normal random variable. If irrational of nite type, then EX l n = nl ; log n + O(): The outline of the paper is as follows. In Section we present some preliminary material on permutations and ergodic theory. In Section 3 prove the main result and, in Section 4, we relate this to the counting function X l n. Acknowledgments. The authors wish to thank Richard Arratia, Persi Diaconis, Chris Hughes and Jon Keating for invaluable assistance and encouragement while carrying out this research. Thanks also to Kelly Wieand for providing us with the preprint [] which enabled us to improve the presentation of this paper. l is Preliminaries. Permutations and the Feller coupling Given a permutation in the symmetric group S n the corresponding permutation matrix is, where i =((i) =). The permutation matrices form a subgroup of the unitary group. A random n by n permutation matrix is the matrix of a permutation chosen uniformly at random from S n. Let be an n-cycle and its permutation matrix. The characteristic polynomial of is (t) =t n ;. Suppose S n has cycle structure c c :::. Then (t) = Q n (t ; ) c. Let C (n) denote the numberofcyclesoflength in a random permutation of length n. The Feller coupling, see for example [], allows one to construct independent random variables Z on the same probability space as the C (n) in such away that Z is Poisson with mean =, and E for any complex sequence a. a (Z ; C (n)) n + 4 a
6 . Uniformly distributed sequences and discrepancy We need a number of results concerning uniformly distributed sequences which we collect together here. For a real number x we will write fxg for the fractional part of x A real sequence (x n ) n= is uniformly distributed if for all a<bwehave fn N : a<fx n g <bg lim = b ; a: N! N Lemma.. (x n ) is uniformly distributed if and only if for every properly f(t) dt Riemann integrable f dened on [,] we have N P N n= f(fx ng)! R Weyl's theorem states that if is irrational the sequence x n = fng is uniformly distributed. Let x =(x n ) n= be a real sequence. For I [ ] write A N(I) =fn N : fx n gig. The discrepancy (at the N th stage) is D N (x) = sup a<b A N([a b)) ; (b ; a) As one would expect, D N (x)! asn!precisely when x is uniformly distributed. For a proof of this (and other statements in this section) see Kuipers and Niederreiter [5]. We will nd it useful to consider a slightly restricted notion of discrepancy: D N(x) = sup <a N A N ([ a)) N ; a: This is equivalent (in the sense that D N D N D N ) but has the advantage of having a more convenient expression: if we order (fx n gg N as n= y ::: y N then DN(x) = max max nn yn ; n : y n ; n ; N N The discrepancy controls the rate of convergence R in Lemma.. The variation of a function f is dened to be V (f) = df(t), where df denotes the R Lebesgue-Stieltes measure of f on [,]. We have V (f) = f (t) dt when f is dierentiable. : 5
7 Theorem.. Koksma's inequality bounded variation V (f) and x =(x n ) n= N NX n= f(fx n g) ; Z Let f be a function on [ ] of be a real sequence. Then f(t) dt V (f)dn(x): We will be interested in the discrepancy of the sequence x n = fng, where = is an irrational in [,]. This will depend upon the extent to which can be approximated by rationals. For real let kk denote the distance from to the nearest integer. The type of is the value of which isthesupremum of those for which lim inf n knk =asn runs through the natural numbers. This implies that if m is less than the type of and C > is a constant there are an innite number of approximations by rationals satisfying ; p q C q m+ : A simple application of the pigeonhole principle shows that any irrational has typeatleast. It is possible that the type of equals innity if this is not the case is of nite type. Roughly speaking, small type implies small discrepancy. The set of Liouville numbers is dened by L = fx RnQ : 8n N 9q N : kqxk <q ;n g: It is easy to see that if a number is not of nite type, then it is in L. It is a classical result that L is a small set which has Hausdor dimension, []. For numbers of nite type we have a strong control on their discrepancy. Theorem.3. Let have nite type and let x n = fng. Then for every > we have D N (x) =O N ; +..3 Elementary analytic results We conclude with two elementary results. Lemma.4. Let (x k ) k= be a real sequence. Suppose n P n k= x k! L. Then log n P n k= x k k! L. 6
8 Finally we record a summation by parts formula. Lemma.5. Let (x k ) n P k= continuous derivative. Dene X(t) = kt x k. Then k= be a real sequence and y(t) a function with a x k y(k) =X(n)y(n) ; 3 Proof of the main result Z n X(t)y (t)dt: (.) In order to prove Theorem. we will consider the real and imaginary parts separately. First we observe that from the structure of random permutations, L Pn () = C (n)log(; e ;i ) and hence ReL Pn () = ImL Pn () = C (n)log ; e ;i (3.) C (n)arg(; e ;i ): (3.) We now use the Feller coupling to determine a set of conditions required for the weighted sums of cycle length random variables to have a central limit theorem. Lemma 3.. Let (a ) be real constants satisfying () n P n a! () P p n a log n!, (3) n P n ak! B k, for all k>, for some constants B k. Let A n = P n a C (n), where, as before, C (n) is the number of -cycles of a random permutation from S n. Then A n p B log n 7
9 converges in distribution to a standard normal random variable. If conditions () and (3) are satised, then A n ; EA n p B log n converges in distribution to a standard normal random variable. Proof: We will use the Feller coupling described in Section. Consider the sum An ~ P n = a Z where the Z are independent Poisson random variables with mean =. By hypothesis and the fact that k:k k:k, A n Ep B log n ; ~ An p B log n p B log n = a A! : The sequences A n and ~ An are thus asymptotically equivalent and we will work with ~ An for the rest of the proof. We consider the characteristic function n (t) =Ee it p ~An log n : As Ee itz e it ; =exp and the Z are independent, n (t) = exp We also have Taylor expansions cos n a plog e it n ; A : (3.3) a p t ; =; a t log n logn + a 3 t3 6log sin 3= n sin a p log n t = a t p log n ; a3 t3 6 log + a 3= n 4 t4 4 log n sin! 8
10 (for some <! <twhen t>). Substituting these into (3.3) we obtain a plog e it n ; p log n a A it log n a A t + I n with I n < C (t) log 3= n a 3 + C (t) log n a 4 where C (t) C (t) are constants depending on t only. Using condition (3) the error I n dened above tends to, as by Lemma., C (t) log n a 4 = C (t) log n and by Cauchy-Schwarz and Lemma., C (t) log 3= n a 3 C (t) log 3= n X We deduce from conditions () and () that a 6 lim n! n(t) =e ; B t a 4! = X n A =! : as required. The second part follows from the above: under conditions () and (3) we have! E exp it A n ; EA p n ~A n ; E An ~ E exp it p! e ; B t log n log n as n!. Proof of Main Theorem:. The imaginary part. We will use Lemma 3. with, by (3.), the values of the a given by r = arg( ; e ;i ): 9
11 Dene r(t) =arg(; e ;it )=( ; t): Then Z r k (t) dt = ( k k (k+) k even, k odd. This is a proper Riemann integral, so we can apply Lemma.. Together with Lemma.4 we have ( k k k even, (k+) lim n! log n r k = lim n! n r k = k odd. Thus we have established conditions () and (3) of Lemma 3.. This completes the proof of Theorem. (ii). To complete the proof of part (i) (in the imaginary case) we need only establish condition (), namely that p log n r! : As the function r(t) is bounded we can use Koksma's inequality and our estimate on the discrepancy in Theorem.3 to obtain a rate of convergence for the coecients of the imaginary part. Lemma 3.. For of nite type n P n r decays polynomially as n!. To complete the proof of the rst part of our main result we apply the summation by parts P formula (.) with x k = r k, y(t) =, to see that, for t n r of nite type, remains bounded as n!. Thus, in particular,! giving condition () of Lemma 3. as required. p log n P n r. The real part. We follow the same approach as for the imaginary part. values of a for the real part are From (3.) the q =log ; e ;i : Dene q(t) = log ; e ;it :
12 This is unbounded as t tends to or and thus Lemma. cannot be applied directly. We will show how to adapt the method, but rst we need to evaluate the q k integrals. Term by termintegration of the Fourier series gives Z q k (t)dt = Z = (;) k Z ; Re log ; ; e ;it k dt Re X m= = (;) k X m X m k e ;itm m! k dt Z cos m t:::cos m k tdt: m :::m k The interchange of integral and summation is a consequence of the dominated convergence theorem with dominating function (cos(t)) k. The cases k = give: Z q (t) dt = X m= Z Z m q(t) dt = cos mt dt = 6 = : In order to establish the conditions of Lemma 3. we require the following. Lemma 3.3. For of nite type n P n q decays polynomially to as n!. Proof: Let x n = fng for n N. As has nite type there are constants C m > such that knk > C n m 8n N. Fix N and let = C N m. Order (fx n g) N as n= y ::: y N and dene y =, y N + = ; (so y < y i <y N + for each i N.) Recall that q(t) = log ; e R ;it satises q(t) dt =. It is also (innitely) dierentiable in the open interval (,) and satises q( ; t) = q(t). (The second assertion is clear geometrically.) Consider the identity NX n= Z yn+ y n t ; n N q (t) dt = Z ; tq (t) dt ; N NX n= n q(y n+ ) ; q(y n ) : (3.4)
13 Integration by parts gives Z ; Using this in 3.4, we have NX n= Z yn+ y n t ; n N tq (t)dt = ( ; )q( ; ) ; q() ; = ( ; )q()+ q (t) dt = Z Z q(t) dt: Z ; q(t) dt ; q() q(t)dt + N NX n= q(y n ): (3.5) As in Koksma's inequality we can bound the modulus of the left hand side of (3.5) above by to deduce that N NX n= q(fx n g) D N D N Z ; Z ; q (t) dt q (t) dt + Z q(t) dt ; q() : As q(t) log t as t!, it is not hard to see that this expression can be bounded by C n for some C >. Using the same method it can be shown that n P n qk ; R qk (t) dt also decays polynomially to, for any k >. Thus we have conditions () and (3). The rate of decay is only important in the case k =, where it may be used to establish condition (). We may then complete the proof of the main theorem for the real case in the same way thatwe did for r(t). Remark: A closer inspection of the proof of Theorem. (i) will reveal that the nite type condition is actually stronger than necessary. For the imaginary part we required N (x) =o p log N. For the real part we require that there exists a function (N) such that D N (x)log(n) and (N) are both o p log N.
14 4 The counting function Let U be a unitary matrix and I a subinterval of the unit circle. The counting function X U (I) is the number of eigenvalues of U contained in I. The study of this function for various matrix groups is the subect of [] and []. There is a close relationship between the counting function and the imaginary part of L U and this allows us to relate the results we have obtained to the counting function, and to the results in [] and []. The connection between the characteristic polynomial and the counting function can be summarised by the following lemma. This is well-known. We include a proof in the appendix for completeness. Lemma 4.. Let U be a unitary matrix and I a subinterval of the unit circle whose endpoints e it e it X U (I) = n(t ; t ) are not eigenvalues of U. Then + Im L U (t ) ; L U (t ) Set X l n = X Pn (( e il ]). By Lemma 4., X l n = nl + F l n, where Fn l = Im L U (l) ; lim L U (t) = t# C (n) r ; : (4.) where, as before, the C (n) are the number of cycles of length, and the r =arg(; e ;il ) are the imaginary coecients for L U (l). We will apply a slightly modied version of Theorem 3. and take a = r ; =. Note that n n r ;!; (r ; )! + 4 = 3 and the averages of the higher powers of the a also converge to constants. This implies that X l n ; EX l n ; 3 log n = 3
15 converges to a standard normal variable. Finally, using our previous results about the behaviour of the r in the case where l= is of nite type, we have p log n r ; = X n log n r ; log n A! and hence EXn l = nl ; log n + O(): A Appendix Proof of Lemma 4. ; Recall that U (s) = det I ; U. If U is n by n unitary with eigenangles s ::: n then ny (;s) n (s) = e ;i k ; s = det U k= s Let satisfy = (;)n det U equation is and dene U(s) =s n= (s). Then the functional U ( s )= U(s): (A.) Remarks:. When n is odd wehave tomakeachoice of s n= in the domain we use (which will never encircle zero.). There is an intentional analogy with the Riemann zeta function, which we mention for the sake ofinterest. If one denes (s) = s(s ; );s= ; s (s) then we have the functional equation ( ; s) = (s). This expresses the symmetry of under reection in the half line the matrix equation expresses conugate symmetry of U under inversion in the unit circle. We use the following result of complex analysis: Lemma A.. Let D be a domain, f : D! C contour in D on which f is non-zero. Then i zeros of f inside C. 4 R C analytic and C a closed f (z) f (z) dz is the number of
16 Let U be a unitary matrix and I a subinterval of the unit circle whose endpoints e it e it are not eigenvalues of U. We apply this lemma to U, which has the same zeros as U on the unit circle. Our contour C is the boundary of the region fre it : r eit Ig. C falls naturally into two pieces that which is within the unit circle (C in ) and that which is without (C out.) Inversion in the circle takes C in to C out with the opposite orientation, so applying the functional equation, X U (I) = i Z C Z (s) U U (s) ds = Im C out (s) U U (s) ds: Our previous denition of L U (s) as a branch of log U (s) is on a domain containing C out. Within this we choose a neigbourhood of C out, a branch of log s in this neighbourhood and so construct log U (s) = log + n log s + L U (s). This is an indenite integral of the integrand considered above, and hence X U (I) = n(t ; t ) + Im L U (t ) ; L U (t ) : (A.) We can think of the second term on the right hand side as the deviation of the number of eigenvalues in I from the number you would expect if each eigenvalue was uniformly distributed on the circle. Remark: Suppose we xt and let t tend to an eigenangle t. Depending on the direction of approach theinterval I will either increase to an interval that is open at e it or decrease to an interval closed at e it. We thus have a dierence of the multiplicity of the eigenangle in the counting function this corresponds to the dierence of between the clockwise and anticlockwise limits of the imaginary part of L U approaching t. References [] Arratia, R., Barbour, A. D., and Tavare, S. (99) Poisson process approximation for the Ewens Sampling Formula. Ann. Appl. Probab., [] Besicovitch, A.S., Sets of fractional dimensions (IV): on rational approximation to real numbers, J. London Math. Soc., 9, 6{3, 934. [3] Bogomolny, E.B. and Keating, J.P., Random matrix theory and the Riemann zeros II: n-point correlations, Nonlinearity, 9, 9-935,
17 [4] Keating, J.P. and Snaith, N., Random matrix theory and (=+it). Preprint. [5] Kuipers, L. and Niederreiter, H., Uniform distribution of sequences, John Wiley and Sons, New York, 974. [6] Montgomery, H.L., The pair correlation of zeros of the zeta function, Proc. Symp. Pure Math. (AMS) 4, 8{93, 973. [7] Odlyzko, A., On the distribution of spacing between zeros of the zeta function, Math. Comp. 48, 73{38, 987. [8] Rudnick, Z. and Sarnak, P., The n-level correlations of zeros of the zeta function, C. R. Acad. Sci. Paris, Ser I, 39, 7{3, 994. [9] Selberg, A., Collected Papers,, 99 [] Wieand, K. L., Eigenvalue distributions of random matrices in the permutation group and compact Lie groups, Ph. D. Thesis, Harvard University, 998. [] Wieand, K. L., Eigenvalue distributions of random permutation matrices. Preprint. 6
The characteristic polynomial of a random permutation matrix
The characteristic polynomial of a random permutation matrix B. M. Hambly,2, Peter Keevash 3, Neil O Connell and Dudley Stark BRIMS, Hewlett-Packard Labs Bristol, BS34 8QZ, UK 2 Department of Mathematics,
More informationThe characteristic polynomial of a random permutation matrix
Stochastic Processes and their Applications 9 (2) 335 346 www.elsevier.com/locate/spa The characteristic polynomial of a random permutation matrix B.M. Hambly a;b, P. Keevash c, N. O Connell a;, D. Stark
More informationr"o' HEWLETT A Large Deviation Principle for the Order ofa Random Permutation ~lj PACKARD lip Laboratories Bristol
r"o' HEWLETT ~lj PACKARD A Large Deviation Principle for the Order ofa Random Permutation Neil 0'Connell Basic Research Institute in the Mathematical Sciences lip Laboratories Bristol HPL-BRIM:S-96-18
More informationMathematical Institute, University of Utrecht. The problem of estimating the mean of an observed Gaussian innite-dimensional vector
On Minimax Filtering over Ellipsoids Eduard N. Belitser and Boris Y. Levit Mathematical Institute, University of Utrecht Budapestlaan 6, 3584 CD Utrecht, The Netherlands The problem of estimating the mean
More informationMoments of the Riemann Zeta Function and Random Matrix Theory. Chris Hughes
Moments of the Riemann Zeta Function and Random Matrix Theory Chris Hughes Overview We will use the characteristic polynomial of a random unitary matrix to model the Riemann zeta function. Using this,
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationThe Pacic Institute for the Mathematical Sciences http://www.pims.math.ca pims@pims.math.ca Surprise Maximization D. Borwein Department of Mathematics University of Western Ontario London, Ontario, Canada
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 informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
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 informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationRectangular Young tableaux and the Jacobi ensemble
Rectangular Young tableaux and the Jacobi ensemble Philippe Marchal October 20, 2015 Abstract It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau
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 informationModelling large values of L-functions
Modelling large values of L-functions How big can things get? Christopher Hughes Exeter, 20 th January 2016 Christopher Hughes (University of York) Modelling large values of L-functions Exeter, 20 th January
More informationEigenvalues of the Laguerre Process as Non-colliding Squared Bessel Processes
Eigenvalues of the Laguerre Process as Non-colliding Squared Bessel Processes Wolfgang Konig, Neil O Connell Basic Research Institute in the Mathematical Science HP Laboratories Bristol HPL-BRIMS-200-07
More informationPart 3.3 Differentiation Taylor Polynomials
Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
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 informationPOLYNOMIALS WITH COEFFICIENTS FROM A FINITE SET
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 POLYNOMIALS WITH COEFFICIENTS FROM A FINITE SET PETER BORWEIN, TAMÁS ERDÉLYI, FRIEDRICH LITTMANN
More informationSTAT C206A / MATH C223A : Stein s method and applications 1. Lecture 31
STAT C26A / MATH C223A : Stein s method and applications Lecture 3 Lecture date: Nov. 7, 27 Scribe: Anand Sarwate Gaussian concentration recap If W, T ) is a pair of random variables such that for all
More informationA LeVeque-type lower bound for discrepancy
reprinted from Monte Carlo and Quasi-Monte Carlo Methods 998, H. Niederreiter and J. Spanier, eds., Springer-Verlag, 000, pp. 448-458. A LeVeque-type lower bound for discrepancy Francis Edward Su Department
More information4 Uniform convergence
4 Uniform convergence In the last few sections we have seen several functions which have been defined via series or integrals. We now want to develop tools that will allow us to show that these functions
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 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 informationNEWMAN S INEQUALITY FOR INCREASING EXPONENTIAL SUMS
NEWMAN S INEQUALITY FOR INCREASING EXPONENTIAL SUMS Tamás Erdélyi Dedicated to the memory of George G Lorentz Abstract Let Λ n := {λ 0 < λ < < λ n } be a set of real numbers The collection of all linear
More informationPart IB. Further Analysis. Year
Year 2004 2003 2002 2001 10 2004 2/I/4E Let τ be the topology on N consisting of the empty set and all sets X N such that N \ X is finite. Let σ be the usual topology on R, and let ρ be the topology on
More informationComputations related to the Riemann Hypothesis
Computations related to the Riemann Hypothesis William F. Galway Department of Mathematics Simon Fraser University Burnaby BC V5A 1S6 Canada wgalway@cecm.sfu.ca http://www.cecm.sfu.ca/personal/wgalway
More informationCUT-OFF FOR QUANTUM RANDOM WALKS. 1. Convergence of quantum random walks
CUT-OFF FOR QUANTUM RANDOM WALKS AMAURY FRESLON Abstract. We give an introduction to the cut-off phenomenon for random walks on classical and quantum compact groups. We give an example involving random
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationMATH 311: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE
MATH 3: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE Recall the Residue Theorem: Let be a simple closed loop, traversed counterclockwise. Let f be a function that is analytic on and meromorphic inside. Then
More information. Consider the linear system dx= =! = " a b # x y! : (a) For what values of a and b do solutions oscillate (i.e., do both x(t) and y(t) pass through z
Preliminary Exam { 1999 Morning Part Instructions: No calculators or crib sheets are allowed. Do as many problems as you can. Justify your answers as much as you can but very briey. 1. For positive real
More informationThe maximum of the characteristic polynomial for a random permutation matrix
The maximum of the characteristic polynomial for a random permutation matrix Random Matrices and Free Probability Workshop IPAM, 2018/05/16 Nick Cook, UCLA Based on joint work with Ofer Zeitouni Model
More informationA scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations
Journal of Statistical Planning and Inference 18 (22) 85 97 www.elsevier.com/locate/jspi A scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations J. Fortiana,
More informationA Smorgasbord of Applications of Fourier Analysis to Number Theory
A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationPolyGamma Functions of Negative Order
Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science -998 PolyGamma Functions of Negative Order Victor S. Adamchik Carnegie Mellon University Follow
More informationON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS. C φ 2 e = lim sup w 1
ON COMPACTNESS OF THE DIFFERENCE OF COMPOSITION OPERATORS PEKKA NIEMINEN AND EERO SAKSMAN Abstract. We give a negative answer to a conjecture of J. E. Shapiro concerning compactness of the dierence of
More informationReview of complex analysis in one variable
CHAPTER 130 Review of complex analysis in one variable This gives a brief review of some of the basic results in complex analysis. In particular, it outlines the background in single variable complex analysis
More informationQuantitative Oppenheim theorem. Eigenvalue spacing for rectangular billiards. Pair correlation for higher degree diagonal forms
QUANTITATIVE DISTRIBUTIONAL ASPECTS OF GENERIC DIAGONAL FORMS Quantitative Oppenheim theorem Eigenvalue spacing for rectangular billiards Pair correlation for higher degree diagonal forms EFFECTIVE ESTIMATES
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 informationPhysics 307. Mathematical Physics. Luis Anchordoqui. Wednesday, August 31, 16
Physics 307 Mathematical Physics Luis Anchordoqui 1 Bibliography L. A. Anchordoqui and T. C. Paul, ``Mathematical Models of Physics Problems (Nova Publishers, 2013) G. F. D. Duff and D. Naylor, ``Differential
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationMonte Carlo Methods for Statistical Inference: Variance Reduction Techniques
Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques Hung Chen hchen@math.ntu.edu.tw Department of Mathematics National Taiwan University 3rd March 2004 Meet at NS 104 On Wednesday
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationMinimum and maximum values *
OpenStax-CNX module: m17417 1 Minimum and maximum values * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 In general context, a
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationCharacteristic Functions and the Central Limit Theorem
Chapter 6 Characteristic Functions and the Central Limit Theorem 6.1 Characteristic Functions 6.1.1 Transforms and Characteristic Functions. There are several transforms or generating functions used in
More informationAsymptotic results for empirical measures of weighted sums of independent random variables
Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Workshop on Limit Theorems, University Paris 1 Paris, January
More informationAn inverse of Sanov s theorem
An inverse of Sanov s theorem Ayalvadi Ganesh and Neil O Connell BRIMS, Hewlett-Packard Labs, Bristol Abstract Let X k be a sequence of iid random variables taking values in a finite set, and consider
More informationTheorem 1 can be improved whenever b is not a prime power and a is a prime divisor of the base b. Theorem 2. Let b be a positive integer which is not
A RESULT ON THE DIGITS OF a n R. Blecksmith*, M. Filaseta**, and C. Nicol Dedicated to the memory of David R. Richman. 1. Introduction Let d r d r,1 d 1 d 0 be the base b representation of a positive integer
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationALMOST ODD RANDOM SUM-FREE SETS NEIL J. CALKIN AND P. J. CAMERON. 1. introduction
ALMOST ODD RANDOM SUM-FREE SETS NEIL J. CALKIN AND P. J. CAMERON Abstract. We show that if S 1 is a strongly complete sum-free set of positive integers, and if S 0 is a nite sum-free set, then with positive
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 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 informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationOn reaching head-to-tail ratios for balanced and unbalanced coins
Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental
More informationRiemann Zeta Function and Prime Number Distribution
Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................
More information2 JAKOBSEN, JENSEN, JNDRUP AND ZHANG Let U q be a quantum group dened by a Cartan matrix of type A r together with the usual quantized Serre relations
QUADRATIC ALGEBRAS OF TYPE AIII; I HANS PLESNER JAKOBSEN, ANDERS JENSEN, SREN JNDRUP, AND HECHUN ZHANG 1;2 Department of Mathematics, Universitetsparken 5 DK{2100 Copenhagen, Denmark E-mail: jakobsen,
More informationMath 259: Introduction to Analytic Number Theory More about the Gamma function
Math 59: Introduction to Analytic Number Theory More about the Gamma function We collect some more facts about Γs as a function of a complex variable that will figure in our treatment of ζs and Ls, χ.
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationMath 220A Homework 4 Solutions
Math 220A Homework 4 Solutions Jim Agler 26. (# pg. 73 Conway). Prove the assertion made in Proposition 2. (pg. 68) that g is continuous. Solution. We wish to show that if g : [a, b] [c, d] C is a continuous
More information1 Holomorphic functions
Robert Oeckl CA NOTES 1 15/09/2009 1 1 Holomorphic functions 11 The complex derivative The basic objects of complex analysis are the holomorphic functions These are functions that posses a complex derivative
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationDirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:
Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there
More informationf(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v
MA525 ON CAUCHY'S THEOREM AND GREEN'S THEOREM DAVID DRASIN (EDITED BY JOSIAH YODER) 1. Introduction No doubt the most important result in this course is Cauchy's theorem. Every critical theorem in the
More informationCircuit depth relative to a random oracle. Peter Bro Miltersen. Aarhus University, Computer Science Department
Circuit depth relative to a random oracle Peter Bro Miltersen Aarhus University, Computer Science Department Ny Munkegade, DK 8000 Aarhus C, Denmark. pbmiltersen@daimi.aau.dk Keywords: Computational complexity,
More informationCONVERGENCE OF ZETA FUNCTIONS OF GRAPHS. Introduction
CONVERGENCE OF ZETA FUNCTIONS OF GRAPHS BRYAN CLAIR AND SHAHRIAR MOKHTARI-SHARGHI Abstract. The L 2 -zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension.
More informationREPORTRAPPORT. Centrum voor Wiskunde en Informatica. Asymptotics of zeros of incomplete gamma functions. N.M. Temme
Centrum voor Wiskunde en Informatica REPORTRAPPORT Asymptotics of zeros of incomplete gamma functions N.M. Temme Department of Analysis, Algebra and Geometry AM-R9402 994 Asymptotics of Zeros of Incomplete
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationCurves I: Curvature and Torsion. Table of contents
Math 48 Fall 07 Curves I: Curvature and Torsion Disclaimer. As we have a textbook, this lecture note is for guidance and sulement only. It should not be relied on when rearing for exams. In this lecture
More informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
More informationGAPS BETWEEN LOGS JENS MARKLOF AND ANDREAS STRÖMBERGSSON
GAPS BETWEE LOGS JES MARKLOF AD ADREAS STRÖMBERGSSO Abstract. We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationUPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE
uniform distribution theory DOI: 055/udt-207 002 Unif Distrib Theory 2 207), no2, 24 UPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE Christopher J White ABSTRACT We consider a class of double
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationarxiv: v2 [math.pr] 2 Nov 2009
arxiv:0904.2958v2 [math.pr] 2 Nov 2009 Limit Distribution of Eigenvalues for Random Hankel and Toeplitz Band Matrices Dang-Zheng Liu and Zheng-Dong Wang School of Mathematical Sciences Peking University
More informationStochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier.
Ito 8-646-8 Calculus I Geneviève Gauthier HEC Montréal Riemann Ito The Ito The theories of stochastic and stochastic di erential equations have initially been developed by Kiyosi Ito around 194 (one of
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 informationSemi-strongly asymptotically non-expansive mappings and their applications on xed point theory
Hacettepe Journal of Mathematics and Statistics Volume 46 (4) (2017), 613 620 Semi-strongly asymptotically non-expansive mappings and their applications on xed point theory Chris Lennard and Veysel Nezir
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationPERIOD FUNCTIONS AND THE SELBERG ZETA FUNCTION FOR THE MODULAR GROUP. John Lewis and Don Zagier
PERIOD FUNCTIONS AND THE SELBERG ZETA FUNCTION FOR THE MODULAR GROUP John Lewis and Don Zagier The Selberg trace formula on a Riemann surface X connects the discrete spectrum of the Laplacian with the
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationProperties of Arithmetical Functions
Properties of Arithmetical Functions Zack Clark Math 336, Spring 206 Introduction Arithmetical functions, as dened by Delany [2], are the functions f(n) that take positive integers n to complex numbers.
More informationSUMMABILITY OF ALTERNATING GAP SERIES
Proceedings of the Edinburgh Mathematical Society (2000) 43, 95-101 SUMMABILITY OF ALTERNATING GAP SERIES J. P. KEATING 1 AND J. B. READE 2 1 School of Mathematics, University of Bristol, Bristol BS8 1TW,
More information1. Introduction. Consider a single cell in a mobile phone system. A \call setup" is a request for achannel by an idle customer presently in the cell t
Heavy Trac Limit for a Mobile Phone System Loss Model Philip J. Fleming and Alexander Stolyar Motorola, Inc. Arlington Heights, IL Burton Simon Department of Mathematics University of Colorado at Denver
More information8 Periodic Linear Di erential Equations - Floquet Theory
8 Periodic Linear Di erential Equations - Floquet Theory The general theory of time varying linear di erential equations _x(t) = A(t)x(t) is still amazingly incomplete. Only for certain classes of functions
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationMATH 104 : Final Exam
MATH 104 : Final Exam 10 May, 2017 Name: You have 3 hours to answer the questions. You are allowed one page (front and back) worth of notes. The page should not be larger than a standard US letter size.
More information20 ZIAD ZAHREDDINE For some interesting relationships between these two types of stability: Routh- Hurwitz for continuous-time and Schur-Cohn for disc
SOOCHOW JOURNAL OF MATHEMATICS Volume 25, No. 1, pp. 19-28, January 1999 ON SOME PROPERTIES OF HURWITZ POLYNOMIALS WITH APPLICATION TO STABILITY THEORY BY ZIAD ZAHREDDINE Abstract. Necessary as well as
More information