English
Related papers

Related papers: The Additive Structure of Cartesian Products Spann…

200 papers

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Algebraic Geometry · Mathematics 2024-10-24 Antoine Etesse

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log…

Combinatorics · Mathematics 2025-08-20 Simone Costa , Stefano Della Fiore , Eva R. Engel

We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$…

Combinatorics · Mathematics 2022-05-05 Brendan Murphy , Giorgis Petridis , Thang Pham , Misha Rudnev , Sophie Stevens

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the…

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

Metric Geometry · Mathematics 2008-02-03 János Pach , Joel Spencer

The Gaussian-smoothed optimal transport (GOT) framework, recently proposed by Goldfeld et al., scales to high dimensions in estimation and provides an alternative to entropy regularization. This paper provides convergence guarantees for…

Machine Learning · Computer Science 2021-03-02 Yixing Zhang , Xiuyuan Cheng , Galen Reeves

In this note it is established that, for any finite set $A$ of real numbers, there exist two elements $a,b \in A$ such that $$|(a+A)(b+A)| \gg \frac{|A|^2}{\log |A|}.$$ In particular, it follows that $|(A+A)(A+A)| \gg \frac{|A|^2}{\log…

Combinatorics · Mathematics 2015-02-20 Oliver Roche-Newton

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

Commutative Algebra · Mathematics 2024-04-16 John Pawlina , Stefan Tohaneanu

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

Metric Geometry · Mathematics 2018-05-01 M. M. Skriganov

We generalize Pach and de Zeeuw's bound for distinct distances between points on two curves, from algebraic curves to Pfaffian curves. Pfaffian curves include those that can be defined by any combination of elementary functions, including…

Metric Geometry · Mathematics 2025-10-07 Abhiram Natarajan , Adam Sheffer

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

Combinatorics · Mathematics 2008-09-09 Paz Carmi , Vida Dujmović , Pat Morin , David R. Wood

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

Classical Analysis and ODEs · Mathematics 2014-08-12 Tuomas Orponen

The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…

Computational Geometry · Computer Science 2026-02-16 Jayson Lynch , Jack Spalding-Jamieson

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

Let $f$ and $g$ be two elliptic elements in $\mathbf{PU}(2,1)$ of order $m$ and $n$ respectively, where $m\geq n>2$. We prove that if the distance $\delta(f,g)$ between the complex lines or points fixed by $f$ and $g$ is large than a…

Complex Variables · Mathematics 2010-03-16 Baohua Xie , Yueping Jiang

A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…

Combinatorics · Mathematics 2025-01-09 Benjamin Bedert , Noah Kravitz

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

Classical Analysis and ODEs · Mathematics 2019-12-17 Tamás Keleti , Pablo Shmerkin

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

Combinatorics · Mathematics 2025-06-10 Hunseok Kang , Doowon Koh , Firdavs Rakhmonov

Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\in V$, denoted by $d(u, v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\in V$ and a subset $P\subset V$ is defined as $min\{d(v,…

Combinatorics · Mathematics 2013-12-02 Ismael G. Yero , Juan A. Rodriquez-Velazquez
‹ Prev 1 4 5 6 7 8 10 Next ›