arXiv math/07038562007-03math.COmath.CA

Measurable sets with excluded distances

Boris Bukh

备注：: 23 pages, 3 figures, typos and small errors fixed

英文摘要：

For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k are all small enough. This resolves a question of Szekely, and generalizes a theorem of Furstenberg-Katznelson-Weiss, Falconer-Marstrand, and Bourgain. Several more results on D-avoiding sets are presented.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Independent Sets in Graphs with an Excluded Clique Minor

Let $G$ be a graph with $n$ vertices, with independence number $α$, and with with no $K_{t+1}$-minor for some $t\geq5$. It is proved that $(2α-1)(2t-5)\geq2n-5$.

2006-01-09math.CO

Simplices and sets of positive upper density in $\mathbb{R}^d$

We prove an extension of Bourgain's theorem on pinned distances in measurable subset of $\mathbb{R}^2$ of positive upper density, namely Theorem $1^\prime$ in [Bourgain, 1986], to pinned non-degenerate $k$-dimensional simplices in measurable subset of $\mathbb{R}^{d}$ of positive upper density whenever $d\geq k+2$ and $k$ is any positive integer.

2017-01-07math.CAmath.CO

Measurable patterns, necklaces, and sets indiscernible by measure

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 such that any two distinct, non-degenerate cubes (parallelepipeds) are measure discernible. For example, motivated by a conjecture of Lason, we show that for every collection μ_1,...,μ_{2d-1} of 2d-1 continuous finite measures on R^d, there exist two nontrivial axis-aligned d-dimensional cuboids (rectangular parallelepipeds) C_1 and C_2 such that μ_i(C_1)=μ…

2013-05-31math.CO

关于将某些类型的 Marczewski-Burstin 可测函数归约为完美集乘积上连续函数的方法

On the methods of reduction of some types of Marczewski-Burstin measurable functions to continuous functions on products of perfect sets

本文推广 Marczewski-Burstin 基并证明相应可测函数可在完美集乘积上归约为连续函数，还给出函数序列的连续性归约方法以推广 Laver 对相关定理的扩张。

2025-09-29math.COmath.LO

Fourier analysis, linear programming, and densities of distance avoiding sets in R^n

In this paper we derive new upper bounds for the densities of measurable sets in R^n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions 2,..., 24. This gives new lower bounds for the measurable chromatic number in dimensions 3,..., 24. We apply it to get a new, short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg, Katznelson, Weiss and Bourgain and Falconer about set…

2008-12-02math.CAmath.COmath.MG

Distance Graphs and sets of positive upper density in $\mathbb{R}^d$

We present a sharp extension of a result of Bourgain on finding configurations of $k+1$ points in general position in measurable subset of $\mathbb{R}^d$ of positive upper density whenever $d\geq k+1$ to all proper $k$-degenerate distance graphs.

2018-03-23math.CAmath.COmath.NT

更多相关论文收起更多论文

最小化小差异的集合与划分

Sets and partitions minimising small differences

该研究针对实数区间的可测集与划分问题，定义了刻画集合内小差异点对测度的$\Phi(A)$，证明了区间划分下$\Phi(A_i)$和的下界及最优乘性常数，并推广得到任意测度可测子集的$\Phi(A)$下界，丰富了测度组合相关理论结果。

2024-10-31math.CAmath.CO

修剪与构建冻结集

Trimming and Building Freezing Sets

本文提出数字拓扑中构造冻结集的新工具，定义可排除点并证明关节点可排除，同时刻画了度为1的点及部分局部极值点等必须属于冻结集的点。

2024-06-09math.COmath.GT

A note on configurations in sets of positive density which occur at all large scales

Furstenberg, Katznelson and Weiss proved in the early 1980s that every measurable subset of the plane with positive density at infinity has the property that all sufficiently large real numbers are realised as the Euclidean distance between points in that set. Their proof used ergodic theory to study translations on a space of Lipschitz functions corresponding to closed subsets of the plane, combined with a measure-theoretical argument. We consider an alternative dynamical approach in which the phase space is given by the set of measurable functions from $\mathbb{R}^d$ to $[0,1]$, which we vie…

2013-01-17math.COmath.DS

Finite Products Sets and Minimally Almost Periodic Groups

We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is possible when the group does not have cocompact von Neumann kernel. For the stronger property of being piecewise-syndetic we show that this is always possible. For minimally almost periodic, locally compact, second countable, amenable groups, we prove that any dilation of a positive density set by an open neighborhood of the identity contains a set of measurable r…

2014-02-19math.COmath.DSmath.GR

A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of Larman and Rogers from 1972.

2019-03-11math.COmath.MG

On the density of sets avoiding parallelohedron distance 1

The maximal density of a measurable subset of R^n avoiding Euclidean distance1 is unknown except in the trivial case of dimension 1. In this paper, we consider thecase of a distance associated to a polytope that tiles space, where it is likely that the setsavoiding distance 1 are of maximal density 2^-n, as conjectured by Bachoc and Robins. We prove that this is true for n = 2, and for the Voronoï regions of the lattices An, n >= 2.

2017-08-01math.COmath.MG

The density of sets avoiding distance 1 in Euclidean space

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of a combinatorial argument involving finite subgraphs of the unit distance graph. In turn, we straightforwardly obtain an asymptotic improvement for the measurable chromatic number of Euclidean space. We also tighten previous results for the dimensions between 4 and 24.

2015-01-29math.COmath.MG

A recursive Lovász theta number for simplex-avoiding sets

We recursively extend the Lovász theta number to geometric hypergraphs on the unit sphere and on Euclidean space, obtaining an upper bound for the independence ratio of these hypergraphs. As an application we reprove a result in Euclidean Ramsey theory in the measurable setting, namely that every $k$-simplex is exponentially Ramsey, and we improve existing bounds for the base of the exponential.

2022-05-24math.COmath.MG

良回归集是分划正则的

Sets of nice recurrence are partition regular

University of Warwick（华威大学）

该研究证明良回归集具有分划正则性，即其任意有限着色均包含单色良回归集，解决了Bergelson的长期问题。

2026-08-21math.COmath.DS