Related papers: New Obstacles to Multiple Recurrence
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
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…
We study non-recurrence sets for weakly mixing dynamical systems by using linear dynamical systems. These are systems consisting of a bounded linear operator acting on a separable complex Banach space X, which becomes a probability space…
A vertex colouring of a graph $G$ is "nonrepetitive" if $G$ contains no path for which the first half of the path is assigned the same sequence of colours as the second half. Thue's famous theorem says that every path is nonrepetitively…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
We construct a set of strong recurrence which is not a van der Corput set. This shows that the class of enhanced van der Corput sets is a proper subclass of sets of strong recurrence. In addition, we derive that the class of sets of strong…
This paper's central theme is to prove the existence of an n-algebra whose multiplication cannot be expressed employing any binary operation. Furthermore, to prove if two algebras are not isomorphic, this property does not hold for…
We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we…
An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…
We consider the complexity of special $\alpha$-limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necessarily Borel, even in the case of a surjective map on…
Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…
The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\varepsilon>0$, we have $\mu(A\cap T^{-n}A)\geq \mu(A)^2-\varepsilon$ for infinitely many $n\in \mathbb{N}$. We show that there are…
We give some results on the existence of bounded remainder sets (BRS) for sequences of the form $(\{a_n\alpha\})_{n\geq 1}$, where $(a_n)_{n\geq 1}$ - in most cases - is a given sequence of distinct integers. Further we introduce the…
A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, extending a conjecture of Erdos asserted that every graph is…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the…
A set $E \subset \mathbb{N}$ is an interpolation set for nilsequences if every bounded function on $E$ can be extended to a nilsequence on $\mathbb{N}$. Following a theorem of Strzelecki, every lacunary set is an interpolation set for…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…
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.…