English
Related papers

Related papers: Bounds for Substituting Algebraic Functions into D…

200 papers

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

Algebraic Geometry · Mathematics 2024-08-27 Rida Ait El Manssour , Anna-Laura Sattelberger , Bertrand Teguia Tabuguia

A function is differentially algebraic (or simply D-algebraic) if there is a polynomial relationship between some of its derivatives and the indeterminate variable. Many functions in the sciences, such as Mathieu functions, the Weierstrass…

Symbolic Computation · Computer Science 2023-07-11 Bertrand Teguia Tabuguia

D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…

Number Theory · Mathematics 2018-05-29 Hui Huang , Manuel Kauers

It is known for linear operators with polynomial coefficients annihilating a given D-finite function that there is a trade-off between order and degree. Raising the order may give room for lowering the degree. The relationship between order…

Symbolic Computation · Computer Science 2022-05-13 Hui Huang , Manuel Kauers , Gargi Mukherjee

We are concerned with the arithmetic of solutions to ordinary or partial nonlinear differential equations which are algebraic in the indeterminates and their derivatives. We call these solutions D-algebraic functions, and their equations…

Symbolic Computation · Computer Science 2024-06-18 Bertrand Teguia Tabuguia

We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…

Symbolic Computation · Computer Science 2014-08-26 Manuel Kauers

Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…

Symbolic Computation · Computer Science 2025-11-03 Bertrand Teguia Tabuguia

We propose a differential analog of the notion of integral closure of algebraic function fields. We present an algorithm for computing the integral closure of the algebra defined by a linear differential operator. Our algorithm is a direct…

Symbolic Computation · Computer Science 2015-07-01 Manuel Kauers , Christoph Koutschan

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

We study finiteness (and vanishing) properties of the higher order degrees associated to complements of complex affine plane curves with mild singularities at infinity. Our results impose new obstructions on the class of groups that can be…

Algebraic Topology · Mathematics 2018-08-10 Eva Elduque , Laurentiu Maxim

The matrix normed structure of the unitization of a (non-selfadjoint) operator algebra is determined by that of the original operator algebra. This yields a classification up to completely isometric isomorphism of two-dimensional unital…

funct-an · Mathematics 2007-05-23 Ralf Meyer

We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…

Symbolic Computation · Computer Science 2025-05-13 Manuel Kauers , Raphael Pages

In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…

Let O be a topological (colored) operad. The Lurie infinity-category of O-algebras with values in (infinity-category of) complexes is compared to the infinity-category underlying the model category of (classical) dg O-algebras. This can be…

Quantum Algebra · Mathematics 2015-09-21 V. Hinich

Let $K$ be a number field. We give an arithmetic characterization at infinity of the differential operator of $K[x,d/dx]$ with minimal degree in $x$ annihilating a given $E$-function.

Number Theory · Mathematics 2007-05-23 Said Manjra

A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…

Algebraic Geometry · Mathematics 2025-10-13 Bertrand Teguia Tabuguia

It is well known that algebraic power series are differentially finite (D-finite): they satisfy linear differential equations with polynomial coefficients. The converse problem, whether a given D-finite power series is algebraic or…

Number Theory · Mathematics 2025-04-24 Alin Bostan , Bruno Salvy , Michael F. Singer

In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yaacov Tzeitlin

Curved A-infinity algebras appear in nature as deformations of dg algebras. We develop the basic theory of curved A-infinity algebras and, in particular, curved dg algebras. We investigate their link with a suitable class of dg coalgebras…

Representation Theory · Mathematics 2010-10-05 Pedro Nicolas

There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences,…

Information Theory · Computer Science 2008-02-21 Marni Mishna , Mike Zabrocki
‹ Prev 1 2 3 10 Next ›