Calcul pratique des coefficients de Taylor d'une fonction algébrique
From MaRDI portal
Publication:2530258
zbMath0166.41702MaRDI QIDQ2530258
Publication date: 1964
Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)
Related Items
Graded algebras, algebraic functions, planar trees, and elliptic integrals, Analytic models and ambiguity of context-free languages, The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic, On the language of primitive words, A classic proof of a recurrence for a very classical sequence, On the algebraicity of Puiseux series, Solving polynomials with ordinary differential equations, Differentiably finite power series, Formulae and Asymptotics for Coefficients of Algebraic Functions, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, A quantitative study of pure parallel processes, Residues and telescopers for bivariate rational functions, On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\), An enlarged family of packing polynomials on multidimensional lattices, Good reduction of Puiseux series and applications, The complexity of computing the number of strings of given length in context-free languages, Random generation of words in an algebraic language in linear binary space, Additive cellular automata and algebraic series, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, On Hadamard square roots of unity, Some continuous endomorphisms of \(P\)-recursives sequences, Basic analytic combinatorics of directed lattice paths, Linear differential operators for polynomial equations, Random Generation for Finitely Ambiguous Context-free Languages
