English
Related papers

Related papers: Automaticity of uniformly recurrent substitutive s…

200 papers

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

Information Theory · Computer Science 2010-08-20 Graham H. Norton

We establish a one-to-one correspondence between (i) exchangeable sequences of random variables whose finite-dimensional distributions are minimum (or maximum) infinitely divisible and (ii) non-negative, non-decreasing, infinitely divisible…

Probability · Mathematics 2022-09-21 Florian Brück , Jan-Frederik Mai , Matthias Scherer

The theory of substitution sequences and their higher-dimensional analogues is intimately connected with symbolic dynamics. By systematically studying the factors (in the sense of dynamical systems theory) of a substitution dynamical…

Dynamical Systems · Mathematics 2014-09-30 Michael Baake , Franz Gähler , Uwe Grimm

We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The…

Formal Languages and Automata Theory · Computer Science 2021-02-16 A. R. Balasubramanian , K. S. Thejaswini

We construct a minimal subshift \((X^{*},\sigma)\) that serves as an open proximal extension of its maximal equicontinuous factor. We establish that every point in this subshift is multiply recurrent minimal. This work solves an open…

Dynamical Systems · Mathematics 2025-11-20 Zijie Lin , Kangbo Ouyang

We analyze a class of models for unequal crossover (UC) of sequences containing sections with repeated units that may differ in length. In these, the probability of an `imperfect' alignment, in which the shorter sequence has d units without…

Dynamical Systems · Mathematics 2007-05-23 Oliver Redner , Michael Baake

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Number Theory · Mathematics 2024-03-22 Florian Luca , Tom Ward

We form a sequence of oblong matrices by evaluating an integrable vector-valued function along the orbit of an ergodic dynamical system. We obtain an almost sure asymptotic result for the permanents of those matrices. We also give an…

Dynamical Systems · Mathematics 2016-10-24 Jairo Bochi , Godofredo Iommi , Mario Ponce

This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…

Systems and Control · Electrical Eng. & Systems 2021-11-11 Atreyee Kundu

We consider mutually disjoint family of measure preserving transformations $T_1, \cdots, T_k$ on a probability space $(X, \mathcal{B}, \mu)$. We obtain the multiple recurrence property of $T_1, \cdots, T_k$ and this result is utilized to…

Dynamical Systems · Mathematics 2021-07-26 Michihiro Hirayama , Dong Han Kim , Younghwan Son

The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper we study subshifts of finite symbolic rank as…

Dynamical Systems · Mathematics 2025-02-12 Su Gao , Ruiwen Li

We obtain a description of the Poincar\'e recurrences of chaotic systems in terms of the ergodic theory of transient chaos. It is based on the equivalence between the recurrence time distribution and an escape time distribution obtained by…

Chaotic Dynamics · Physics 2008-04-29 Eduardo G. Altmann , Tamas Tel

We study different pointwise recurrence notions for linear dynamical systems from the Ergodic Theory point of view. We show that from any reiteratively recurrent vector $x_0$, for an adjoint operator $T$ on a separable dual Banach space…

Functional Analysis · Mathematics 2022-12-22 Sophie Grivaux , Antoni López-Martínez

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Combinatorics · Mathematics 2016-08-05 Gasper Fijavz , Matthias Kriesell

Deviation of ergodic sums is studied for substitution dynamical systems with a matrix that admits eigenvalues of modulus 1. We consider the corresponding eigenfunctions, and in Theorem 1.1 we prove that the limit inferior of the ergodic…

Dynamical Systems · Mathematics 2014-07-28 Xavier Bressaud , Alexander I. Bufetov , Pascal Hubert

We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1,...,n} occurs k times, where k may depend on n. This generalizes the famous…

Combinatorics · Mathematics 2025-04-08 Lucas Gerin

We prove that for recurrent, reversible graphs, the following conditions are equivalent: (a) existence and uniqueness of the potential kernel, (b) existence and uniqueness of harmonic measure from infinity, (c) a new anchored Harnack…

Probability · Mathematics 2021-10-12 Nathanaël Berestycki , Diederik van Engelenburg

Let K denote a compact invariant set for a strongly monotone semiflow in an ordered Banach space E, satisfying standard smoothness and compactness assumptions. Suppose the semiflow restricted to K is chain transitive. The main result is…

Dynamical Systems · Mathematics 2012-04-10 Morris W. Hirsch

The Arnoux-Rauzy-Poincar\'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar\'e algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in…

Discrete Mathematics · Computer Science 2015-02-09 Valérie Berthé , Sébastien Labbé

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

Logic in Computer Science · Computer Science 2019-10-22 António Malheiro , Paulo Guilherme Santos
‹ Prev 1 4 5 6 7 8 10 Next ›