Related papers: A Deceptively Simple Quadratic Recurrence
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
We address the question as to why, in the semiclassical limit, classically chaotic systems generically exhibit universal quantum spectral statistics coincident with those of Random Matrix Theory. To do so, we use a semiclassical resummation…
The resurgence and asymptotic resurgence of an ideal in a polynomial ring are two statistics which measure the relationship between its regular and symbolic powers. We address two aspects of resurgence which can be studied via asymptotic…
In the first five sections, we deal with the class of probability measures with asymptotically periodic Verblunsky coefficients of p-type bounded variation. The goal is to investigate the perturbation of the Verblunsky coefficients when we…
We consider the estimation of parametric fractional time series models in which not only is the memory parameter unknown, but one may not know whether it lies in the stationary/invertible region or the nonstationary or noninvertible…
Recurrence in the phase space of complex systems is a well-studied phenomenon, which has provided deep insights into the nonlinear dynamics of such systems. For dissipative systems, characteristics based on recurrence plots have recently…
It is shown that the solutions of certain systems of nonlinear \"Orst-order recursions with polynomial right-hand sides may be rather easily ascertained, and display interesting evolutions in their ticking time variable (taking integer…
Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…
The Cauchy problem for a quasi-linear parabolic equation with a small parameter at a higher derivative is considered. The initial step-like function contains another small parameter. Formal asymptotic solutions of the problem in small…
We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…
The Lasso is a method for high-dimensional regression, which is now commonly used when the number of covariates $p$ is of the same order or larger than the number of observations $n$. Classical asymptotic normality theory does not apply to…
We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…
In multivariate regression estimation, the rate of convergence depends on the dimension of the regressor. This fact, known as the curse of the dimensionality, motivated several works. The additive model, introduced by Stone (10), offers an…
This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family…
Some results are proved concerning asymptotic and deficient values in connection with the second order linear differential equation $y'' + Ay = 0$, in which the coefficient $A$ is entire.
The integration by parts recurrence relations allow to reduce some Feynman integrals to more simple ones (with some lines missing). Nevertheless the possibility of such reduction for the given particular integral was unclear. The recently…
Generic quantum systems --as much as their classical counterparts-- pass arbitrarily close to their initial state after sufficiently long time. Here we provide an essentially exact computation of such recurrence times for generic…
In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…
This is an etude in experimental semi-rigorous (rigorizable!) mathematics. The leading asymptotics was brilliantly derived by Allan Berele and Amitai Regev for general hooks H(k,l) and general powers z, but what about more refined…