Related papers: On a total function which overtakes all total recu…
For a family of weight functions, $h_\kappa$, invariant under a finite reflection group on $\RR^d$, analysis related to the Dunkl transform is carried out for the weighted $L^p$ spaces. Making use of the generalized translation operator and…
Many things in mathematics seem lamost unreasonably nice. This includes objects, counterexamples, proofs. In this preprint I discuss many examples of this phenomenon with emphasis on the ring of polynomials in a countably infinite number of…
A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…
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…
The aim of this paper is to study a whole class of first order differential inclusions, which fit into the framework of perturbed sweeping process by uniformly prox-regular sets. After obtaining well-posedness results, we propose a…
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming…
We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…
In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
In this paper, we study the problem of generating inputs to a higher-order program causing it to error. We first study the problem in the setting of PCF, a typed, core functional language and contribute the first relatively complete method…
This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…