相关论文: Multiple-Size Divide-and-Conquer Recurrences

We prove a local central limit theorem for "nonconventional" sums generated by some classes of sufficiently fast mixing sequences.

Logical theories have been developed which have allowed temporal reasoning about eventualities (a la Galton) such as states, processes, actions, events, processes and complex eventualities such as sequences and recurrences of other…

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

The nonlinear recurrences we consider here include the functions $3x(1-x)$ and $\cos(x)$, which possess attractive fixed points $2/3$ and $0.739...$ (Dottie's number). Detailed asymptotics for oscillatory convergence are found, starting…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

This paper deals with the inverse problem of recovering an arbitrary number of fractional damping terms in a wave equation. We develop several approaches on uniqueness and reconstruction, some of them relying on Tauberian theorems on the…

This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…

This paper takes the so-called probabilistic approach to the Strong Renewal Theorem (SRT) for multivariate distributions in the domain of attraction of a stable law. A version of the SRT is obtained that allows any kind of…

The problems and solutions contained here, all associated with nonlinear recurrences and long-term trends, are new (as far as is known).

We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…

Take an odd number x >0. Then 3x+1 is even and one can find an integer k> 0 so that y= 3x+1/2^k is again odd. We get in this way the mapping T, Tx=y. The paper contains two theorems describing statistical properties of T. The first…

(Note. The results of this manuscript has been merged and published with another paper of the same authors: A new approach to nonrepetitve sequences.) A repetition of size $h$ ($h\geqslant1$) in a given sequence is a subsequence of…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

Let $(A_n)_{n\in\mathbb{N}}$ be a stationary sequence of topical (i.e., isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n+1,x_0)=A_nx(n,x_0)$. It can model a wide range of systems including…

The recurrence rate and determinism are two of the basic complexity measures studied in the recurrence quantification analysis. In this paper, the recurrence rate and determinism are expressed in terms of the correlation sums, and strong…

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is…