Related papers: Erd\H{o}s' problem and $(n, \frac{1}{3})$-separate…

We prove a higher-dimensional version of the well-known Poincar\'e--Birkhoff theorem, using Floer homology. We also prove a relative version for Lagrangian submanifolds. The motivation is finding periodic orbits and Hamiltonian chords in…

Employing techniques from scattering amplitudes and effective field theory, we model the dynamics of hierarchical triples, which are three-body systems composed of two bodies separated by a distance $r$ and a third body a distance $\rho$…

We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's circle problem (1959). The proof relies on a…

We employ an extension of ergodic theory to the random setting to investigate the existence of random periodic solutions of random dynamical systems. Given that a random dynamical system has a dissipative structure, we proved that a random…

Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.

We show that there is an absolute constant $c>0$ such that the following holds. For every $n > 1$, there is a 5-uniform hypergraph on at least $2^{2^{cn^{1/4}}}$ vertices with independence number at most $n$, where every set of 6 vertices…

A set of cycles is called independent if no two of them have a common vertex. Let $S_{n, 2k-1}$ be the complete split graph, which is the join of a clique of size $2k-1$ with an independent set of size $n-2k+1$. In 1962, Erd\H{o}s and…

The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…

A well known result due to Andr\'asfai, Erd\H{o}s, and S\'os asserts that for $r\ge 2$ every $K_{r+1}$-free graph on $n$ vertices with $\delta(G)>\frac{3r-4}{3r-1}n$ is $r$-partite. We study related questions in the context of weighted…

Perturbations due to round-off errors in computer modeling are discontinuous and therefore one cannot use results like KAM theory about smooth perturbations of twist maps. We elaborate a special approximation scheme to construct two smooth…

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

The purpose of this work is twofold. First, we construct probabilistically strong solutions to the three-dimensional Euler equations perturbed by additive noise that are $\mathbb{P}$-almost surely continuous in time, H\"older in space, and…

The paper studies the existence of periodic solutions of a perturbed relativistic Kepler problem of the type \begin{equation*} \dfrac{\mathrm{d}}{\mathrm{d}t}\left(\frac{m\dot{x}}{\sqrt{1-|\dot{x}|^{2}/c^{2}}}\right) =…

The present work focuses on the study of the renowned Collatz conjecture, also known as the $3x +1$ problem. The distinguished analysis approach lies on the dynamics of an iterative map in binary form. A new estimation of the enlargement of…

In this article, we proposed new discrete maps with memory (DMM). These maps are derived from fractional differential equations (FDE) with the Hilfer fractional derivatives of non-integer orders and periodic sequence of kicks. The suggested…

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…

We present a novel approach for deriving KAM-type linearization theorems directly -- and almost immediately -- from the existence of the stable foliation for a renormalization operator. We give a few illustrations in dynamics in one and…