Title	Algorithmic proof for the transcendence of D-finite power series
Creator	Bostan, Alin
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-09-19T10:30
Description	Given a sequence represented by a linear recurrence with polynomial coefficients and sufficiently many initial terms, a natural question is whether the transcendence of its generating function can be decided algorithmically. The question is non trivial even for sequences satisfying a recurrence of first order. An algorithm due to Michael Singer is sufficient, in principle, to answer the general case. However, this algorithm suffers from too high a complexity to be effective in practice. We will present a recent method that we have used to treat a non-trivial combinatorial example. It reduces the question of transcendence to a (structured) linear algebra problem.
Extent	30 minutes
Subject	Mathematics; Combinatorics; Sequences, series, summability; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: INRIA
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-03-30
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0364594
URI	http://hdl.handle.net/2429/65039
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos