English
Related papers

Related papers: Difference sets in $\mathbb{R}^d$

200 papers

We provide counterexamples to the stable equivalence problem in every dimension $d\geq2$. That means that we construct hypersurfaces $H_1, H_2\subset\mathbb{C}^{d+1}$ whose cylinders $H_1\times\mathbb{C}$ and $H_2\times\mathbb{C}$ are…

Algebraic Geometry · Mathematics 2013-08-13 Pierre-Marie Poloni

Let $S\subset\Ps^r$ ($r\geq 5$) be a nondegenerate, irreducible, smooth, complex, projective surface of degree $d$. Let $\delta_S$ be the number of double points of a general projection of $S$ to $\Ps^4$. In the present paper we prove that…

Algebraic Geometry · Mathematics 2010-01-28 Ciro Ciliberto , Vincenzo Di Gennaro

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

We compare the size of the difference set $A-A$ to that of the set $kA$ of $k$-fold sums. We show the existence of sets such that $|kA| < |A-A|^{a_k}$ with $a_k<1$.

Number Theory · Mathematics 2016-01-19 Imre Z. Ruzsa

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

Number Theory · Mathematics 2016-12-30 Javier Cilleruelo , Melvyn B. Nathanson

We study the problem of embedding bipartite graphs in Ahlfors-David regular sets of large dimension using results from extremal graph theory. Our main theorem states that any graph satisfying a power-improving bound on the extremal number…

Classical Analysis and ODEs · Mathematics 2026-04-03 Alex McDonald

We classify all two-dimensional simple algebras (which may be non-associative) over an algebraically closed field. For each two-dimensional algebra $\mathcal{A}$, we describe a minimal (with respect to inclusion) generating set for the…

Rings and Algebras · Mathematics 2025-04-21 María Alejandra Alvarez , Artem Lopatin

Let $A \subseteq F_2^n$ be a set with $|2A| = K|A|$. We prove that if (1) for at least a fraction $1-K^{-9}$ of all $s \in 2A$, the set $(A+s) \cap A$ has size at most $L\cdot|A|/K$, or (2) for at least a fraction $K^{-L}$ of all $s \in…

Discrete Mathematics · Computer Science 2013-11-04 Thomas Holenstein

We show that the number of independent sets in an N-vertex, d-regular graph is at most (2^{d+1} - 1)^{N/2d}, where the bound is sharp for a disjoint union of complete d-regular bipartite graphs. This settles a conjecture of Alon in 1991 and…

Combinatorics · Mathematics 2015-10-26 Yufei Zhao

In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…

Metric Geometry · Mathematics 2025-01-22 Rodolfo Viera

In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined…

Combinatorics · Mathematics 2016-02-02 Anurag Anshu , Saswata Shannigrahi

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

For a Banach space $B$ and for a class $\A$ of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements $A \in \A$ can be chosen to depend continuously on $A$, whenever nonconvexity of each $A…

General Topology · Mathematics 2010-04-14 Dušan Repovš , Pavel V. Semenov

Given $d\in\mathbb{N}$, let $\alpha(d)$ be the largest real number such that every abstract simplicial complex $\mathcal{S}$ with $0<\vert\mathcal{S}\vert\leq\alpha(d)\vert V(\mathcal{S})\vert$ has a vertex of degree at most $d$. We extend…

Combinatorics · Mathematics 2025-01-03 Christian Reiher , Bjarne Schülke

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

Number Theory · Mathematics 2016-10-04 Ilya D. Shkredov

Consider the sequence $\mathcal{V}(2,n)$ constructed in a greedy fashion by setting $a_1 = 2$, $a_2 = n$ and defining $a_{m+1}$ as the smallest integer larger than $a_m$ that can be written as the sum of two (not necessarily distinct)…

Number Theory · Mathematics 2018-04-26 Borys Kuca

An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…

Functional Analysis · Mathematics 2018-03-01 Jacek Marchwicki , Vaclav Vlasak

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…

Classical Analysis and ODEs · Mathematics 2019-11-05 Nir Lev , Bochen Liu

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Combinatorics · Mathematics 2024-04-30 Alfredo Hubard , Pablo Soberón

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

Classical Analysis and ODEs · Mathematics 2024-05-07 P. Bhowmik , A. Greenleaf , A. Iosevich , S. Mkrtchyan , F. Rakhmonov