中文
相关论文

相关论文: Extensions to the Method of Multiplicities, with a…

200 篇论文

We study the problem of extracting randomness from somewhere-random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A somewhere-random source is a tuple $(X_1, \ldots, X_t)$ of (possibly…

组合数学 · 数学 2023-06-30 Swastik Kopparty , Vishvajeet N

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

组合数学 · 数学 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

组合数学 · 数学 2015-03-20 Zeev Dvir

A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the…

组合数学 · 数学 2015-05-13 Zeev Dvir

For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.

组合数学 · 数学 2013-02-25 Gohar Kyureghyan , Peter Müller , Qi Wang

We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…

组合数学 · 数学 2025-05-15 Jonathan M. Fraser

A Kakeya set $S \subset (\mathbb{Z}/N\mathbb{Z})^n$ is a set containing a line in each direction. We show that, when $N$ is any square-free integer, the size of the smallest Kakeya set in $(\mathbb{Z}/N\mathbb{Z})^n$ is at least…

组合数学 · 数学 2021-12-28 Manik Dhar , Zeev Dvir

A Kakeya set in $\mathbb{F}_q^n$ is a set containing a line in every direction. We show that every Kakeya set in $\mathbb{F}_q^n$ has density at least $1/2^{n-1}$, matching the construction by Dvir, Kopparty, Saraf and Sudan.

组合数学 · 数学 2021-12-14 Boris Bukh , Ting-Wei Chao

In this dissertation we define a generalization of Kakeya sets in certain metric spaces. Kakeya sets in Euclidean spaces are sets of zero Lebesgue measure containing a segment of length one in every direction. A famous conjecture, known as…

经典分析与常微分方程 · 数学 2017-03-13 Laura Venieri

Let $q,n \geq 1$ be integers, $[q]=\{1,\ldots, q\}$, and $\mathbb F$ be a field with $|\mathbb F|\geq q$. The set of increasing sequences $$ I(n,q)=\{(f_1,f_2, \dots, f_n) \in [q]^n:~ f_1\leq f_2\leq\cdots \leq f_n \} $$ can be mapped via…

组合数学 · 数学 2022-08-02 Gábor Hegedüs , Lajos Rónyai

The dimension of Kakeya sets can be bounded using sum-difference exponents $\SD(R;s)$ for various sets of rational slopes $R$ and output slope $s$; the arithmetic Kakeya conjecture, which implies the Kakeya conjecture in all dimensions,…

组合数学 · 数学 2025-11-20 Terence Tao

We adapt Guth's polynomial partitioning argument for the Fourier restriction problem to the context of the Kakeya problem. By writing out the induction argument as a recursive algorithm, additional multiscale geometric information is made…

经典分析与常微分方程 · 数学 2019-08-16 Jonathan Hickman , Keith M. Rogers , Ruixiang Zhang

Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…

数据结构与算法 · 计算机科学 2025-05-14 Elisabet Burjons , Peter Rossmanith

A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…

组合数学 · 数学 2020-03-20 Maarten De Boeck , Geertrui Van de Voorde

This thesis investigates two problems that are discrete analogues of two harmonic analytic problems which lie in the heart of research in the field. More specifically, we consider discrete analogues of the maximal Kakeya operator conjecture…

经典分析与常微分方程 · 数学 2014-01-25 Marina Iliopoulou

The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…

经典分析与常微分方程 · 数学 2010-03-23 Gerd Mockenhaupt , Terence Tao

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

组合数学 · 数学 2020-04-03 Mehdi Makhul , Audie Warren , Arne Winterhof

The Fourier restriction phenomenon and the size of Kakeya sets are explored in the setting of the ring of integers modulo $N$ for general $N$ and a striking similarity with the corresponding euclidean problems is observed. One should…

经典分析与常微分方程 · 数学 2018-05-30 Jonathan Hickman , James Wright

We prove that every Kakeya set in $\mathbb{R}^3$ formed from lines of the form $(a,b,0) + \operatorname{span}(c,d,1)$ with $ad-bc=1$ must have Hausdorff dimension $3$; Kakeya sets of this type are called $SL_2$ Kakeya sets. This result was…

经典分析与常微分方程 · 数学 2023-08-17 Nets Hawk Katz , Shukun Wu , Joshua Zahl

A Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and…

组合数学 · 数学 2019-06-05 Audie Warren , Arne Winterhof
‹ 上一页 1 2 3 10 下一页 ›