English
Related papers

Related papers: Some notes on Lamperti's recurrence of stochastic …

200 papers

This note presents conjectures on polynomial/algebraic/sub-exponential convergence of transition probabilities for $\lambda$-null recurrent and $\lambda$-transient Markov chains in continuous time. The only known positive examples are in…

Probability · Mathematics 2022-02-14 Phil. Pollett

This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…

Classical Analysis and ODEs · Mathematics 2018-01-30 Sheehan Olver , Alex Townsend , Geoff Vasil

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

Combinatorics · Mathematics 2018-05-04 Pavel Galashin , Pavlo Pylyavskyy

The paper is concerned with a new approach for the recurrence property of the oscillating process on $\mathbb{Z}$ in Kemperman's sense. In the case when the random walk is ascending on $\mathbb{Z}^-$ and descending on $\mathbb{Z}^+$, we…

Probability · Mathematics 2022-01-06 D Vo

By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…

Number Theory · Mathematics 2013-04-04 Cheng Lien Lang , Mong Lung Lang

The Law of the Iterated Logarithm for some Markov operators, which converge exponentially to the invariant measure, is established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell…

Probability · Mathematics 2016-03-23 Sander C. Hille , Katarzyna Horbacz , Tomasz Szarek , Hanna Wojewódka

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

We consider the recurrence and transience problem for a time-homogeneous Markov chain on the real line with transition kernel $p(x,\mathrm{d}y)=f_x(y-x)\,\mathrm{d}y$, where the density functions $f_x(y)$, for large $|y|$, have a power-law…

Probability · Mathematics 2013-12-19 Nikola Sandrić

We prove two-term supercongruences for generalizations of recently discovered sporadic sequences of Cooper. We also discuss recent progress and future directions concerning other types of supercongruences.

Number Theory · Mathematics 2021-02-04 Robert Osburn , Brundaban Sahu , Armin Straub

We consider a new family of $\R^d$-valued L\'{e}vy processes that we call Lamperti stable. One of the advantages of this class is that the law of many related functionals can be computed explicitely (see for instance \cite{cc}, \cite{ckp},…

Probability · Mathematics 2008-03-06 M. E. Caballero , J. C. Pardo , J. L. Pérez

The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…

Combinatorics · Mathematics 2016-04-19 Nikolai V. Ivanov

Let T be a bounded linear operator acting on a complex Banach space X and (\lambda_n) a sequence of complex numbers. Our main result is that if |\lambda_n|/|\lambda_{n+1}| \to 1 and the sequence (\lambda_n T^n) is frequently universal then…

Functional Analysis · Mathematics 2013-10-14 George Costakis , Ioannis Parissis

In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…

Combinatorics · Mathematics 2016-01-12 Nazmiye Yilmaz , Necati Taskara

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic · Mathematics 2023-06-22 Noam Zeilberger

We investigate the inversion of perturbation series and its resummation, and prove that it is related to a recently developed parametric perturbation theory. Results for some illustrative examples show that in some cases series reversion…

Mathematical Physics · Physics 2009-11-13 Paolo Amore , Francisco M. Fernandez

After a brief review of the key theorems concerning recurrent sequences, we give an explicit computation of the inverse of the Vandermonde matrix. This will then be used to derive sub-exponential decay error terms in the ergodic theorem of…

Combinatorics · Mathematics 2025-10-07 Rebecca Carter , M. Ram Murty

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Probability · Mathematics 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…