Related papers: On functions without a normal order
Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…
We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…
Motivated by some applications in applied mathematics, biology, chemistry, physics and engineering sciences, new tight Tur\'an type inequalities for modified Bessel functions of the first and second kind are deduced. These inequalities…
The theory of distributions provides generalized solutions for problems which do not have a classical solution. However, there are problems which do not have solutions, not even in the space of distributions. As model problem you may think…
Some Tur\'an type inequalities for Struve functions of the first kind are deduced by using various methods developed in the case of Bessel functions of the first and second kind. New formulas, like Mittag-Leffler expansion, infinite product…
Let F(z) be a rational function in Q(z) of degree at least 2 with F(0) = 0 and such that F does not vanish to order d at 0. Let b be a rational number having infinite orbit under iteration of F, and write F^n(b) = A_n/B_n as a fraction in…
In this paper some Tur\'an type inequalities for the general Bessel function, monotonicity and bounds for its logarithmic derivative are derived. Moreover we find the series representation and the relative extrema of the Tur\'anian of…
We introduce an order on the set of non-divisorial ideals of a numerical semigroup $S$, and link antichains of this order with the star operations on $S$; subsequently, we use this order to find estimates on the number of star operations on…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…
We offer new Tauberian theorems for a generalized partition function as our main result. Our analysis provides insight into asymptotic behavior of power series with arithmetic functions as coefficients.
The regular Tur\'an number of a graph $F$, denoted by rex$(n,F)$, is the largest number of edges in a regular graph $G$ of order $n$ such that $G$ does not contain subgraphs isomorphic to $F$. Giving a partial answer to a recent problem…
We study the rational Picard group of the projectivized moduli space of holomorphic n-differentials on complex genus g stable curves. We define (n - 1) natural classes in this Picard group that we call Prym-Tyurin classes. We express these…
The modulating functions method has been used for the identification of linear and nonlinear systems. In this paper, we generalize this method to the on-line identification of fractional order systems based on the Riemann-Liouville…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…
The classical K\H{o}v\'ari-S\'os-Tur\'an theorem states that if $G$ is an $n$-vertex graph with no copy of $K_{s,t}$ as a subgraph, then the number of edges in $G$ is at most $O(n^{2-1/s})$. We prove that if one forbids $K_{s,t}$ as an…
We investigate the average order of the divisor function at values of totally reducible binary cubic forms and discuss some applications.
For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…