English
Related papers

Related papers: Fourier bases and a distance problem of Erd\H os

200 papers

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

Metric Geometry · Mathematics 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

We show the counter-intuitive fact that some weighted isoperimetric problems on the half-space $ \mathbb{R}^N _+ $, for which half-balls centered at the origin are stable, have no solutions. A particular case is the measure $d\mu = x_N…

Analysis of PDEs · Mathematics 2019-08-22 Friedemann Brock , Francesco Chiacchio

Erd\H{o}s asked many mathematical questions. Some lead to exciting research, others turned out to be easily solved. In this article, we provide evidence that one of his questions, Erd\H{o}s problem \#278 , has no general answer. We do so by…

Combinatorics · Mathematics 2025-08-26 Stijn Cambie

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

Combinatorics · Mathematics 2026-05-08 Ritesh Goenka , Kenneth Moore

A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous…

Combinatorics · Mathematics 2024-05-07 Jia Huang

In this paper we prove the following result, useful and often needed in the study of the ergodic properties of hard ball systems: In any such system, for any phase point x with a non-singular forward trajectory and infinitely many connected…

Dynamical Systems · Mathematics 2007-05-23 Nandor Simanyi

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

Combinatorics · Mathematics 2022-10-11 Jineon Baek

We prove that there does not exist a non-square quadratic polynomial with integer coefficients and an axis of symmetry which takes square values for N consecutive integers for N=7 or N >= 9. At the opposite, if N <= 6 or N=8 there are…

Number Theory · Mathematics 2014-11-12 Enrique Gonzalez-Jimenez , Xavier Xarles

We prove the Murphy and Cohen's conjecture that the maximum number of collisions of n + 1 elastic particles moving freely on a line is n(n+1)/2 if no interior particle has mass less than the arithmetic mean of the masses of its immediate…

General Mathematics · Mathematics 2007-05-23 Lizhou Chen

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…

Combinatorics · Mathematics 2016-07-14 Orit E. Raz , Oliver Roche-Newton , Micha Sharir

A well-known theorem of Erd\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2}(k-1)n$ edges. Recently Gy\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining…

Combinatorics · Mathematics 2017-11-21 Akbar Davoodi , Ervin Győri , Abhishek Methuku , Casey Tompkins

One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…

Combinatorics · Mathematics 2018-07-16 Rebecca Hoberg , Thomas Rothvoss

We prove the large-dimensional Gaussian approximation of a sum of $n$ independent random vectors in $\mathbb{R}^d$ together with fourth-moment error bounds on convex sets and Euclidean balls. We show that compared with classical…

Probability · Mathematics 2021-03-03 Xiao Fang , Yuta Koike

Let $N$ balls of the same radius be given in a $d$-dimensional real normed vector space, i.e., in a Minkowski $d$-space. Then apply a uniform contraction to the centers of the $N$ balls without changing the common radius. Here a uniform…

Metric Geometry · Mathematics 2020-05-12 Károly Bezdek

Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…

Metric Geometry · Mathematics 2012-06-22 Adrian Dumitrescu

We obtain rge Erd\" os-R\' enyi type law of large numbers for "nonconventional" sums of the form $S_n=\sum^n_{m=1}F(X_m,X_{2m},...,X_{\ell m})$ where $X_1,X_2,...$ is a sequence of i.i.d. random variables and $F$ is a bounded Borel…

Probability · Mathematics 2016-04-05 Yuri Kifer

A simplified direct method is described for obtaining massless scalar functional determinants on the Euclidean ball. The case of odd dimensions is explicitly discussed.

High Energy Physics - Theory · Physics 2007-05-23 J. S. Dowker

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…

Classical Analysis and ODEs · Mathematics 2026-05-14 Mark Lewko

For $ E\subset \mathbb{F}_q^d$, let $\Delta(E)$ denote the distance set determined by pairs of points in $E$. By using additive energies of sets on a paraboloid, Koh, Pham, Shen, and Vinh (2020) proved that if $E,F\subset \mathbb{F}_q^d $…

Number Theory · Mathematics 2020-08-20 Daewoong Cheong , Doowon Koh , Thang Pham

We consider the following two closed sets in $C^n$. One is the diagonal D given by $ (z, z, z,...z_)$. The other is $A = \{(z_1,z_2,z_3,...z_n):.$ $.e^{z_1} + e^{z_2} +e^{z_3} +...+ e^{z_n}=0\}$. Clearly $D \cap A$ is empty. One can ask…

Number Theory · Mathematics 2011-06-17 R. Balasubramanian