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

Conley in \cite{Con} constructed a complete Lyapunov function for a flow on compact metric space which is constant on orbits in the chain recurrent set and is strictly decreasing on orbits outside the chain recurrent set. This indicates…

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

This note is a shortened version of my dissertation thesis, defended at Stony Brook University in December 2004. It illustrates how dynamic complexity of a system evolves under deformations. The objects I considered are quartic polynomial…

Giordano, Putnam and Skau showed that topological full groups of Cantor minimal systems are complete invariants for flip conjugacy. We will completely determine the structure of normal subgroups of the topological full group. Moreover, a…

We prove a first inverse theorem for Gowers norms on all finite abelian groups that uses only nilmanifolds (rather than possibly more general nilspaces). This makes progress toward confirming the Jamneshan--Tao conjecture. The correlating…

We consider Reeb flows on the tight $3$-sphere admitting a pair of closed orbits forming a Hopf link. If the rotation numbers associated to the transverse linearized dynamics at these orbits fail to satisfy a certain resonance condition…

Let $G$ be a countable infinite discrete group. We show that a subset $F$ of $G$ contains a return time set of some piecewise syndetic recurrent point $x$ in a compact Hausdorff space $X$ with a $G$-action if and only if $F$ is a…

This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…

The framework of joint typical periodic optimization, in which both the dynamical system and the potential function are allowed to vary simultaneously, was introduced in [HHJL25], in a direction motivated by the work of Yang, Hunt & Ott…

It is an immediate consequence of the ergodic structure theorem of Host and Kra that every factor of an ergodic $k$-step pro-nilsystem is again an ergodic $k$-step pro-nilsystem. It has remained open whether this fact can be proved…

This paper forms the third part of a series by the authors [GMV1,GMV2] concerning the structure theory of nilspaces. A nilspace is a compact space $X$ together with closed collections of cubes $C^n(X)\subseteq X^{2^n}$, $n=1,2,\ldots$,…

In a previous effort [arXiv:1708.05492] we have created a framework that explains why topological structures naturally arise within a scientific theory; namely, they capture the requirements of experimental verification. This is…

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity…

We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

Choosing the optimal observable to model dynamical systems for which we do not know the driving equations is nearly always an ad hoc art. Takens' Delay Embedding Theorem guarantees a diffeomorphism between delay-coordinate vectors built…

In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…

In this paper, we prove that any perfect complex of $D^{\infty}$-modules may be reconstructed from its holomorphic solution complex provided that we keep track of the natural topology of this last complex. This is to be compared with the…