Related papers: Increasing-decreasing patterns in the iteration of…

Suppose that a target function is monotonic, namely, weakly increasing, and an original estimate of the target function is available, which is not weakly increasing. Many common estimation methods used in statistics produce such estimates.…

We present an algorithm for the efficient numerical evaluation of integrals of the form \[ I(\omega) = \int_0^1 F( x,\mathrm e^{\mathrm i \omega x}; \omega) \, \mathrm d x \] for sufficiently smooth but otherwise arbitrary $F$ and $\omega…

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…

In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…

We prove the following higher-order Szego theorems: if a measure on the unit circle has absolutely continuous part $w(\theta)$ and Verblunsky coefficients $\alpha$ with square-summable variation, then for any positive integer $m$, $\int…

Inspired by some iterative algorithms useful for proving the real analyticity (or the Gevrey regularity) of a solution of a linear partial differential equation with real-analytic coefficients, we consider the following question. Given a…

Let $f(n)$ count the number of subsets of $\{1,...,n\}$ without an element dividing another. In this paper I show that $f(n)$ grows like the $n$-th power of some real number, in the sense that $\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists.…

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…

Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…

We study a fixed-window counting system in which integers are represented by words of constant length while the alphabet grows as needed. This viewpoint arises from De Bruijn sequences: for fixed order $n$, the reverse prefer-max sequence…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

In this paper we show that every $L^1$-integrable function on $\partial\Omega$ can be obtained as the trace of a function of bounded variation in $\Omega$ whenever $\Omega$ is a domain with regular boundary $\partial\Omega$ in a doubling…

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness or, equivalently, efficiency, namely the ability to…

For a $k$-uniform hypergraph $F$ and a positive integer $n$, the Ramsey number $r(F,n)$ denotes the minimum $N$ such that every $N$-vertex $F$-free $k$-uniform hypergraph contains an independent set of $n$ vertices. A hypergraph is…

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…