English
Related papers

Related papers: Acute sets of exponentially optimal size

200 papers

The structure of $k$-diametral point configurations in Minkowski $d$-space is shown to be closely related to the properties of $k$-antipodal point configurations in $\mathbb{R}^d$. In particular, the maximum size of $k$-diametral point…

Metric Geometry · Mathematics 2022-01-28 Károly Bezdek , Zsolt Lángi

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Combinatorics · Mathematics 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner

We say that a subset of $\mathbb{P}^n(\mathbb{R})$ is maximally singular if its contains points with $\mathbb{Q}$-linearly independent homogenous coordinates whose uniform exponent of simultaneous rational approximation is equal to $1$, the…

Number Theory · Mathematics 2020-09-28 Anthony Poëls

We construct a set of $2^n$ points in $\mathbb{R}^n$ such that all pairwise Manhattan distances are odd integers, which improves the recent linear lower bound of Golovanov, Kupavskii and Sagdeev. In contrast to the Euclidean and maximum…

Combinatorics · Mathematics 2024-10-25 Alberto Espuny Díaz , Emma Hogan , Freddie Illingworth , Lukas Michel , Julien Portier , Jun Yan

Let $P$ be a finite set of points in $\mathbb{R}^d$ or $\mathbb{C}^d$. We answer a question of Purdy on the conditions under which the number of hyperplanes spanned by $P$ is at least the number of $(d-2)$-flats spanned by $P$. In answering…

Combinatorics · Mathematics 2016-10-13 Ben Lund

We enumerate and classify all stationary logarithmic configurations of d+2 points on the unit (d-1)-sphere in d-dimensions. In particular, we show that the logarithmic energy attains its relative minima at configurations that consist of two…

Metric Geometry · Mathematics 2022-03-15 Peter D. Dragnev , Oleg R. Musin

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

Combinatorics · Mathematics 2020-10-19 Nora Frankl , Andrey Kupavskii

Let $d$ be a positive integer. Let $p$ be a prime number. Let $\alpha$ be a real algebraic number of degree $d+1$. We establish that there exist a positive constant $c$ and infinitely many algebraic numbers $\xi$ of degree $d$ such that…

Number Theory · Mathematics 2015-05-13 Yann Bugeaud , Bernard De Mathan

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

Combinatorics · Mathematics 2026-02-24 Ryutaro Misawa

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…

Combinatorics · Mathematics 2010-05-11 Jacob Fox , Mikhail Gromov , Vincent Lafforgue , Assaf Naor , Janos Pach

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

Combinatorics · Mathematics 2022-04-12 Maximus Redman , Lauren Rose , Raphael Walker

It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension…

Dynamical Systems · Mathematics 2026-04-21 Meysam Nassiri , Mojtaba Zareh Bidaki

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

Number Theory · Mathematics 2017-09-05 Michael A. Bennett , Samir Siksek

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…

Number Theory · Mathematics 2013-06-14 Ákos Magyar , Tatchai Titichetrakun

We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of…

Classical Analysis and ODEs · Mathematics 2016-08-18 Allan Greenleaf , Alex Iosevich , Bochen Liu , Eyvindur Palsson

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

Combinatorics · Mathematics 2021-06-03 E. Makai , H. Martini , M. H. Nguyên , V. Soltan , I. Talata

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

Number Theory · Mathematics 2020-12-08 Bernard Montaron

We revisit the online Unit Covering problem in higher dimensions: Given a set of $n$ points in $\mathbb{R}^d$, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we…

Computational Geometry · Computer Science 2018-08-29 Adrian Dumitrescu , Anirban Ghosh , Csaba D. Tóth
‹ Prev 1 3 4 5 6 7 10 Next ›