Searcharxiv⌕ Search

arXiv subjects

Joris van der Hoeven

Publications and source records attributed to Joris van der Hoeven.

36 records · Page 2Linked to original sources
arXiv2021

On a Differential Intermediate Value Property

Liouville closed $H$-fields are ordered differential fields whose ordering and derivation interact in a natural way and where every linear differential equation of order $1$ has a nontrivial solution. (The introduction gives a precise definition.) For a Liouville closed $H$-field $K$ with small derivation we show: $K$ has the Intermediate Value Property for differential polynomials iff $K$ is elementarily equivalent to the ordered differential field of transseries. We also indicate how this applies to Hardy fields.

math.LO↗
arXiv2019

Hardy fields, the intermediate value property, and $ω$-freeness

We discuss the conjecture that every maximal Hardy field has the Intermediate Value Property for differential polynomials, and its equivalence to the statement that all maximal Hardy field are elementarily equivalent to the differential field of transseries. As a modest but essential step towards establishing the conjecture we show that every maximal Hardy field is $ω$-free.

math.LO↗
arXiv2018

Logarithmic Hyperseries

We define the field $\mathbb{L}$ of logarithmic hyperseries, construct on $\mathbb{L}$ natural operations of differentiation, integration, and composition, establish the basic properties of these operations, and characterize these operations uniquely by such properties.

math.LO↗
arXiv2018

Faster integer multiplication using short lattice vectors

We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is unconditional, and depends in an essential way on Minkowski's theorem concerning lattice vectors in symmetric convex sets.

cs.SC↗
arXiv2017

On numbers, germs, and transseries

Germs of real-valued functions, surreal numbers, and transseries are three ways to enrich the real continuum by infinitesimal and infinite quantities. Each of these comes with naturally interacting notions of ordering and derivative. The category of $H$-fields provides a common framework for the relevant algebraic structures. We give an exposition of our results on the model theory of $H$-fields, and we report on recent progress in unifying germs, surreal numbers, and transseries from the point of view of asymptotic differential algebra.

math.LO↗
arXiv2017

Faster integer and polynomial multiplication using cyclotomic coefficient rings

We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n}).

cs.SC↗
arXiv2017

Dimension in the realm of transseries

Let $\mathbb T$ be the differential field of transseries. We establish some basic properties of the dimension of a definable subset of ${\mathbb T}^n$, also in relation to its codimension in the ambient space ${\mathbb T}^n$. The case of dimension $0$ is of special interest, and can be characterized both in topological terms (discreteness) and in terms of the Herwig-Hrushovski-Macpherson notion of co-analyzability. The proofs use results by the authors from "Asymptotic Differential Algebra and Model Theory of Transseries", the axiomatic framework for "dimension" in [L. van den Dries, "Dimension of definable sets, algebraic boundedness and Henselian fields", Ann. Pure Appl. Logic 45 (1989), no. 2, 189-209], and facts about co-analyzability from [B. Herwig, E. Hrushovski, D. Macpherson, "Interpretable groups, stably embedded sets, and Vaughtian pairs", J. London Math. Soc. (2003) 68, no. 1, 1-11].

math.LO↗
arXiv2016

The surreal numbers as a universal H-field

We show that the natural embedding of the differential field of transseries into Conway's field of surreal numbers with the Berarducci-Mantova derivation is an elementary embedding. We also prove that any Hardy field embeds into the field of surreals with the Berarducci-Mantova derivation.

math.LO↗
arXiv2014

Even faster integer multiplication

We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coefficient rings with "fast" roots of unity. Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8. We show that an optimised variant of Fürer's algorithm achieves only K = 16, suggesting that the new algorithm is faster than Fürer's by a factor of 2^(log^* n). Assuming standard conjectures about the distribution of Mersenne primes, we give yet another algorithm that achieves K = 4.

cs.CC↗
arXiv2014

Faster polynomial multiplication over finite fields

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated logarithm. This is the first known Fürer-type complexity bound for F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log log n log p).

cs.CC↗
arXiv2014

Modular SIMD arithmetic in Mathemagix

Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplication of integer polynomials and matrices. The vectorized algorithms have been implemented in C++ inside the free computer algebra and analysis system Mathemagix. The performance of our implementation is illustrated by various benchmarks.

cs.MS↗
arXiv2012

Automatic asymptotics for coefficients of smooth, bivariate rational functions

We consider a bivariate rational generating function F(x,y) = P(x,y) / Q(x,y) = sum_{r, s} a_{r,s} x^r y^s under the assumption that the complex algebraic curve $\sing$ on which $Q$ vanishes is smooth. Formulae for the asymptotics of the coefficients a_{rs} were derived by Pemantle and Wilson (2002). These formulae are in terms of algebraic and topological invariants of the pole variety, but up to now these invariants could be computed only under a minimality hypothesis, namely that the dominant saddle lies on the boundary of the domain of convergence. In the present paper, we give an effective method for computing the topological invariants, and hence the asymptotics of the values a_{r,s}, without the minimality assumption. This leads to a theoretically rigorous algorithm, whose implementation is in progress at http://www.mathemagix.org .

math.CO↗
arXiv2012

Towards a Model Theory for Transseries

The differential field of transseries extends the field of real Laurent series, and occurs in various context: asymptotic expansions, analytic vector fields, o-minimal structures, to name a few. We give an overview of the algebraic and model-theoretic aspects of this differential field, and report on our efforts to understand its first-order theory.

math.LO↗
arXiv2009

On the bit-complexity of sparse polynomial multiplication

In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity results for the power series multiplication in many variables. Our algorithms are implemented and freely available within the Mathemagix software. We show that their theoretical costs are well-reflected in practice.

cs.DS↗
arXiv2009

Homotopy methods for multiplication modulo triangular sets

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a quasi-linear time complexity for substantial families of examples, for which no such result was known before. Applications are given to notably addition of algebraic numbers in small characteristic.

cs.SC↗