Diagonals and Walks. Alin Bostan 1 Louis Dumont 1 Bruno Salvy 2. November 4, Introduction Diagonals Walks. 1 INRIA, SpecFun.
|
|
- Charleen French
- 5 years ago
- Views:
Transcription
1 and Alin Bostan 1 Louis Dumont 1 Bruno Salvy 2 1 INRIA, SpecFun 2 INRIA, AriC November 4, /16 Louis Dumont and
2 2/16 Louis Dumont and
3 Motivations In combinatorics: Lattice walks w i,j : number of walks that end at (i, j) generating power series: W (X, Y ) = i,j 0 w i,jx i Y j w n,n: number of walks that end on the diagonal at (n, n) diagonal series: diagw (T ) = n 0 w n,nt n also appear in statistical physics, number theory,... /16 Louis Dumont and
4 Motivations In combinatorics: Lattice walks w i,j : number of walks that end at (i, j) generating power series: W (X, Y ) = i,j 0 w i,jx i Y j w n,n: number of walks that end on the diagonal at (n, n) diagonal series: diagw (T ) = n 0 w n,nt n also appear in statistical physics, number theory,... /16 Louis Dumont and
5 F (X, Y ) = 1 1 X Y = i,j 0 diag(f ) = ( ) 2n T n = n n 0 ( ) i + j X i Y j i 1 1 4T Abel ( 1830): Alg D-Finite Furstenberg (1967): Diag = Alg /16 Louis Dumont and
6 1-dimensional walks Set of steps of the form (1, a), a Z Example : Dyck Paths B(T ) = n 0 b nt n, b n : number of bridges of length n B(T ) can be expressed as a diagonal. 6/16 Louis Dumont and
7 Questions Question 1 How hard is it to compute a polynomial equation satised by the diagonal of a bivariate rational function? E(T ) = n 0 e nt n, e n : number of excursions of length n Question 2 How to compute E(T ) mod T N for a given N? 7/16 Louis Dumont and
8 Answers Theorem 1 (B., D., S.) Generically: the minimal polynomial equation can be computed in time that is quasi-linear with respect to its size. the minimal polynomial equation is exponentially bigger than the initial rational function (16 d vs d 2, where d is the degree) d deg T P, deg Y P (2, 2) (16, 6) (108, 20) (640, 70) Theorem 2 (B., D., S.) E(T ) mod T N can be computed in Õ(N) arithmetic operations, with a fairly inexpensive pre-computation. 8/16 Louis Dumont and
9 How to compute a polynomial equation satised by the diagonal of a bivariate rational function? 9/16 Louis Dumont and
10 Algebraic equation for the diagonal Ingredients of the algorithm: Partial fraction decomposition: the diagonal is a sum of residues of a rational function Rothstein-Trager resultant (1976): algebraic equation that cancels all residues α 1 (T ), α 2 (T ),..., α d (T ) Main diculty: if P = d (Y α i=1 i) is known, eciently compute the polynomial P k = (Y (α i1 + α i α ik )) for a given k d {i1,i2,...,i k } 10/16 Louis Dumont and
11 Newton sums Most important part of our algorithm: a way around the main diculty using Newton sums. P = d i=1 (Y α i ) N (P) = n 0 (α n 1 + α n α n d )Y n n! P N (P) is well-known and eective N (P k ) can be computed from N (P) P k is then recovered from N (P k ) 11/16 Louis Dumont and
12 How to compute E(T ) mod T N for a given N? 12/16 Louis Dumont and
13 Excursions: naive method w n,k : number of walks that stay in the upper half plane, of length n and ending at height k e n = w n,0 (e n : number of excursions of length n) w n,k satises a linear recurrence relation with constant coecients : w n,k = w n 1,k a, (1,a) S where S is the set of available steps Algorithm with O(N 2 ) arithmetic operations and no pre-computation 3/16 Louis Dumont and
14 Excursions: more ecient algorithm Idea (Banderier, Flajolet, 2002) Use the fact that E(T ) is algebraic to nd a better recurrence relation. recurrence for e n (1 index) instead of w n,k (2 indices) O(N) operations But linear complexity at the cost of pre-computations: - the algebraic equation, which is exponentially big in d (Bousquet-Mélou, 2008) - algebraic eqn dierential eqn (also exponentially big) (Bostan, Chyzak, Lecerf, Salvy, Schost, 2007) - initial conditions of the recurrence (exponentially many) Algorithm with O(N) operations and pre-computation of an exponential size in d equation 14/16 Louis Dumont and
15 Excursions: new algorithm Ideas Method: E(T ) = T B(t) 1 exp dt (Banderier, Flajolet 2002). Recover 0 t E(T ) from B(T ) using this formula. (including B(T )) satisfy small (polynomial size) dierential equations (Bostan, Chen, Chyzak, Li, 2010)). Fast computation of a dierential equation for B using Hermite reduction (loc. cit.) Calculate B mod T N with this equation O(N) Apply the formula using Newton iteration Algorithm with Õ(N) operations and pre-computation of a polynomial size in d equation 15/16 Louis Dumont and Õ(N)
16 Conclusion 16/16 Louis Dumont and
arxiv: v1 [cs.sc] 15 Oct 2015
ALGEBRAIC DIAGONALS AND WALKS: ALGORITHMS, BOUNDS, COMPLEXITY ALIN BOSTAN, LOUIS DUMONT, AND BRUNO SALVY arxiv:1510.04526v1 [cs.sc] 15 Oct 2015 Abstract. The diagonal of a multivariate power series F is
More informationBon anniversaire Marc!
Bon anniversaire Marc! The full counting function of Gessel walks is algebraic Alin Bostan (INRIA) joint work with Manuel Kauers (INRIA/RISC) Journées GECKO/TERA 2008 Context: restricted lattice walks
More informationDiagonals: Combinatorics, Asymptotics and Computer Algebra
Diagonals: Combinatorics, Asymptotics and Computer Algebra Bruno Salvy Inria & ENS de Lyon Families of Generating Functions (a n ) 7! A(z) := X n 0 a n z n counts the number of objects of size n captures
More informationAlgorithmic Tools for the Asymptotics of Diagonals
Algorithmic Tools for the Asymptotics of Diagonals Bruno Salvy Inria & ENS de Lyon Lattice walks at the Interface of Algebra, Analysis and Combinatorics September 19, 2017 Asymptotics & Univariate Generating
More informationLinear Differential Equations as a Data-Structure
Linear Differential Equations as a Data-Structure Bruno Salvy Inria & ENS de Lyon FoCM, July 14, 2017 Computer Algebra Effective mathematics: what can we compute exactly? And complexity: how fast? (also,
More informationAlgorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon aaacuxicbvhlbtraejw1r2beg+aghxhrsgitvjycahkhcc7cskqsibs2vunxez3jpjyznsli+rf4bq7wbfwknz6f8torzenli5wqutvtxvklhcmo+juirl2/cfpwxu3wzt179x8mnx9+cqa2hkbcsgmpm+zacg1tfcjhsllavcbhidt+3+khn8e6yfq+litifvtouqjo0fpz4epelmacmfmvbkzgpnfwes2hw9ekwhw9cujzslxz9ofeb0li7nxz8dxjda8vaossotelowrthlkuxeibjhih/m96gwwtijzhqcixbjtxevdtmnqoksap2qjmhmqmwkxn2cpds0eeymlhrh8a6yr9d6rhyrmlynynyli6da0j/6fnaixep43qvy2geb+oqcvfq7tt0vxy4cixhjbuhbdcecks4+gpgiywnjxyoxtt+yveftkurjby1kzq19wcksgxfx1/m/3sef2o/q5rucybdln2pk1pxjyvctd9lapqmhbugrxfjtf7cdp0g52v0ccyr+d1fuxftt5m4j2f5dvs1wz5qp6r5yqm22shfcc7zeo4+uk+ke/kr/a2yiiyoopbg8h5zcnyqql3bxdu3c8=
More informationAlgorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon Computer Algebra in Combinatorics, Schrödinger Institute, Vienna, Nov. 2017 Motivation p 0 (n)a n+k + + p k (n)a
More informationFast Computation of Power Series Solutions of Systems of Differential Equations
Fast Computation of Power Series Solutions of Systems of Differential Equations Bruno.Salvy@inria.fr Algorithms Project, Inria Joint work with A. Bostan, F. Chyzak, F. Ollivier, É. Schost, A. Sedoglavic
More informationEfficient Experimental Mathematics for Lattice Path Combinatorics
1/45 Efficient Experimental Mathematics for Lattice Path Combinatorics Alin Bostan based on joint works with M. Bousquet-Mélou, F. Chyzak, M. van Hoeij, M. Kauers, S. Melczer, L. Pech, K. Raschel, B. Salvy
More informationFast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field Alin Bostan 1 Gilles Christol 2 Philippe Dumas 1 1 Inria (France) 2 Institut de mathématiques de Jussieu (France) Specfun
More informationSymbolic-Numeric Tools for Multivariate Asymptotics
Symbolic-Numeric Tools for Multivariate Asymptotics Bruno Salvy Joint work with Stephen Melczer to appear in Proc. ISSAC 2016 FastRelax meeting May 25, 2016 Combinatorics, Randomness and Analysis From
More informationDe part en retraite de Pierre
Introduction Combinatorics Generating Series Oracle Conclusion De part en retraite de Pierre Villetaneuse, fe vrier 2013 1 / 41 De part en retraite de Pierre Introduction Combinatorics Generating Series
More informationSingularity analysis via the iterated kernel method
FPSAC 2013 Paris, France DMTCS proc. AS, 2013, 481 492 Singularity analysis via the iterated kernel method Stephen Melczer and Marni Mishna Department of Mathematics, Simon Fraser University, Burnaby,
More informationLattice paths with catastrophes
Lattice paths with catastrophes Lattice paths with catastrophes SLC 77, Strobl 12.09.2016 Cyril Banderier and Michael Wallner Laboratoire d Informatique de Paris Nord, Université Paris Nord, France Institute
More informationPhilippe Flajolet and Symbolic Computation
Philippe Flajolet and Symbolic Computation Bruno Salvy 1. Combinatorics and Analysis of Algorithms 4 2. Complex Analysis 5 3. Symbolic Computation 7 While Philippe Flajolet did not publish many articles
More informationarithmetic properties of weighted catalan numbers
arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers
More informationResidues and Telescopers for Bivariate Rational Functions
Residues and Telescopers for Bivariate Rational Functions Shaoshi Chen and Michael F. Singer Department of Mathematics, North Carolina State University, Raleigh, NC 27695-8205, USA September 29, 2012 Dedicated
More informationFighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.
Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire
More informationComputing minimal interpolation bases
Computing minimal interpolation bases Vincent Neiger,, Claude-Pierre Jeannerod Éric Schost Gilles Villard AriC, LIP, École Normale Supérieure de Lyon, France University of Waterloo, Ontario, Canada Supported
More informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationComputing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm
Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm Poteaux Adrien XLIM-DMI UMR CNRS 6172 Université de Limoges, France SNC'07 University of
More informationFast computation of normal forms of polynomial matrices
1/25 Fast computation of normal forms of polynomial matrices Vincent Neiger Inria AriC, École Normale Supérieure de Lyon, France University of Waterloo, Ontario, Canada Partially supported by the mobility
More informationSCALED REMAINDER TREES
Draft. Aimed at Math. Comp. SCALED REMAINDER TREES DANIEL J. BERNSTEIN Abstract. It is well known that one can compute U mod p 1, U mod p 2,... in time n(lg n) 2+o(1) where n is the number of bits in U,
More informationAccurate and Efficient Matrix Computations with Totally Positive Generalized Vandermonde Matrices Using Schur Functions
Accurate and Efficient Matrix Computations with Totally Positive Generalized Matrices Using Schur Functions Plamen Koev Department of Mathematics UC Berkeley Joint work with Prof. James Demmel Supported
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationTHE COMPLETE GENERATING FUNCTION FOR GESSEL WALKS IS ALGEBRAIC
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 THE COMPLETE GENERATING FUNCTION FOR GESSEL WALKS IS ALGEBRAIC ALIN BOSTAN AND MANUEL KAUERS with
More informationClosed Form Solutions
Closed Form Solutions Mark van Hoeij 1 Florida State University Slides of this talk: www.math.fsu.edu/ hoeij/issac2017.pdf 1 Supported by NSF 1618657 1 / 29 What is a closed form solution? Example: Solve
More informationDifferential Equations for Algebraic Functions
Differential Equations for Algebraic Functions Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost To cite this version: Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf,
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More informationAutomatic Proofs of Identities: Beyond A=B
Bruno.Salvy@inria.fr FPSAC, Linz, July 20, 2009 Joint work with F. Chyzak and M. Kauers 1 / 28 I Introduction 2 / 28 Examples of Identities: Definite Sums, q-sums, Integrals n k=0 + 0 1 2πi n=0 ( ) H n
More informationOn the nature of the generating series of walks in the quarter plane
1/27 On the nature of the generating series of walks in the quarter plane Thomas Dreyfus 1 Joint work with Charlotte Hardouin 2 and Julien Roques 3 and Michael Singer 4 1 University Lyon 1, France 2 University
More informationAutomatic Classification of Restricted Lattice Walks
Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1 1 Automatic Classification of Restricted Lattice Walks arxiv:0811.2899v2 [math.co] 1 Jun 2009 Alin Bostan 1 and
More informationPolynomials over finite fields. Algorithms and Randomness
Polynomials over Finite Fields: Algorithms and Randomness School of Mathematics and Statistics Carleton University daniel@math.carleton.ca AofA 10, July 2010 Introduction Let q be a prime power. In this
More informationFast Matrix Product Algorithms: From Theory To Practice
Introduction and Definitions The τ-theorem Pan s aggregation tables and the τ-theorem Software Implementation Conclusion Fast Matrix Product Algorithms: From Theory To Practice Thomas Sibut-Pinote Inria,
More informationA COMBINATORIAL UNDERSTANDING OF LATTICE PATH ASYMPTOTICS
A COMBINATORIAL UNDERSTANDING OF LATTICE PATH ASYMPTOTICS SAMUEL JOHNSON, MARNI MISHNA, AND KAREN YEATS Abstract. We provide a combinatorial derivation of the exponential growth constant for counting sequences
More informationA solution to the tennis ball problem
A solution to the tennis ball problem Anna de Mier Marc Noy Universitat Politècnica de Catalunya Abstract We present a complete solution to the so-called tennis ball problem, which is equivalent to counting
More informationLattice walks at the Interface of Algebra, Analysis and Combinatorics
Lattice walks at the Interface of Algebra, Analysis and Combinatorics Marni Mishna (Simon Fraser University) Mireille Bousquet-Mélou (Université de Bordeaux/ Centre National de la Recherche Scientifique)
More informationDifferential Equations for Algebraic Functions
Differential Equations for Algebraic Functions Alin Bostan, Frédéric Chyzak, Bruno Salvy Algorithms Project, Inria Rocquencourt 78153 Le Chesnay (France) {Alin.Bostan,Frederic.Chyzak,Bruno.Salvy}@inria.fr
More informationInhomogeneous Restricted Lattice Walks
Inhomogeneous Restricted Lattice Walks Manfred Buchacher 1 and Manuel Kauers 1 arxiv:1811.06725v1 [math.co] 16 Nov 2018 1 Institute for Algebra, Johannes Kepler University, Linz, Austria Abstract. We consider
More informationSecond-Order Linear ODEs
Second-Order Linear ODEs A second order ODE is called linear if it can be written as y + p(t)y + q(t)y = r(t). (0.1) It is called homogeneous if r(t) = 0, and nonhomogeneous otherwise. We shall assume
More informationClosed Form Solutions
Closed Form Solutions Mark van Hoeij 1 Florida State University ISSAC 2017 1 Supported by NSF 1618657 1 / 26 What is a closed form solution? Example: Solve this equation for y = y(x). y = 4 x 3 (1 x) 2
More informationContinued Classification of 3D Lattice Models in the Positive Octant
Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1 1 arxiv:1511.05763v1 [math.co] 18 Nov 2015 Continued Classification of 3D Lattice Models in the Positive Octant
More informationCalcul formel pour la combinatoire
Calcul formel pour la combinatoire Alin Bostan, Bruno Salvy To cite this version: Alin Bostan, Bruno Salvy. Calcul formel pour la combinatoire. Journées ALEA 2012, Mar 2012, Luminy, France.
More informationFast algorithms for multivariate interpolation problems
Fast algorithms for multivariate interpolation problems Vincent Neiger,, Claude-Pierre Jeannerod Éric Schost Gilles Villard AriC, LIP, École Normale Supérieure de Lyon, France ORCCA, Computer Science Department,
More informationNon-linear least squares
Non-linear least squares Concept of non-linear least squares We have extensively studied linear least squares or linear regression. We see that there is a unique regression line that can be determined
More informationAdditive Decompositions in Primitive Extensions
Additive Decompositions in Primitive Extensions KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China School of Mathematical Sciences, University of Chinese
More informationERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemerédi s Theorem states that a set of integers with positive upper density contains arbitrarily
More informationThe Dynamic Dictionary of Mathematical Functions
The Dynamic Dictionary of Mathematical Functions Bruno.Salvy@inria.fr AISC 2010. July 6, 2010 Joint work with: Alexandre Benoit, Alin Bostan, Frédéric Chyzak, Alexis Darrasse, Stefan Gerhold, Marc Mezzarobba
More informationOn the Sequence A and Its Combinatorial Interpretations
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 9 (2006), Article 06..1 On the Sequence A079500 and Its Combinatorial Interpretations A. Frosini and S. Rinaldi Università di Siena Dipartimento di Scienze
More informationLattice paths with catastrophes
Lattice paths with catastrophes Gascom 2016 Cyril Banderier and Michael Wallner Laboratoire d Informatique de Paris Nord, Université Paris Nord, France Institute of Discrete Mathematics and Geometry, TU
More informationExact solution of two friendly walks above a sticky wall with single and double interactions
Exact solution of two friendly walks above a sticky wall with single and double interactions Aleks, Andrew Rechnitzer, and Thomas Wong MASCOS and Department of Mathematics and Statistics, The University
More informationAlgorithms for Combinatorial Systems: Between Analytic Combinatorics and Species Theory.
Algorithms for Combinatorial Systems: Between Analytic Combinatorics and Species Theory. Carine Pivoteau - LIGM - december 2011 joint work with Bruno Salvy and Michèle Soria Algorithms for Combinatorial
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 informationMultiple binomial sums
Multiple binomial sums Alin Bostan, Pierre Lairez, Bruno Salvy To cite this version: Alin Bostan, Pierre Lairez, Bruno Salvy. Multiple binomial sums. Journal of Symbolic Computation, Elsevier, 207, 80
More informationFast computation of power series solutions of systems of differential equations
Fast computation of power series solutions of systems of differential equations A. Bostan F. Chyzak F. Ollivier B. Salvy É. Schost A. Sedoglavic Abstract We propose algorithms for the computation of the
More informationColeman Integration in Larger Characteristic
Coleman Integration in Larger Characteristic ANTS XIII University of Wisconsin, Madison Alex J. Best 17/7/2018 Boston University The big picture Be Ba-BaTu BaBrKe Coleman integration Mi-ArBeCoMaTr Ha CaDeVe-Go-GaGu-Sh-Tu
More informationComputing zeta functions of certain varieties in larger characteristic
Computing zeta functions of certain varieties in larger characteristic New York University 16th March 2010 Effective methods in p-adic cohomology Mathematical Institute, University of Oxford Notation q
More informationStandard paths in another composition poset
Standard paths in another composition poset Jan Snellman Department of Mathematics, Stockholm University SE-10691 Stockholm, Sweden Jan.Snellmanmath.su.se Submitted: Oct 8, 2003; Accepted: Oct 17, 2004;
More informationOur goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always
October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.
More informationModern Computer Algebra
Modern Computer Algebra JOACHIM VON ZUR GATHEN and JURGEN GERHARD Universitat Paderborn CAMBRIDGE UNIVERSITY PRESS Contents Introduction 1 1 Cyclohexane, cryptography, codes, and computer algebra 9 1.1
More informationPolynomial evaluation and interpolation on special sets of points
Polynomial evaluation and interpolation on special sets of points Alin Bostan and Éric Schost Laboratoire STIX, École polytechnique, 91128 Palaiseau, France Abstract We give complexity estimates for the
More informationSome reflections on directed lattice paths.
AofA 4 Paris (June 6-20, 204) DMTCS proc. BA, 204, 25 36 Some reflections on directed lattice paths. Cyril Banderier and Michael Wallner 2 arxiv:605.0687v [cs.dm] 5 May 206 Laboratoire d Informatique de
More informationCounting Points on Curves of the Form y m 1 = c 1x n 1 + c 2x n 2 y m 2
Counting Points on Curves of the Form y m 1 = c 1x n 1 + c 2x n 2 y m 2 Matthew Hase-Liu Mentor: Nicholas Triantafillou Sixth Annual Primes Conference 21 May 2016 Curves Definition A plane algebraic curve
More informationColeman Integration in Larger Characteristic
Coleman Integration in Larger Characteristic ANTS XIII University of Wisconsin, Madison Alex J. Best 17/7/2018 Boston University The big picture Kedlaya Arul, Balakrishnan, Best, Bradshaw, Castryk, Costa,
More informationComputing L-series of geometrically hyperelliptic curves of genus three. David Harvey, Maike Massierer, Andrew V. Sutherland
Computing L-series of geometrically hyperelliptic curves of genus three David Harvey, Maike Massierer, Andrew V. Sutherland The zeta function Let C/Q be a smooth projective curve of genus 3 p be a prime
More informationOn the use of polynomial matrix approximant in the block Wiedemann algorithm
On the use of polynomial matrix approximant in the block Wiedemann algorithm ECOLE NORMALE SUPERIEURE DE LYON Laboratoire LIP, ENS Lyon, France Pascal Giorgi Symbolic Computation Group, School of Computer
More informationFinite Operator Calculus With Applications to Linear Recursions
Finite Operator Calculus With Applications to Linear Recursions Heinrich Niederhausen Florida Atlantic University Boca Raton Niederhausen@math.fau.edu www.math.fau.edu/niederhausen 2 Contents Contents
More informationComputing the rank of configurations on Complete Graphs
Computing the rank of configurations on Complete Graphs Robert Cori November 2016 The paper by M. Baker and S. Norine [1] in 2007 introduced a new parameter in Graph Theory it was called the rank of configurations
More information5 Eigenvalues and Diagonalization
Linear Algebra (part 5): Eigenvalues and Diagonalization (by Evan Dummit, 27, v 5) Contents 5 Eigenvalues and Diagonalization 5 Eigenvalues, Eigenvectors, and The Characteristic Polynomial 5 Eigenvalues
More informationMATH 5640: Functions of Diagonalizable Matrices
MATH 5640: Functions of Diagonalizable Matrices Hung Phan, UMass Lowell November 27, 208 Spectral theorem for diagonalizable matrices Definition Let V = X Y Every v V is uniquely decomposed as u = x +
More informationTHE COMPLETE GENERATING FUNCTION FOR GESSEL WALKS IS ALGEBRAIC
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 138, Number 9, September 2010, Pages 3063 3078 S 0002-9939(2010)10398-2 Article electronically published on May 14, 2010 THE COMPLETE GENERATING
More informationPeter Bala, Nov
Fractional iteration of a series inversion operator Peter Bala, Nov 16 2015 We consider an operator on formal power series, closely related to the series reversion operator, and show how to dene comple
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 informationQ(x n+1,..., x m ) in n independent variables
Cluster algebras of geometric type (Fomin / Zelevinsky) m n positive integers ambient field F of rational functions over Q(x n+1,..., x m ) in n independent variables Definition: A seed in F is a pair
More informationA gentle introduction to PSLQ
A gentle introduction to PSLQ Armin Straub Email: math@arminstraub.com April 0, 200 Abstract This is work in progress. Please let me know about any comments and suggestions. What PSLQ is about PSLQ is
More informationOn a connection between planar map combinatorics and lattice walks Timothy Budd
Workshop on Large Random Structures in Two Dimensions, IHP, January 19th, 2017 On a connection between planar map combinatorics and lattice walks Timothy Budd IPhT, CEA-Saclay timothy.budd@cea.fr, http://www.nbi.dk/~budd/
More informationFactoring Polynomials with Rational Coecients. Kenneth Giuliani
Factoring Polynomials with Rational Coecients Kenneth Giuliani 17 April 1998 1 Introduction Factorization is a problem well-studied in mathematics. Of particular focus is factorization within unique factorization
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationComputer Algebra for Lattice path Combinatorics
Computer Algebra for Lattice path Combinatorics Alin Bostan To cite this version: Alin Bostan. Computer Algebra for Lattice path Combinatorics. Symbolic Computation [cs.sc]. Université Paris 13, 2017.
More informationSummations in Bernoulli s Triangles via Generating Functions
2 3 47 6 23 Journal of Integer Sequences, Vol 20 (207, Article 73 Summations in Bernoulli s Triangles via Generating Functions Kamilla Oliver 9 Stellenberg Road 730 Somerset West Sout Africa olikamilla@gmailcom
More informationAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern D. Merlini and R. Sprugnoli Dipartimento di Sistemi e Informatica viale Morgagni 65, 5034, Firenze, Italia merlini@dsi.unifi.it,
More informationA Detailed Look at a Discrete Randomw Walk with Spatially Dependent Moments and Its Continuum Limit
A Detailed Look at a Discrete Randomw Walk with Spatially Dependent Moments and Its Continuum Limit David Vener Department of Mathematics, MIT May 5, 3 Introduction In 8.366, we discussed the relationship
More informationLinear Methods for Prediction
Chapter 5 Linear Methods for Prediction 5.1 Introduction We now revisit the classification problem and focus on linear methods. Since our prediction Ĝ(x) will always take values in the discrete set G we
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationSolving structured linear systems with large displacement rank
Solving structured linear systems with large displacement rank Alin Bostan a,1 Claude-Pierre Jeannerod b Éric Schost c,2 a Algorithms Project, INRIA Paris-Rocquencourt, 78153 Le Chesnay Cedex, France b
More informationSec. 7.4: Basic Theory of Systems of First Order Linear Equations
Sec. 7.4: Basic Theory of Systems of First Order Linear Equations MATH 351 California State University, Northridge April 2, 214 MATH 351 (Differential Equations) Sec. 7.4 April 2, 214 1 / 12 System of
More informationPositive Denite Matrix. Ya Yan Lu 1. Department of Mathematics. City University of Hong Kong. Kowloon, Hong Kong. Abstract
Computing the Logarithm of a Symmetric Positive Denite Matrix Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A numerical method for computing the logarithm
More informationComputation of the error functions erf and erfc in arbitrary precision with correct rounding
Computation of the error functions erf and erfc in arbitrary precision with correct rounding Sylvain Chevillard Arenaire, LIP, ENS-Lyon, France Sylvain.Chevillard@ens-lyon.fr Nathalie Revol INRIA, Arenaire,
More informationFast reversion of formal power series
Fast reversion of formal power series Fredrik Johansson LFANT, INRIA Bordeaux RAIM, 2016-06-29, Banyuls-sur-mer 1 / 30 Reversion of power series F = exp(x) 1 = x + x 2 2! + x 3 3! + x 4 G = log(1 + x)
More informationFast Computation With Two Algebraic Numbers
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Fast Computation With Two Algebraic Numbers Alin BOSTAN, Philippe FLAJOLET, Bruno SALVY, Éric SCHOST No 4579 Octobre 2002 THÈME 2 apport
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationA Proof of a Recursion for Bessel Moments
A Proof of a Recursion for Bessel Moments Jonathan M. Borwein Faculty of Computer Science, Dalhousie University, Halifax, NS, B3H 2W5, Canada jborwein@cs.dal.ca Bruno Salvy Algorithms Project, Inria Paris-Rocquencourt,
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 informationMAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.
MAT 1332: CALCULUS FOR LIFE SCIENCES JING LI Contents 1 Review: Linear Algebra II Vectors and matrices 1 11 Definition 1 12 Operations 1 2 Linear Algebra III Inverses and Determinants 1 21 Inverse Matrices
More informationPower structure over the Grothendieck ring of varieties and generating series of Hilbert schemes of points
arxiv:math/0407204v1 [math.ag] 12 Jul 2004 Power structure over the Grothendieck ring of varieties and generating series of Hilbert schemes of points S.M. Gusein-Zade I. Luengo A. Melle Hernández Abstract
More informationIntroduction 5. 1 Floating-Point Arithmetic 5. 2 The Direct Solution of Linear Algebraic Systems 11
SCIENTIFIC COMPUTING BY NUMERICAL METHODS Christina C. Christara and Kenneth R. Jackson, Computer Science Dept., University of Toronto, Toronto, Ontario, Canada, M5S 1A4. (ccc@cs.toronto.edu and krj@cs.toronto.edu)
More informationLinear differential and recurrence equations viewed as data-structures
Linear differential and recurrence equations viewed as data-structures Bruno Salvy Inria & ENS de Lyon Leçons de Mathématiques et d'informatique d'aujourd'hui Bordeaux, Mai 2015 Computer Algebra Effective
More informationSensitivity Analysis for the Problem of Matrix Joint Diagonalization
Sensitivity Analysis for the Problem of Matrix Joint Diagonalization Bijan Afsari bijan@math.umd.edu AMSC Department Sensitivity Analysis for the Problem of Matrix Joint Diagonalization p. 1/1 Outline
More information