Related papers: A Deceptively Simple Quadratic Recurrence
Reconstructing a hypothetical recurrence equation from the first terms of an infinite sequence is a classical and well-known technique in experimental mathematics. We propose a variation of this technique which can succeed with fewer input…
Asymptotic expansions for a wide class of distribution are studied. A simple method for computation of the series coefficients is suggested. The case when regularization parameter of the distribution depends on the asymptotic parameter is…
For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we…
Higher Lie characters form a distinguished family of symmetric group characters, which appear in many areas of algebra and combinatorics. An old open problem of Thrall is to decompose them into irreducibles. We propose a novel asymptotic…
In this short note, we reprove in a very elementary way some known facts about Pisano periods as well as some considerations about the link between Pisano periods and the order of roots of the characteristic equation. The technics only…
In this paper we study the asymptotics (as $n\to \infty$) of the sequences of Laguerre polynomials with varying complex parameters $\alpha$ depending on the degree $n$. More precisely, we assume that $\alpha_n = n A_n, $ and $ \lim_n A_n=A…
We study linear recurrences of Eulerian type of the form \[ P_n(v) = (\alpha(v)n+\gamma(v))P_{n-1}(v) +\beta(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $\alpha(v), \beta(v)$ and $\gamma(v)$ are in most cases polynomials…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate…
This paper deals with the asymptotic statistical properties of a class of redescending M-estimators in linear models with increasing dimension. This class is wide enough to include popular high breakdown point estimators such as…
Problems in exponential asymptotics are typically characterized by divergence of the associated asymptotic expansion in the form of a factorial divided by a power. In this paper, we demonstrate that in certain classes of problems that…
By different methods we show that for dynamical chaos in the standard map with critical golden curve the Poincar\'e recurrences P(\tau) and correlations C(\tau) asymptotically decay in time as P ~ C/\tau ~ 1/\tau^3. It is also explained why…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
The often elusive Poincar\'e recurrence can be witnessed in a completely separable system. For such systems, the problem of recurrence reduces to the classic mathematical problem of simultaneous Diophantine approximation of multiple…
Many learning machines such as normal mixtures and layered neural networks are not regular but singular statistical models, because the map from a parameter to a probability distribution is not one-to-one. The conventional statistical…
In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…
Replication studies estimate the replicability rate of scientific results by aggregating binary verdicts of experiments. Exact replications are rarely attainable, so most replication sequences are non-exact. Experiments differ in ways that…
Quadratic assignment problems are a fundamental class of combinatorial optimization problems which are ubiquitous in applications, yet their exact resolution is NP-hard. To circumvent this impasse, it was proposed to regularize such…
Asymptotic equivalence results for nonparametric regression experiments have always assumed that the variances of the observations are known. In practice, however the variance of each observation is generally considered to be an unknown…
The period-doubling sequence is one of the most well-known aperiodic $0$-$1$ sequences. In this paper, a complete description of its symbolic recurrence plot is given, and formulas for asymptotic values of basic recurrence quantifiers are…