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

Using a result of Behrend concerning sets without arithmetic progressions, we construct some examples of dynamical systems with slow time of multiple recurrence. Our theorem is a quatitative analog of Furstenberg's Correspondence Principle.

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…

We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…

Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…

We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…

We study Poincar\'e recurrence from a purely geometrical viewpoint. We prove that the metric entropy is given by the exponential growth rate of return times to dynamical balls. This is the geometrical counterpart of Ornstein-Weiss theorem.…

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a…

We explore the structure of non-redundant and minimal sets consisting of graded if-then rules. The rules serve as graded attribute implications in object-attribute incidence data and as similarity-based functional dependencies in a…

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

We prove structure theorems for o-minimal definable subsets $S\subset G$ of definable groups containing large multiplicative structures, and show definable groups do not have bounded torsion arbitrarily close to the identity. As an…

Recurrence determinism, one of the fundamental characteristics of recurrence quantification analysis, measures predictability of a trajectory of a dynamical system. It is tightly connected with the conditional probability that, given a…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…

Using a recent Furstenberg structure theorem, we obtain a quantitative multiple recurrence theorem relative to any locally compact second countable Noetherian module over a syndetic ring.

In this paper we study topological entropy and recurrence properties of non-autonomous dynamical system generated by a family of continuous self maps on a compact space X. Specially, we introduce the pseudo-entropy and…

We show that, under suitable assumptions, Poincare recurrences of a dynamical system determine its topology in phase space. Therefore, dynamical systems with the same recurrences are topologically equivalent.

We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of $\mathsf{BPTIME}$: proving hierarchy theorems and showing the existence of complete problems. Our main contributions can be…

In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…