Related papers: Proof of Murphy-Cohen Conjecture on One-dimensiona…
We study collections of point masses which move freely along the real line and stick together when they collide via perfectly inelastic collisions. We quantify the way particles stick together and explain how to associate a probability…
The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
Suppose we have a natural Hamiltonian $H$ of $n$ particles on the line, centre of mass momentum $P$ and a further independent quantity $Q$, cubic in the momenta. If these are each $S_{n}$ invariant and mutually Poisson commute we have the…
We consider the dynamics of a collection of particles that interact pairwise and are restricted to move along the real line. Moreover, we focus on the situation in which particles undergo perfectly inelastic collisions when they collide.…
We introduce a simple dynamical rule in which each particle locates a particle that is farthest from it and moves towards it. Repeated application of this algorithm results in the formation of unusual dynamical patterns: during the process…
We study the dynamics of one-dimensional active particles confined in a double-well potential, focusing on the escape properties of the system, such as the mean escape time from a well. We first consider a single-particle both in near and…
In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…
We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above…
When we use variational methods to study the Newtonian $N$-body problem, the main problem is how to avoid collisions. C.Marchal got a remarkable result, that is, a path minimizing the Lagrangian action functional between two given…
We first study a $d$-dimensional branching Brownian motion (BBM) among mild Poissonian obstacles, where a random trap field in $\mathbb{R}^d$ is created via a Poisson point process. The trap field consists of balls of fixed radius centered…
We develop a unifying theory for four different objects: (1) infinite systems of interacting massive particles; (2) solutions to the Dean-Kawasaki equation with singular drift and space-time white noise; (3) Wasserstein diffusions with a.s.…
This paper is a step in the direction of understanding the behavior of non-intersecting Brownian motions on the real line, when the number of particles becomes large. Consider 2k non-intersecting Brownian motions, all starting at the…
Electrostatic forces between small groups of colloidal particles are measured using blinking optical tweezers. When the electrostatic screening length is significantly larger than the particle radius, forces are found to be non-pairwise…
Let $a < b$ be multiplicatively independent integers, both at least $2$. Let $A,B$ be closed subsets of $[0,1]$ that are forward invariant under multiplication by $a$, $b$ respectively, and let $C := A\times B$. An old conjecture of…
The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…
We study a one-dimensional hamiltonian chain of masses perturbed by an energy conserving noise. The dynamics is such that, according to its hamiltonian part, particles move freely in cells and interact with their neighbors through…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
In this paper we study the NP-Hard problem of maximizing the distance over an intersection of balls to a given point. We expand the results found in \cite{funcos1}, where the authors characterize the farthest in an intersection of balls…
The homogeneous Boltzmann equation for inelastic Maxwell mixtures is considered to study the dynamics of tracer particles or impurities (solvent) immersed in a uniform granular gas (solute). The analysis is based on exact results derived…