English
Related papers

Related papers: IPr* recurrence and nilsystems

200 papers

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…

Dynamical Systems · Mathematics 2024-12-16 Ulrich Bauer , David Hien , Oliver Junge , Konstantin Mischaikow

We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…

Exactly Solvable and Integrable Systems · Physics 2008-07-17 A. N. W. Hone

This work is a continuation of [Kalikaeva, MPRF, 23(2):225-240]. The object of study is ``Markov-up processes'' on $\mathbb Z_+$ and the moment of downcrossing a certain barrier. The processes considered in this paper differ from Markov…

Probability · Mathematics 2024-07-01 Diana Kalikaeva

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Mathematical Physics · Physics 2009-11-11 Satoru Saito , Noriko Saitoh

Implicit Neural Representations (INRs) have revolutionized signal processing and computer vision by modeling signals as continuous, differentiable functions parameterized by neural networks. However, INRs are prone to the spectral bias…

Computer Vision and Pattern Recognition · Computer Science 2026-04-29 Ali Haider , Muhammad Salman Ali , Maryam Qamar , Tahir Khalil , Soo Ye Kim , Jihyong Oh , Enzo Tartaglione , Sung-Ho Bae

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

Number Theory · Mathematics 2014-02-05 Constantin M. Petridi

We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…

Logic in Computer Science · Computer Science 2025-10-31 Salvador Lucas

We show that a doubly minimal system $X$ has the property that for every minimal system $Y$ the orbit closure of any pair $(y,x) \in Y \times X$ is either $Y \times X$ or it has the form $\Gamma_\pi = \{(\pi(x),x) : x \in X\}$ for some…

Dynamical Systems · Mathematics 2015-08-13 Eli Glasner , Benjamin Weiss

For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…

Number Theory · Mathematics 2014-04-18 Tewodros Amdeberhan , Christoph Koutschan , Victor H. Moll , Eric S. Rowland

The average shadowing property is considered for set-valued dynamical systems, generated by parameterized IFS, which are uniformly contracting, or conjugacy, or products of such ones. We also prove that if a continuous surjective IFS F on a…

Dynamical Systems · Mathematics 2015-05-26 Mehdi Fatehi Nia

This paper presents a new approach for analysing structural properties of time series from complex systems. Starting from the concept of recurrences in phase space, the recurrence matrix of a time series is interpreted as the adjacency…

Chaotic Dynamics · Physics 2011-03-03 Reik V. Donner , Y. Zou , Jonathan F. Donges , Norbert Marwan , Juergen Kurths

In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

Cellular Automata and Lattice Gases · Physics 2010-12-07 Alexis Ballier , Emmanuel Jeandel

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

Combinatorics · Mathematics 2015-05-26 Scott Garrabrant , Igor Pak

We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the {\pi}-calculus as formulas. We provide correctness criterion,…

Logic in Computer Science · Computer Science 2026-05-15 Matteo Acclavio , Giulia Manara

We use sequences of t-induced T-nets and p-induced P-nets to convert free-choice nets into T-nets and P-nets while preserving properties such as well-formedness, liveness, lucency, pc-safety, and perpetuality. The approach is general and…

Formal Languages and Automata Theory · Computer Science 2021-06-18 Wil M. P. van der Aalst

We use recurrences of integrals to give new and elementary proofs of the irrationality of pi, tan(r) for all nonzero rational r, and cos(r) for all nonzero rational r^2. Immediate consequences to other values of the elementary…

Number Theory · Mathematics 2009-11-20 Li Zhou , Lubomir Markov

This paper studies recurrence phenomena in iterative holomorphic dynamics of certain multi-valued maps. In particular, we prove an analogue of the Poincar\'e recurrence theorem for meromorphic correspondences with respect to certain…

Complex Variables · Mathematics 2022-05-10 Mayuresh Londhe

An unexpected and somewhat surprising observation is that two counter-cascaded systems, given the right conditions, can exhibit multivaluedness from one of the outputs to the other. The main result presented here is a necessary and…

Systems and Control · Electrical Eng. & Systems 2020-01-28 Michael Antonie van Wyk

We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic…

Logic in Computer Science · Computer Science 2015-07-01 Dexter Kozen
‹ Prev 1 3 4 5 6 7 10 Next ›