English
Related papers

Related papers: A structure theorem for polynomial return-time set…

200 papers

The goal of this paper is to survey the history, development and current status of the Return Times Theorem and its many extensions and variations. Let $(X, \mathcal{F}, \mu)$ be a finite measure space and let $T:X \rightarrow X$ be a…

Dynamical Systems · Mathematics 2012-09-06 Idris Assani , Kimberly Presser

We show that the probability distribution function that best fits the distribution of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space deviates from the exponential statistics by a…

Chaotic Dynamics · Physics 2015-05-13 Murilo S. Baptista , Dariel M. Maranhao , Jose C. Sartorelli

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

Mathematical Physics · Physics 2014-11-03 Maryna Nesterenko , Jiri Patera , Agnieszka Tereszkiewicz

This paper is a first step in the study of the recurrence behavior in random dynamical systems and randomly perturbed dynamical systems. In particular we define a concept of quenched and annealed return times for systems generated by the…

Dynamical Systems · Mathematics 2009-10-12 Philippe Marie , Jerome Rousseau

In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…

Classical Analysis and ODEs · Mathematics 2011-03-22 Xiangyu Liang

A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…

Logic · Mathematics 2010-10-19 A. A. Vladimirov

Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…

Metric Geometry · Mathematics 2019-06-18 Herbert Edelsbrunner , Nataliya Strelkova

For strictly ergodic systems, we introduce the class of CF-Nil($k$) systems: systems for which the maximal measurable and maximal topological $k$-step pronilfactors coincide as measure-preserving systems. Weiss' theorem implies that such…

Dynamical Systems · Mathematics 2022-05-13 Yonatan Gutman , Zhengxing Lian

For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…

Dynamical Systems · Mathematics 2015-11-19 Xueting Tian

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

Combinatorics · Mathematics 2025-09-05 G. Conant , C. Terry

A topological dynamical system induces two natural systems, one is on the hyperspace and the other one is on the probability space. The connection among some dynamical properties on the original space and on the induced spaces are…

Dynamical Systems · Mathematics 2014-01-03 Jie Li , Kesong Yan , Xiangdong Ye

Variational monotone recurrence relations arise in solid state physics as generalizations of the Frenkel-Kontorova model for a ferromagnetic crystal. For such problems, Aubry-Mather theory establishes the existence of "ground states" or…

Dynamical Systems · Mathematics 2019-02-20 Blaz Mramor , Bob Rink

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

Optimization and Control · Mathematics 2025-04-28 Kazuo Murota , Akihisa Tamura

We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…

Dynamical Systems · Mathematics 2026-03-20 Eduardo Santana

This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…

Quantum Physics · Physics 2025-10-24 Tommaso Grigoletto

The current paper is devoted to the investigation of the influence of nested invariant cone structure on the dynamics, in the context of non-autonomous (time almost periodic)cases. We first prove that the nested invariant cone structure can…

Dynamical Systems · Mathematics 2024-11-20 Dun Zhou

The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…

Computational Complexity · Computer Science 2025-08-19 Robert Andrews , Deepanshu Kush , Roei Tell

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

Symbolic Computation · Computer Science 2021-11-19 Jérémy Berthomieu , Mohab Safey El Din

This paper studies topological definitions of chain recurrence and shadowing for continuous endomorphisms of topological groups generalizing the relevant concepts for metric spaces. It is proved that in this case the sets of chain recurrent…

General Topology · Mathematics 2019-12-19 Seyyed Alireza Ahmadi , Javad Jamalzadeh , Xinxing Wu

The min-rank of a graph was introduced by Haemers (1978) to bound the Shannon capacity of a graph. This parameter of a graph has recently gained much more attention from the research community after the work of Bar-Yossef et al. (2006). In…

Combinatorics · Mathematics 2016-11-26 Son Hoang Dau , Yeow Meng Chee
‹ Prev 1 4 5 6 7 8 10 Next ›