Related papers: Fast Coefficient Computation for Algebraic Power S…

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

We provide a new proof of the multivariate version of Christol's theorem about algebraic power series with coefficients in finite fields, as well as of its extension to perfect ground fields of positive characteristic obtained independently…

A famous result of Christol gives that a power series $F(t)=\sum_{n\ge 0} f(n)t^n$ with coefficients in a finite field $\mathbb{F}_q$ of characteristic $p$ is algebraic over the field of rational functions in $t$ if and only if there is a…

This is an exposition, for pedagogical purposes, of the formal power series proof of Bostan, Christol and Dumas [3] of the result stated in the title (a corollary of the Christol theorem).

A theorem of Christol states that a power series over a finite field is algebraic over the polynomial ring if and only if its coefficients can be generated by a finite automaton. Using Christol's result, we prove that the same assertion…

Let K be an algebraically closed field of characteristic p. We exhibit a counterexample against a theorem asserted in one of our earlier papers, which claims to characterize the integral closure of K((t)) within the field of…

We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Let $K$ be a field of characteristic $p>0$ and let $f(t_1,...,t_d)$ be a power series in $d$ variables with coefficients in $K$ that is algebraic over the field of multivariate rational functions $K(t_1,...,t_d)$. We prove a generalization…

Statistical power is a measure of the replicability of a categorical hypothesis test. Formally, it is the probability of detecting an effect, if there is a true effect present in the population. Hence, optimizing statistical power as a…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…

We present an algebraic algorithm that computes the composition of two power series in softly linear time complexity. The previous best algorithms are $\mathop{\mathrm O}(n^{1+o(1)})$ by Kedlaya and Umans (FOCS 2008) and an $\mathop{\mathrm…

We present a new algorithm to rapidly and optimally compute power spectra. This new algorithm is based on a generalization of iterative multigrid, and has computational cost O(N log N), compared to the standard brute force approach which…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…