English
Related papers

Related papers: Proof of Murphy-Cohen Conjecture on One-dimensiona…

200 papers

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

Probability · Mathematics 2019-07-04 Sourav Chatterjee , Matan Harel

We study one-dimensional elastic collisions of three point masses on a line under vacuum, with no triple collisions. We express momentum conservation in matrix form and analyze the composite map $D=D_{BC}D_{AB}$ and its powers $D^k$, which…

Classical Physics · Physics 2025-09-10 Shuhei Kobayashi

The Kneser--Poulsen Conjecture states that if the centers of a family of $N$ unit balls in ${\mathbb E}^d$ is contracted, then the volume of the union (resp., intersection) does not increase (resp., decrease). We consider two types of…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in the case…

Algebraic Geometry · Mathematics 2020-02-06 Peter Beelen , Mrinmoy Datta

We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…

Classical Analysis and ODEs · Mathematics 2016-04-11 Agelos Georgakopoulos , Mihail N. Kolountzakis

What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…

Combinatorics · Mathematics 2023-05-17 Eyal Ackerman , Balázs Keszegh , Günter Rote

In this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…

Metric Geometry · Mathematics 2012-03-19 Igors Gorbovickis

We consider the motion of a finite though large number of particles in the whole space R n. Particles move freely until they experience pairwise collisions. We use our recent theory of divergence-controlled positive symmetric tensors in…

Analysis of PDEs · Mathematics 2019-03-15 Denis Serre

We consider the dynamics of finite systems of point masses which move along the real line. We suppose the particles interact pairwise and undergo perfectly inelastic collisions when they collide. In particular, once particles collide, they…

Analysis of PDEs · Mathematics 2020-07-07 Ryan Hynd

We consider a one-dimensional system of particles, moving at constant velocities chosen independently according to a symmetric distribution on $\{-1,0,+1\}$, and annihilating upon collision -- with, in case of triple collision, a uniformly…

Probability · Mathematics 2022-01-05 John Haslegrave , Laurent Tournier

A two-dimensional body moves through a rarefied medium; the collisions of the medium particles with the body are absolutely elastic. The body performs both translational and slow rotational motion. It is required to select the body, from a…

Optimization and Control · Mathematics 2007-05-23 Alexander Plakhov , Paulo D. F. Gouveia

We study the behaviour of two Brownian particles coupled by an elastic harmonic force in a quenched disordered medium. We found that to first order in disorder strength, the relative motion weakens (with respect to the reference state of a…

Statistical Mechanics · Physics 2009-11-07 M. Schulz , S. Stepanow , S. Trimper

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

Metric Geometry · Mathematics 2009-01-06 Zhiqiang Xu

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi

Consider a finite system of rank-based competing Brownian particles, where the drift and diffusion of each particle depend only on its current rank relative to other particles. We present a simple sufficient condition for absence of…

Probability · Mathematics 2017-01-13 Tomoyuki Ichiba , Andrey Sarantsev

We consider the system of N (\ge 2) elastically colliding hard balls with masses m_1,..., m_N, radius r, moving uniformly in the flat torus T_L^{\nu}= R^\nu/L \cdot Z^\nu, \nu \ge 2. It is proved here that the relevant Lyapunov exponents of…

Dynamical Systems · Mathematics 2010-08-12 Nandor Simányi , Domokos Szász

For a measure mu supported on a compact connected subset of a Euclidean space which satisfies a uniform d-dimensional decay of the volume of balls we show that the maximal edge in the minimum spanning tree of n indepndent samples from mu…

Probability · Mathematics 2007-05-23 Gady Kozma , Zvi Lotker , Gideon Stupp

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

Combinatorics · Mathematics 2015-02-11 Felix Günther

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…

Metric Geometry · Mathematics 2018-07-05 J. Jerónimo-Castro , E. Makai,

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…

Probability · Mathematics 2007-05-23 Malwina J. Luczak , Colin McDiarmid