中文
相关论文

相关论文: Measurable sets with excluded distances

200 篇论文

For integers $k\geq 3,d\geq 2,$ we consider the abundance property of pinned $k$-point patterns occurring in $E\subseteq \mathbb R^d$ with positive upper density $\delta(E)$. We show that for any fixed $k$-point pattern $V$, there is a set…

组合数学 · 数学 2025-10-28 Chenjian Wang

Linear combinations of exponentials $e^{i\lambda_kt}$ in the case where the distance between some points $\lambda_k$ tends to zero are studied. D. Ullrich has proved the basis property of the divided differences of exponentials in the case…

泛函分析 · 数学 2007-05-23 S. A. Avdonin , S. A. Ivanov

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

组合数学 · 数学 2013-06-03 Sinisa Vrecica , Rade Zivaljevic

A novel framework for density estimation under expectation constraints is proposed. The framework minimizes the Wasserstein distance between the estimated density and a prior, subject to the constraints that the expected value of a set of…

机器学习 · 统计学 2026-02-24 Yinan Hu , Esteban G. Tabak

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

数论 · 数学 2022-10-10 Abhishek Jha , Carlo Sanna

Let $G_n$ be a random geometric graph with vertex set $[n]$ based on $n$ i.i.d.\ random vectors $X_1,\ldots,X_n$ drawn from an unknown density $f$ on $\R^d$. An edge $(i,j)$ is present when $\|X_i -X_j\| \le r_n$, for a given threshold…

机器学习 · 统计学 2023-11-23 Caelan Atamanchuk , Luc Devroye , Gabor Lugosi

An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…

动力系统 · 数学 2025-06-11 Michael Björklund , Alexander Fish

We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element…

组合数学 · 数学 2026-03-10 Dániel Gerbner

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…

组合数学 · 数学 2026-05-08 Ritesh Goenka , Kenneth Moore

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

组合数学 · 数学 2016-12-16 Ariel Bruner , Micha Sharir

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

组合数学 · 数学 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…

经典分析与常微分方程 · 数学 2023-06-14 Anshul Adve

We construct subsets of Euclidean space of large Hausdorff dimension and full Minkowski dimension that do not contain nontrivial patterns described by the zero sets of functions. The results are of two types. Given a countable collection of…

经典分析与常微分方程 · 数学 2018-04-18 Robert Fraser , Malabika Pramanik

We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…

物理与社会 · 物理学 2010-02-01 Daniel Jezbera , David Kordek , Jan Kriz , Petr Seba , Petr Sroll

I prove that if $\emptyset \neq K \subset \mathbb{R}^{2}$ is a compact $s$-Ahlfors-David regular set with $s \geq 1$, then $$\dim_{\mathrm{p}} D(K) = 1,$$ where $D(K) := \{|x - y| : x,y \in K\}$ is the distance set of $K$, and…

经典分析与常微分方程 · 数学 2016-12-14 Tuomas Orponen

Falconer proved that there are sets $E\subset \mathbb{R}^n$ of Hausdorff dimension $n/2$ whose distance sets $\{|x-y| : x,y\in E\}$ are null with respect to Lebesgue measure. This led to the conjecture that distance sets have positive…

经典分析与常微分方程 · 数学 2018-02-06 Keith Rogers

Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of…

组合数学 · 数学 2026-04-22 Swee Hong Chan , Steven Heilman , Greta Panova

A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.

组合数学 · 数学 2019-03-27 Andrey Kupavskii , Nabil H. Mustafa , Konrad J. Swanepoel

A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…

一般拓扑 · 数学 2021-01-11 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

Suppose that a $d$-dimensional domain is filled with a gas of (in general, interacting) diffusive particles with density $n_0$. A particle is absorbed whenever it reaches the domain boundary. Employing macroscopic fluctuation theory, we…

统计力学 · 物理学 2016-01-27 Tal Agranov , Baruch Meerson , Arkady Vilenkin