Related papers: Erd\H{o}s' problem and $(n, \frac{1}{3})$-separate…
The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…
We give some results about the dynamics of a particle moving in Euclidean three-space under the influence of the gravitational force induced by a fixed homogeneous circle. Our main results concern (1) singularities and (2) the dynamics in…
In this paper we deal with Diophantine equations involving products of consecutive integers, inspired by a question of Erd\H{o}s and Graham.
A periodic perturbation generates a complicated dynamics close to separatrices and saddle points. We construct an asymptotic solution which is close to the separatrix for the unperturbed Duffing's oscillator over a long time. This solution…
Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…
Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
In this paper we present a novel approach in extremal set theory which may be viewed as an asymmetric version of Katona's permutation method. We use it to find more Tur\'an numbers of hypergraphs in the Erd\H{o}s--Ko--Rado range. An…
We consider the exterior Cauchy-Dirichlet problem for equivariant wave maps from 3+1 dimensional Minkowski spacetime into the three-sphere. Using mixed analytical and numerical methods we show that, for a given topological degree of the…
This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of those working in Reverse Mathematics to take…
We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…
This paper studies the formulation, well-posedness, and numerical solution of Bayesian inverse problems on metric graphs, in which the edges represent one-dimensional wires connecting vertices. We focus on the inverse problem of recovering…
The three-body problem is arguably the oldest open question in astrophysics, and has resisted a general analytic solution for centuries. Various implementations of perturbation theory provide solutions in portions of parameter space, but…
What is the probability that the number of triangles in $\mathcal{G}_{n,p}$, the Erd\H{o}s-R\'enyi random graph with edge density $p$, is at least twice its mean? Writing it as $\exp[- r(n,p)]$, already the order of the rate function…
Given a directed graph, the Minimal Feedback Arc Set (FAS) problem asks for a minimal set of arcs which, when removed, results in an acyclic graph. Equivalently, the FAS problem asks to find an ordering of the vertices that minimizes the…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
A $k$-uniform family of subsets of $[n]$ is intersecting if it does not contain a disjoint pair of sets. The study of intersecting families is central to extremal set theory, dating back to the seminal Erd\H{o}s-Ko-Rado theorem of 1961 that…
We consider the trajectories of points on $\mathbb{S}^{d - 1}$ under sequences of certain folding maps associated with reflections. The main result characterizes collections of folding maps that produce dense trajectories. The minimal…
A new method is proposed to numerically integrate a dynamical system on a manifold such that the trajectory stably remains on the manifold and preserves first integrals of the system. The idea is that given an initial point in the manifold…
We study two problems in graph Ramsey theory. In the early 1970's, Erd\H{o}s and O'Neil considered a generalization of Ramsey numbers. Given integers $n,k,s$ and $t$ with $n \ge k \ge s,t \ge 2$, they asked for the least integer…