Related papers: What is a closed-form number?
The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…
Conventional wisdom assumes that the indefinite integral of the probability density function for the standard normal distribution cannot be expressed in finite elementary terms. While this is true, there is an expression for this…
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…
A generic extension $L[x]$ of $L$ by a real $x$ is defined, in which the $\mathsf E_0$-class of $x$ is a lightface $\Pi^1_2$ set containing no ordinal-definable reals.
An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations…
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…
For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers,[a,a*]=1, i.e. we provide exact and explicit expressions for its normal form which has all a's to the…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
In a noncommutative algebra there is no canonical way to express elements in univalent way, which is often called "ordering problem". In this note we give product formula of the Weyl algebra in generic ordered expression. In particular, the…
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…
In this paper, we prove that a pseudoexponential field has continuum many non-isomorphic countable real closed exponential subfields, each with an order preserving exponential map which is surjective onto the nonnegative elements. Indeed,…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.
The problem of evaluation of higher derivatives of Airy functions in a closed form is investigated. General expressions for the polynomials which have arisen in explicit formulae for these derivatives are given in terms of particular values…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…