Related papers: On certain maps defined by infinite sums
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…
We define the notion of an indexed profunctor over a 2-category, and use it to develop an abstract theory of limits. The theory subsumes (conical) limits, weighted limits, ends and Kan extensions. Results include an abstract version of the…
Multiple zeta-star values are variants of multiple zeta values which allow equality in the definition. Similar to the theory of continued fractions, every real number which is greater than $1$ can be realized as an unique infinite multiple…
In this paper, sums represented in (3) are studied. The expressions are derived in terms of Bessel functions of the first and second kinds and their integrals. Further, we point out the integrals can be written as a Meijer G function.
In this short note we use ideas from systems theory to define a functional calculus for infinitesimal generators of strongly continuous semigroups on a Hilbert space. Among others, we show how this leads to new proofs of (known) results in…
A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.
An overview of some basic notions is given, especially with an eye towards somewhat "fractal" examples, such as infinite products of cyclic groups, p-adic numbers, and solenoids.
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Some fixed point results are given for a class of functional contractions over partial metric spaces. These extend some contributions in the area due to Ilic et al [Math. Comput. Modelling, 55 (2012), 801-809].
The purpose of the present article is to obtain the condition that the function defined by infinite composition of entire functions becomes an entire function. Moreover, as an example of such functions, we study a function called Poincare…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.
Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…