DOCSLIB.ORG

Extreme Points of the Vandermonde Determinant and Phenomenological Modelling with Power Exponential Functions 2019 Isbn 978-91-7485-431-2 Issn 1651-4238 P.O

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Extreme Points of the Vandermonde Determinant and Phenomenological Modelling with Power Exponential Functions 2019 Isbn 978-91-7485-431-2 Issn 1651-4238 P.O Mälardalen University Doctoral Dissertation 293 Karl Lundengård Lundengård Karl Extreme points of the Vandermonde determinant and phenomenological EXTREME POINTS OF THE VANDERMONDE DETERMINANT AND PHENOMENOLOGICAL MODELLING WITH POWER EXPONENTIAL FUNCTIONS modelling with power exponential functions Karl Lundengård Address: P.O. Box 883, SE-721 23 Västerås. Sweden ISBN 978-91-7485-431-2 Address: P.O. Box 325, SE-631 05 Eskilstuna. Sweden E-mail: [email protected] Web: www.mdh.se ISSN 1651-4238 2019 1 Mälardalen University Press Dissertations No. 293 EXTREME POINTS OF THE VANDERMONDE DETERMINANT AND PHENOMENOLOGICAL MODELLING WITH POWER EXPONENTIAL FUNCTIONS Karl Lundengård 2019 School of Education, Culture and Communication 2 Copyright © Karl Lundengård, 2019 ISBN 978-91-7485-431-2 ISSN 1651-4238 Printed by E-Print AB, Stockholm, Sweden 3 Mälardalen University Press Dissertations No. 293 EXTREME POINTS OF THE VANDERMONDE DETERMINANT AND PHENOMENOLOGICAL MODELLING WITH POWER EXPONENTIAL FUNCTIONS Karl Lundengård Akademisk avhandling som för avläggande av filosofie doktorsexamen i matematik/tillämpad matematik vid Akademin för utbildning, kultur och kommunikation kommer att offentligen försvaras torsdagen den 26 september 2019, 13.15 i Delta, Mälardalens högskola, Västerås. Fakultetsopponent: Professor Palle Jorgensen, University of Iowa Akademin för utbildning, kultur och kommunikation 4 Abstract This thesis discusses two topics, finding the extreme points of the Vandermonde determinant on various surfaces and phenomenological modelling using power-exponential functions. The relation between these two problems is that they are both related to methods for curve-fitting. Two applications of the mathematical models and methods are also discussed, modelling of electrostatic discharge currents for use in electromagnetic compatibility and modelling of mortality rates for humans. Both the construction and evaluation of models is discussed. In the first chapter the basic theory for later chapters is introduced. First the Vandermonde matrix, a matrix whose rows (or columns) consists of monomials of sequential powers, its history and some of its properties are discussed. Next, some considerations and typical methods for a common class of curve fitting problems are presented, as well as how to analyse and evaluate the resulting fit. In preparation for the later parts of the thesis the topics of electromagnetic compatibility and mortality rate modelling are briefly introduced. The second chapter discusses some techniques for finding the extreme points for the determinant of the Vandermonde matrix on various surfaces including spheres, ellipsoids and cylinders. The discussion focuses on low dimensions, but some results are given for arbitrary (finite) dimensions. In the third chapter a particular model called the p-peaked Analytically Extended Function (AEF) is introduced and fitted to data taken either from a standard for electromagnetic compatibility or experimental measurements. The discussion here is entirely focused on currents originating from lightning or electrostatic discharges. The fourth chapter consists of a comparison of several different methods for modelling mortality rates, including a model constructed in a similar way to the AEF found in the third chapter. The models are compared with respect to how well they can be fitted to estimated mortality rate for several countries and several years and the results when using the fitted models for mortality rate forecasting is also compared. ISBN 978-91-7485-431-2 ISSN 1651-4238 5 Acknowledgements Many thanks to all my coauthors and supervisors. My main supervisor, Pro- fessor Sergei Silvestrov, introduced me to the Vandermonde matrix and fre- quently suggested new problems and research directions throughout my time as a doctoral student. I have learned many lessons about mathematics and academia from him and my co-supervisor Professor Anatoliy Malyarenko. My other co-supervisor Dr. Milica Ranˇci´cplayed a crucial role and she is a role model with regards to conscientiousness, work ethic, communication and patience. I have learned invaluable lessons about interdisciplinary re- search, communication and time and resource management from her. I also want to thank Dr. Vesna Javor for her regular input that improved the research on electromagnetic compatibility considerably. Cooperating with other doctoral students was very valuable. Jonas Osterberg¨ and Asaph Keikara Muhumuza (with support from his super- visors Dr. John M. Mango and Dr. Godwin Kakuba) made important contributions to the research on the Vandermonde determinant and Samya Suleiman's understanding of mortality rate forecasting and other aspects of actuarial mathematics was necessary for the work to progress. I am also glad that I had the opportunity to take part in the supervision of talented master students Andromachi Boulogari and Belinda Strass and use the foundations they laid in their degree projects for further research. Many thanks to all my coworkers at M¨alardalenUniversity, especially to Dr. Christopher Engstr¨om,Dr. Johan Richter and Docent Linus Carls- son for managing the bachelor's and master's programmes in Engineering mathematics together with me. Perhaps most importantly, I thank my family for all the support, en- couragement and assistance you have given me. A special mention to my sister for help with translating from 18th century French, it is perfectly un- derstandable that you decided to move to the other side of the Earth after that. I will wonder my whole life how my father, whose entire mathematics career consisted of unsuccessfully solving a single problem on the blackboard in 9th grade, would have reacted to this dissertation if he were still with us. Fortunately my mother continues to be an endless source of support and encouragement. I am continually surprised and delighted over how much of her work ethics, sense of quality and unhealthy work habits I seem to have inherited from her. Without the ideas, requests, remarks, questions, encouragements and patience of those around me this work would not have been completed. Karl Lundeng˚ard V¨aster˚as, September, 2019 3 6 Extreme points of the Vandermonde determinant and phenomenological modelling with power-exponential functions Popul¨arvetenskaplig sammanfattning Det finns m˚angaf¨oreteelser i v¨arldensom det ¨ar¨onskv¨artatt beskriva med en matematisk modell. I b¨astafall kan modellen h¨arledasifr˚anl¨amplig grundl¨aggandeteori men ibland ¨ardet inte m¨ojligtatt g¨oradet, antingen d¨arf¨oratt det inte finns n˚agonv¨alutvecklad teori eller f¨oratt den teori som finns kr¨aver information som inte ¨artillg¨anglig. I detta fall s˚abeh¨ovsen modell som, i n˚agonm˚an,st¨ammer ¨overens med teori och empiriska observa- tioner men som inte ¨arh¨arleddfr˚anden grundl¨aggandeteorin. S˚adana mod- eller kallas f¨orfenomenologiska modeller. I denna avhandling konstrueras fenomenologiska modeller av tv˚aolika fenomen, str¨ommeni elektrostatiska urladdningar och d¨odsrisk. Elektrostatiska urladdningar sker n¨arladdning snabbt fl¨odarfr˚anett objekt till ett annat. V¨albekanta exempel ¨arblixtnedslag eller sm˚ast¨otar orsakade av statisk elektricitet. F¨oringenj¨orer¨ardet viktigt att kunna beskriva denna typ av elektriska str¨ommarf¨oratt se till att elektroniska system inte ¨arf¨ork¨ansligaf¨orelektromagnetisk p˚averkan utifr˚anoch att de inte st¨orandra system d˚ade anv¨ands. D¨odsrisken beskriver sannolikheten f¨ord¨odvid en viss ˚alder.Den kan anv¨andasf¨oratt uppskatta livskvaliteten i ett land eller andra demografiska eller f¨ors¨akringsrelaterade¨andam˚al. En egenskap hos b˚adeelektrostatiska urladdningar och d¨odsrisksom kan vara utmanande att modellera ¨aromr˚adend¨aren brant ¨okningf¨oljs av en l˚angsams¨ankning.S˚adanam¨onsterf¨orekommer ofta i elektrostatiska urladdningar och i m˚angal¨ander¨okar d¨odsrisken kraftigt vid ¨overg˚angen fr˚anbarn till vuxen och f¨or¨andrassedan l˚angsamt fram till tidig medel˚alder. I denna avhandling anv¨andsen matematisk funktion som kallas poten- sexponentialfunktionen som en byggsten f¨oratt konstruera fenomenologiska modeller av str¨ommeni elektrostatiska urladdningar samt d¨odsriskutifr˚an empiriska data f¨orrespektive fenomen. F¨orelektrostatiska urladdningar f¨oresl˚asen metod som kan konstruera modeller med olika noggrannhet och komplexitet. F¨ord¨odsrisker f¨oresl˚asn˚agraenkla modeller som sedan j¨amf¨ors med tidigare f¨oreslagnamodeller. I avhandlingen diskuteras ocks˚aextrempunkterna hos Vandermonde de- terminanten. Detta ¨arett matematiskt problem som f¨orekommer inom flera olika omr˚adenmen f¨oravhandlingen ¨arden mest relevanta till¨ampningen att extrempunkterna kan hj¨alpatill att v¨aljal¨ampligadata att anv¨anda n¨ar man konstruerar modeller med hj¨alpav en teknik som kallas f¨oroptimal design. N˚agraallm¨annaresultat f¨orhur extrempunkterna kan hittas p˚adi- verse ytor, t.ex. sf¨areroch kuber, presenteras och det ges exempel p˚ahur resultaten kan till¨ampas. 4 7 Popular science summary There are many phenomena in the world that it is desirable to describe using a mathematical model. Ideally the mathematical model is derived from the appropriate fundamental theory but sometimes this is not feasible, either because the fundamental theory is not well understood or because the theory requires a lot of information to be applicable. In these cases it is necessary to create a model that, to some degree, matches the fundamental theory and the empirical observations, but is not derived from the fundamental theory.
Load more

Recommended publications
  • 1111: Linear Algebra I
    1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 11 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 11 1 / 13 Previously on. Theorem. Let A be an n × n-matrix, and b a vector with n entries. The following statements are equivalent: (a) the homogeneous system Ax = 0 has only the trivial solution x = 0; (b) the reduced row echelon form of A is In; (c) det(A) 6= 0; (d) the matrix A is invertible; (e) the system Ax = b has exactly one solution. A very important consequence (finite dimensional Fredholm alternative): For an n × n-matrix A, the system Ax = b either has exactly one solution for every b, or has infinitely many solutions for some choices of b and no solutions for some other choices. In particular, to prove that Ax = b has solutions for every b, it is enough to prove that Ax = 0 has only the trivial solution. Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 11 2 / 13 An example for the Fredholm alternative Let us consider the following question: Given some numbers in the first row, the last row, the first column, and the last column of an n × n-matrix, is it possible to fill the numbers in all the remaining slots in a way that each of them is the average of its 4 neighbours? This is the \discrete Dirichlet problem", a finite grid approximation to many foundational questions of mathematical physics. Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 11 3 / 13 An example for the Fredholm alternative For instance, for n = 4 we may face the following problem: find a; b; c; d to put in the matrix 0 4 3 0 1:51 B 1 a b -1C B C @0:5 c d 2 A 2:1 4 2 1 so that 1 a = 4 (3 + 1 + b + c); 1 8b = 4 (a + 0 - 1 + d); >c = 1 (a + 0:5 + d + 4); > 4 < 1 d = 4 (b + c + 2 + 2): > > This is a system with 4:> equations and 4 unknowns.
    [Show full text]
  • The Many Faces of Alternating-Sign Matrices
    The many faces of alternating-sign matrices James Propp Department of Mathematics University of Wisconsin – Madison, Wisconsin, USA [email protected] August 15, 2002 Abstract I give a survey of different combinatorial forms of alternating-sign ma- trices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three- colorings, monotone triangles, tetrahedral order ideals, square ice, gasket- and-basket tilings and full packings of loops. (This article has been pub- lished in a conference edition of the journal Discrete Mathematics and Theo- retical Computer Science, entitled “Discrete Models: Combinatorics, Com- putation, and Geometry,” edited by R. Cori, J. Mazoyer, M. Morvan, and R. Mosseri, and published in July 2001 in cooperation with le Maison de l’Informatique et des Mathematiques´ Discretes,` Paris, France: ISSN 1365- 8050, http://dmtcs.lori.fr.) 1 Introduction An alternating-sign matrix of order n is an n-by-n array of 0’s, 1’s and 1’s with the property that in each row and each column, the non-zero entries alter- nate in sign, beginning and ending with a 1. For example, Figure 1 shows an Supported by grants from the National Science Foundation and the National Security Agency. 1 alternating-sign matrix (ASM for short) of order 4. 0 100 1 1 10 0001 0 100 Figure 1: An alternating-sign matrix of order 4. Figure 2 exhibits all seven of the ASMs of order 3. 001 001 0 10 0 10 0 10 100 001 1 1 1 100 0 10 100 0 10 0 10 100 100 100 001 0 10 001 0 10 001 Figure 2: The seven alternating-sign matrices of order 3.
    [Show full text]
  • Lecture 13: Simple Linear Regression in Matrix Format
    11:55 Wednesday 14th October, 2015 See updates and corrections at http://www.stat.cmu.edu/~cshalizi/mreg/ Lecture 13: Simple Linear Regression in Matrix Format 36-401, Section B, Fall 2015 13 October 2015 Contents 1 Least Squares in Matrix Form 2 1.1 The Basic Matrices . .2 1.2 Mean Squared Error . .3 1.3 Minimizing the MSE . .4 2 Fitted Values and Residuals 5 2.1 Residuals . .7 2.2 Expectations and Covariances . .7 3 Sampling Distribution of Estimators 8 4 Derivatives with Respect to Vectors 9 4.1 Second Derivatives . 11 4.2 Maxima and Minima . 11 5 Expectations and Variances with Vectors and Matrices 12 6 Further Reading 13 1 2 So far, we have not used any notions, or notation, that goes beyond basic algebra and calculus (and probability). This has forced us to do a fair amount of book-keeping, as it were by hand. This is just about tolerable for the simple linear model, with one predictor variable. It will get intolerable if we have multiple predictor variables. Fortunately, a little application of linear algebra will let us abstract away from a lot of the book-keeping details, and make multiple linear regression hardly more complicated than the simple version1. These notes will not remind you of how matrix algebra works. However, they will review some results about calculus with matrices, and about expectations and variances with vectors and matrices. Throughout, bold-faced letters will denote matrices, as a as opposed to a scalar a. 1 Least Squares in Matrix Form Our data consists of n paired observations of the predictor variable X and the response variable Y , i.e., (x1; y1);::: (xn; yn).
    [Show full text]
  • Introducing the Game Design Matrix: a Step-By-Step Process for Creating Serious Games
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-2020 Introducing the Game Design Matrix: A Step-by-Step Process for Creating Serious Games Aaron J. Pendleton Follow this and additional works at: https://scholar.afit.edu/etd Part of the Educational Assessment, Evaluation, and Research Commons, Game Design Commons, and the Instructional Media Design Commons Recommended Citation Pendleton, Aaron J., "Introducing the Game Design Matrix: A Step-by-Step Process for Creating Serious Games" (2020). Theses and Dissertations. 4347. https://scholar.afit.edu/etd/4347 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. INTRODUCING THE GAME DESIGN MATRIX: A STEP-BY-STEP PROCESS FOR CREATING SERIOUS GAMES THESIS Aaron J. Pendleton, Captain, USAF AFIT-ENG-MS-20-M-054 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this document are those of the author and do not reflect the official policy or position of the United States Air Force, the United States Department of Defense or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENG-MS-20-M-054 INTRODUCING THE GAME DESIGN MATRIX: A STEP-BY-STEP PROCESS FOR CREATING LEARNING OBJECTIVE BASED SERIOUS GAMES THESIS Presented to the Faculty Department of Electrical and Computer Engineering Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in Partial Fulfillment of the Requirements for the Degree of Master of Science in Cyberspace Operations Aaron J.
    [Show full text]
  • The Many Faces of Alternating-Sign Matrices
    The many faces of alternating-sign matrices James Propp∗ Department of Mathematics University of Wisconsin – Madison, Wisconsin, USA [email protected] June 1, 2018 Abstract I give a survey of different combinatorial forms of alternating-sign ma- trices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three- colorings, monotone triangles, tetrahedral order ideals, square ice, gasket- and-basket tilings and full packings of loops. (This article has been pub- lished in a conference edition of the journal Discrete Mathematics and Theo- retical Computer Science, entitled “Discrete Models: Combinatorics, Com- putation, and Geometry,” edited by R. Cori, J. Mazoyer, M. Morvan, and R. Mosseri, and published in July 2001 in cooperation with le Maison de l’Informatique et des Math´ematiques Discr`etes, Paris, France: ISSN 1365- 8050, http://dmtcs.lori.fr.) 1 Introduction arXiv:math/0208125v1 [math.CO] 15 Aug 2002 An alternating-sign matrix of order n is an n-by-n array of 0’s, +1’s and −1’s with the property that in each row and each column, the non-zero entries alter- nate in sign, beginning and ending with a +1. For example, Figure 1 shows an ∗Supported by grants from the National Science Foundation and the National Security Agency. 1 alternating-sign matrix (ASM for short) of order 4. 0 +1 0 0 +1 −1 +1 0 0 0 0 +1 0 +1 0 0 Figure 1: An alternating-sign matrix of order 4. Figure 2 exhibits all seven of the ASMs of order 3.
    [Show full text]
  • Stat 5102 Notes: Regression
    Stat 5102 Notes: Regression Charles J. Geyer April 27, 2007 In these notes we do not use the “upper case letter means random, lower case letter means nonrandom” convention. Lower case normal weight letters (like x and β) indicate scalars (real variables). Lowercase bold weight letters (like x and β) indicate vectors. Upper case bold weight letters (like X) indicate matrices. 1 The Model The general linear model has the form p X yi = βjxij + ei (1.1) j=1 where i indexes individuals and j indexes different predictor variables. Ex- plicit use of (1.1) makes theory impossibly messy. We rewrite it as a vector equation y = Xβ + e, (1.2) where y is a vector whose components are yi, where X is a matrix whose components are xij, where β is a vector whose components are βj, and where e is a vector whose components are ei. Note that y and e have dimension n, but β has dimension p. The matrix X is called the design matrix or model matrix and has dimension n × p. As always in regression theory, we treat the predictor variables as non- random. So X is a nonrandom matrix, β is a nonrandom vector of unknown parameters. The only random quantities in (1.2) are e and y. As always in regression theory the errors ei are independent and identi- cally distributed mean zero normal. This is written as a vector equation e ∼ Normal(0, σ2I), where σ2 is another unknown parameter (the error variance) and I is the identity matrix. This implies y ∼ Normal(µ, σ2I), 1 where µ = Xβ.
    [Show full text]
  • Mathematician Awarded Nobel Prize Growing Optimism That Fermat's
    THE NEWSLETTER OF THE MATHEMATICAL ASSOCIATION OF AMERICA Mathematician Awarded Nobel Prize Volume 14, Number 6 Keith Devlin The awarding of the Nobel Prize in econom­ It was the application ics to the American John Nash on October of Nash's work in eco­ II th meant that for the firsttime in the 93-year nomic theory that led to history of the Nobel Prizes, the prize was his recent Nobel Prize, In this Issue awarded for work in pure mathematics. which he shares with fellow American John When the Swedish chemist, engineer, and phi­ Harsanyi and German 3 MAA Secretary's lanthropistAlfred Bernhard Nobel established Reinhard Selten. Report the awards in 1901, he stipulated chemistry, Nash's contribution to physics, physiology and medicine, and litera­ the combined work ture, but did not create a prize for mathematics. 4 Joint Mathematics which won the award It has been rumored that a particularly bad was in game theory. Meetings Update experience in mathematics at high school led to this exclusion of the "queen of sciences", or Nash's key idea-known nowadays as Nash 6 Search Committee it may simply be that Nobel felt that math­ equilibrium-was developed in his Ph.D. the­ Diary ematics was not, in itself, of sufficient sis submitted to the Princeton University relevance to human development to warrant Mathematics Department in 1950, when Nash its own award. Whateverthe reason, the math­ was just 22 years old. The thesis had taken him 10 Networks in ematicians have had to make do with their a mere two years to complete.
    [Show full text]
  • Uncertainty of the Design and Covariance Matrices in Linear Statistical Model*
    Acta Univ. Palacki. Olomuc., Fac. rer. nat., Mathematica 48 (2009) 61–71 Uncertainty of the design and covariance matrices in linear statistical model* Lubomír KUBÁČEK 1, Jaroslav MAREK 2 Department of Mathematical Analysis and Applications of Mathematics, Faculty of Science, Palacký University, tř. 17. listopadu 12, 771 46 Olomouc, Czech Republic 1e-mail: [email protected] 2e-mail: [email protected] (Received January 15, 2009) Abstract The aim of the paper is to determine an influence of uncertainties in design and covariance matrices on estimators in linear regression model. Key words: Linear statistical model, uncertainty, design matrix, covariance matrix. 2000 Mathematics Subject Classification: 62J05 1 Introduction Uncertainties in entries of design and covariance matrices influence the variance of estimators and cause their bias. A problem occurs mainly in a linearization of nonlinear regression models, where the design matrix is created by deriva- tives of some functions. The question is how precise must these derivatives be. Uncertainties of covariance matrices must be suppressed under some reasonable bound as well. The aim of the paper is to give the simple rules which enables us to decide how many ciphers an entry of the mentioned matrices must be consisted of. *Supported by the Council of Czech Government MSM 6 198 959 214. 61 62 Lubomír KUBÁČEK, Jaroslav MAREK 2 Symbols used In the following text a linear regression model (in more detail cf. [2]) is denoted as k Y ∼n (Fβ, Σ), β ∈ R , (1) where Y is an n-dimensional random vector with the mean value E(Y) equal to Fβ and with the covariance matrix Var(Y)=Σ.ThesymbolRk means the k-dimensional linear vector space.
    [Show full text]
  • Alternating Sign Matrices and Polynomiography
    Alternating Sign Matrices and Polynomiography Bahman Kalantari Department of Computer Science Rutgers University, USA [email protected] Submitted: Apr 10, 2011; Accepted: Oct 15, 2011; Published: Oct 31, 2011 Mathematics Subject Classifications: 00A66, 15B35, 15B51, 30C15 Dedicated to Doron Zeilberger on the occasion of his sixtieth birthday Abstract To each permutation matrix we associate a complex permutation polynomial with roots at lattice points corresponding to the position of the ones. More generally, to an alternating sign matrix (ASM) we associate a complex alternating sign polynomial. On the one hand visualization of these polynomials through polynomiography, in a combinatorial fashion, provides for a rich source of algo- rithmic art-making, interdisciplinary teaching, and even leads to games. On the other hand, this combines a variety of concepts such as symmetry, counting and combinatorics, iteration functions and dynamical systems, giving rise to a source of research topics. More generally, we assign classes of polynomials to matrices in the Birkhoff and ASM polytopes. From the characterization of vertices of these polytopes, and by proving a symmetry-preserving property, we argue that polynomiography of ASMs form building blocks for approximate polynomiography for polynomials corresponding to any given member of these polytopes. To this end we offer an algorithm to express any member of the ASM polytope as a convex of combination of ASMs. In particular, we can give exact or approximate polynomiography for any Latin Square or Sudoku solution. We exhibit some images. Keywords: Alternating Sign Matrices, Polynomial Roots, Newton’s Method, Voronoi Diagram, Doubly Stochastic Matrices, Latin Squares, Linear Programming, Polynomiography 1 Introduction Polynomials are undoubtedly one of the most significant objects in all of mathematics and the sciences, particularly in combinatorics.
    [Show full text]
  • A Tribute to Dick Askey
    A tribute to Dick Askey Tom Koornwinder,∗ Walter Van Asschey and Ole Warnaarz February 2015 (last minor corrections 14 May 2015) Richard A. (Dick) Askey1 was born June 4, 1933 in St. Louis, Missouri. He received his PhD at Princeton University in 1961 under the direction of Salomon Bochner. After instructorships at Washington University and the University of Chicago he joined the faculty of the University of Wisconsin-Madison in 1963, where he became full professor in 1968. Since 2003 he is Professor Emeritus at that same institution. Dick received many awards and distinctions during the course of his mathematical career. He was elected member of the American Academy of Arts and Sciences in 1993 and of the National Academy of Sciences in 1999. Furthermore, he is a Honorary Fellow of the Indian Academy of Sciences and a Fellow of SIAM and of the American Mathematical Society. In 1983 he was an invited speaker at the International Congress of Mathematicians (ICM) in Warszawa. In 2012 he received an hon- orary doctorate from SASTRA University in Kumbakonam, India. Dick Askey's research interests are Special Functions and Orthogonal Polynomials, and more generally Classical Analysis. His works often touch upon aspects of approximation theory, har- monic analysis, number theory, combinatorics and probability theory. He published2 140 research articles in journals, conference proceedings and edited books. His most frequent coauthors are George Gasper, Mourad Ismail and Stephen Wainger. Dick's research publications include two AMS Memoirs: one written with Mourad Ismail in 1984 [7], and one with James Wilson in 1985 [8] on the Askey-Wilson polynomials, probably his most influential publication.
    [Show full text]
  • Alternating Sign Matrices, Extensions and Related Cones
    See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/311671190 Alternating sign matrices, extensions and related cones Article in Advances in Applied Mathematics · May 2017 DOI: 10.1016/j.aam.2016.12.001 CITATIONS READS 0 29 2 authors: Richard A. Brualdi Geir Dahl University of Wisconsin–Madison University of Oslo 252 PUBLICATIONS 3,815 CITATIONS 102 PUBLICATIONS 1,032 CITATIONS SEE PROFILE SEE PROFILE Some of the authors of this publication are also working on these related projects: Combinatorial matrix theory; alternating sign matrices View project All content following this page was uploaded by Geir Dahl on 16 December 2016. The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document and are linked to publications on ResearchGate, letting you access and read them immediately. Alternating sign matrices, extensions and related cones Richard A. Brualdi∗ Geir Dahly December 1, 2016 Abstract An alternating sign matrix, or ASM, is a (0; ±1)-matrix where the nonzero entries in each row and column alternate in sign, and where each row and column sum is 1. We study the convex cone generated by ASMs of order n, called the ASM cone, as well as several related cones and polytopes. Some decomposition results are shown, and we find a minimal Hilbert basis of the ASM cone. The notion of (±1)-doubly stochastic matrices and a generalization of ASMs are introduced and various properties are shown. For instance, we give a new short proof of the linear characterization of the ASM polytope, in fact for a more general polytope.
    [Show full text]
  • AN INTEGRAL of PRODUCTS of ULTRASPHERICAL FUNCTIONS and a Q-EXTENSION
    AN INTEGRAL OF PRODUCTS OF ULTRASPHERICAL FUNCTIONS AND A q-EXTENSION RICHARD ASKEY, TOM H. KOORNWINDER AND MIZAN RAHMAN ABSTRACT Let Pn(x) and Qn(x) denote the Legendre polynomial of degree n and the usual second solution to the differential equation, respectively. Din showed that J1__ 1 Qn(x) Pm(x) P1(x) dx vanishes when 11-m I < n < l+m, and Askey evaluated the integral for arbitrary integral values of l, m and n. We extend this to the evaluation of J1__ 1 D~(x) Ci,(x) Cf(x) (l -x2) 2•- 1 dx, where C~(x) is the ultraspherical polynomial and D~(x) is the appropriate second solution to the ultraspherical differential equation. A q-extension is found using the continuous q-ultraspherical polynomials of Rogers. Again the integral vanishes when I l-m I < n < l + m. It is shown that this vanishing phenomenon holds for quite general orthogonal polynomials. A related integral of the product of three Bessel functions is also evaluated. 1. Introduction Legendre polynomials Pn are orthogonal polynomials of degree non (-1, I) with constant weight function and with normalization Pn(l) = 1. Corresponding Legendre functions of the second kind Qn are defined on the cut (-1, I) by the principal value integral Qn(X) = ~ L1x11 p ~t; dt, -1 < x < 1, (1.1) cf. [26, (4.9.12) and (4.62.9)]. In a very surprising paper Din [9] showed that [ (x)dx = (l.2) 1 Qn(x)Pm(x)P1 0 when I l-m I< n < l+m. Part of the surprise was the vanishing and part was the fact that such an attractive result did not seem to have been found before.
    [Show full text]