Related papers: Means of iterates
In this study, several interesting iterative sequences were investigated. First, we define the iterative sequences. We fix function f(n). An iterative sequence starts with a natural number n, and calculates the sequence f(n),f(f(n)),…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We prove that a locally integrable function $f:(a,b) \to \mathbb R$ must be affine if its mean oscillation, considered as a function of intervals, can be extended to a locally finite Borel measure. In particular, we show that any function…
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…
On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $F^k(\mathbf{r})$ falls…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…
The paperfolding sequences form an uncountable class of infinite sequences over the alphabet $\{ -1, 1 \}$ that describe the sequence of folds arising from iterated folding of a piece of paper, followed by unfolding. In this note we observe…
We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…
In this paper, we investigate the existence of $C^n$, $n\in \mathbb{N}^+$, solutions for a class of second-order iterative functional equations involving iterates of the unknown function and a nonlinear term. Applying the Fiber Contraction…
We give an example of an $\mathsf{FIID}$ vertex-labeling of $\mathbb{T}_3$ whose marginals are uniform on $[0,1]$, and if we delete the edges between those vertices whose labels are different, then some of the remaining clusters are…
Let F be a family of holomorphic functions and let K be a constant less than 4. Suppose that for all f in F the second iterate of f does not have fixed points for which the modulus of the multiplier is greater than K. We show that then F is…
Given a real function $f$ on an interval $[a,b]$ satisfying mild regularity conditions, we determine the number of zeros of $f$ by evaluating a certain integral. The integrand depends on $f, f'$ and $f''$. In particular, by approximating…
We propose a notion of iterating functions $f:X^{k}\rightarrow X$ in a way that represents recurrence relations of the form $a_{n+k}=f(a_{n},a_{n+1},...,a_{n+k-1})$. We define a function as $n$-involutory when its $n$th iterate is the…
For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…
We provide estimates on the fat-shattering dimension of aggregation rules of real-valued function classes. The latter consists of all ways of choosing $k$ functions, one from each of the $k$ classes, and computing a pointwise function of…
The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…
We study the problem of estimating a manifold from random samples. In particular, we consider piecewise constant and piecewise linear estimators induced by k-means and k-flats, and analyze their performance. We extend previous results for…
In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We…
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…