Related papers: D-Algebraic Functions
Generating functions and functional equations of Dickson polynomials of the first and second kind are derived and continued analytically. These formulae are expressed in terms of the incomplete gamma function over complex variables of the…
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
A lot of information concerning solutions of linear differential equations can be computed directly from the equation. It is therefore natural to consider these equations as a data-structure, from which mathematical properties can be…
Using model theory and differential algebra, we give necessary conditions for algebraic ordinary differential equations to have a complex Pfaffian solution on some complex domain. These tools also allow us to give many examples of algebraic…
A further significant extension is presented of the infinitely large class of differential algebras of generalized functions which are the basic structures in the nonlinear algebraic theory listed under 46F30 in the AMS Mathematical Subject…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
In this note, we observe a relation between dialgebras (in particular, Leibniz algebras) and conformal algebras. The purpose is to show how the methods of conformal algebras help solving problems on dialgebras, and, conversely, how the…
Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…
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…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
We tersely review a recently introduced technique to identify systems of two nonlinearly-coupled Ordinary Di{\S}erential Equations (ODEs) solvable by algebraic operations; and we report some specifc examples of this kind, namely systems of…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
Gelfand--Dorfman bialgebras (GD-algebras) are nonassociative systems with two bilinear operations satisfying a series of identities that express Hamiltonian property of an operator in the formal calculus of variations. The paper is devoted…
Based on results about open string correlation functions, a nonassociative algebra was proposed in a recent paper for D-branes in a background with nonvanishing $H$. We show that our associative algebra obtained by quantizing the endpoints…
Let $D$ be a divisor in ${\bf C}^n$. We present methods to compare the ${\mathcal D}$-module of the meromorphic functions ${\mathcal O}[* D]$ to some natural approximations. We show how the analytic case can be treated with computations in…