English
Related papers

Related papers: On higher dimensional point sets in general positi…

200 papers

Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$…

Combinatorics · Mathematics 2019-01-14 Rebecca F. Durst , Max Hlavacek , Chi Huynh , Steven J. Miller , Eyvindur A. Palsson

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Complex Variables · Mathematics 2008-01-16 John P. D'Angelo , Jiri Lebl , Han Peters

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

Computational Geometry · Computer Science 2014-06-16 Marco Di Summa , Friedrich Eisenbrand , Yuri Faenza , Carsten Moldenhauer

We prove that a d-web near a point in n-space, where n is greater than 2 and d is greater than 2n-1, is equivalent to an algebraic web, if it has maximal rank or, more generally, if it has (2d - 3n + 1) abelian relations the 1-jets of which…

Differential Geometry · Mathematics 2007-05-23 Jean-Marie Trépreau

We study the set of $D$ such that a given irreducible hypersurface $C$ of degree $d$ has infinitely many points of degree $D$ over $\mathbb{Q}$. We give a new explicit proof that this set contains all (positive) multiples of the index of…

Number Theory · Mathematics 2025-10-21 Lea Beneish , Andrew Granville

For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…

Combinatorics · Mathematics 2025-09-09 Anubhab Ghosal , Ritesh Goenka , Peter Keevash

We study maximal operators associated to singular averages along finite subsets $\Sigma$ of the Grassmannian $\mathrm{Gr}(d,n)$ of $d$-dimensional subspaces of $\mathbb R^n$. The well studied $d=1$ case corresponds to the the directional…

Classical Analysis and ODEs · Mathematics 2024-09-23 Francesco Di Plinio , Ioannis Parissis

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

Computational Geometry · Computer Science 2013-08-28 Jean Cardinal , Michael Hoffmann , Vincent Kusters

For n > d/2, the Sobolev (Bessel potential) space H^n(R^d, C) is known to be a Banach algebra with its standard norm || ||_n and the pointwise product; so, there is a best constant K_{n d} such that || f g ||_{n} <= K_{n d} || f ||_{n} || g…

Functional Analysis · Mathematics 2007-05-23 Carlo Morosi , Livio Pizzocchero

A set S of 2n+1 points in the plane is said to be in general position if no three points of S are collinear and no four are concyclic. A circle is called halving with respect to S if it has three points of S on its circumference, n-1 points…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

A $d^{\{n\}}$-cage $\mathsf K$ is the union of $n$ groups of hyperplanes in $\Bbb P^n$, each group containing $d$ members. The hyperplanes from the distinct groups are in general position, thus producing $d^n$ points, where hyperplanes from…

Algebraic Geometry · Mathematics 2021-07-14 Gabriel Katz

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…

Computational Geometry · Computer Science 2019-09-27 Sándor Kisfaludi-Bak , Dániel Marx , Tom C. van der Zanden

In this paper, we study the embedding of a complete balanced $d$-partite $d$-uniform hypergraph with all its $nd$ vertices represented as points in general position in $\mathbb{R}^d$ and each hyperedge drawn as a convex hull of $d$…

Combinatorics · Mathematics 2020-12-17 Rahul Gangopadhyay , Saswata Shannigrahi

We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…

Combinatorics · Mathematics 2025-09-08 Herbert Edelsbrunner , Alexey Garber , Morteza Saghafian

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

For any integer $d \geq 2$ and prime power $q$, we construct unexpectedly large induced matchings in the point-line incidence graph of $\mathbb{F}_{q}^{d}$ by leveraging a new connection with the Furstenberg-S\'ark\"ozy problem from…

Combinatorics · Mathematics 2026-01-28 Zach Hunter , Cosmin Pohoata , Jacques Verstraete , Shengtong Zhang

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…

Metric Geometry · Mathematics 2023-12-18 Kean Fallon , Joseph W. Iverson

In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…

Computational Geometry · Computer Science 2019-10-21 Luis Barba , Frank Duque , Ruy Fabila-Monroy , Carlos Hidalgo-Toscano
‹ Prev 1 8 9 10 Next ›