English
Related papers

Related papers: D-finite Numbers

200 papers

If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…

Commutative Algebra · Mathematics 2014-06-25 Martin Kohls , Hanspeter Kraft

Proportional delay is a particular case of time dependent delay. In this article, we consider differential equations involving multiple delays. The series solution of this equation leads to a class of special functions. This class of…

Dynamical Systems · Mathematics 2019-02-12 Jayvant Patade , Sachin Bhalekar

In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…

Algebraic Geometry · Mathematics 2024-07-22 Daniel Perrucci , Marie-Françoise Roy

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

Formal Languages and Automata Theory · Computer Science 2025-05-05 Olivier Carton , Jean-Michel Couvreur , Martin Delacourt , Nicolas Ollinger

We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…

Number Theory · Mathematics 2022-06-15 Khristo N. Boyadzhiev

Complex functions have multiple uses in various fields of study, so analyze their characteristics it is of extensive interest to other sciences. This work begins with a particular class of rational functions of a complex variable; over this…

Econometrics · Economics 2019-07-16 Guillermo Daniel Scheidereiter , Omar Roberto Faure

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Combinatorics · Mathematics 2013-01-22 Milan Janjic , Boris Petkovic

In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…

Classical Analysis and ODEs · Mathematics 2013-06-06 A. Chavez , S. Castillo , M. Pinto

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…

Symbolic Computation · Computer Science 2017-05-02 Johannes Middeke , Carsten Schneider

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

Numerical Analysis · Mathematics 2025-04-25 Kingsley Yeon

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…

Combinatorics · Mathematics 2011-11-28 Shi-Mei Ma

Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some…

Computational Complexity · Computer Science 2009-04-19 Akitoshi Kawamura

In algebraic geometry, one studies the solutions to polynomial equations, or, equivalently, to linear partial differential equations with constant coefficients. These lecture notes address the more general case when the coefficients are…

Algebraic Geometry · Mathematics 2019-12-18 Anna-Laura Sattelberger , Bernd Sturmfels

A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…

Algebraic Geometry · Mathematics 2014-10-13 Fernando Sancho de Salas

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we…

Commutative Algebra · Mathematics 2010-07-13 Akira Terui

The complex numbers are an important part of quantum theory, but are difficult to motivate from a theoretical perspective. We describe a simple formal framework for theories of physics, and show that if a theory of physics presented in this…

Category Theory · Mathematics 2012-09-24 Jamie Vicary

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set. The proof handles the simple cases via…

Logic · Mathematics 2026-04-20 Patrizio Cintioli

Highly oscillatory integrals, such as those involving Bessel functions, are best evaluated analytically as much as possible, as numerical errors can be difficult to control. We investigate indefinite integrals involving monomials in $x$…

Classical Analysis and ODEs · Mathematics 2017-03-21 Jolyon K. Bloomfield , Stephen H. P. Face , Zander Moss

The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…

Logic in Computer Science · Computer Science 2017-01-11 C. T. Chong , Gordon Hoi , Frank Stephan , Daniel Turetsky

We introduce a new foundation rank based in the relation of dividing between partial types. We call DU to this rank. We also introduce a new way to define the D rank over formulas as a foundation rank. In this way, SU, DU and D are…

Logic · Mathematics 2022-02-16 Santiago Cárdenas-Martín , Rafel Farré