相关论文: Distribution of distances in five dimensions and r…

In this article, the minimum distance of the dual $C^{\bot}$ of a functional code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is studied. The approach consists in finding minimal configurations of points on $X$…

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…

We prove $L^p$-Hardy inequalities with distance to the boundary for domains in the Heisenberg group ${\mathbb{H}}^n$, $n\geq 1$. Our results are based on a certain geometric condition. This is first implemented for the Euclidean distance in…

We prove that if $\alpha\in (0,1/2]$, then the packing dimension of a set $E\subset\mathbb{R}^2$ for which there exists a set of lines of dimension $1$ intersecting $E$ in dimension $\ge \alpha$ is at least $1/2+\alpha+c(\alpha)$ for some…

We improve the Peres-Schlag result on pinned distances in sets of a given Hausdorff dimension. In particular, for Euclidean distances, with $$\Delta^y(E) = \{|x-y|:x\in E\},$$ we prove that for any $E, F\subset{\Bbb R}^d$, there exists a…

This paper contains new results on two classical topics in fractal geometry: projections, and intersections with affine planes. To keep the notation of the abstract simple, we restrict the discussion to the planar cases of our theorems. Our…

Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd characteristic in which $-1$ is not a square. We show that the Fourier extension operator associated with $P$ maps $L^2$ to $L^{r}$ for $r > \frac{32}{9} \approx…

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower…

We study solution techniques for parabolic equations with fractional diffusion and Caputo fractional time derivative, the latter being discretized and analyzed in a general Hilbert space setting. The spatial fractional diffusion is realized…

Let $M$ be a simple 3-manifold such that one component of $\partial M$, say $F$, has genus at least two. For a slope $\alpha$ on $F$, we denote by $M(\alpha)$ the manifold obtained by attaching a 2-handle to $M$ along a regular neighborhood…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

For $ E\subset \mathbb{F}_q^d$, let $\Delta(E)$ denote the distance set determined by pairs of points in $E$. By using additive energies of sets on a paraboloid, Koh, Pham, Shen, and Vinh (2020) proved that if $E,F\subset \mathbb{F}_q^d $…

The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test…

The distance distribution of a code is the vector whose $i^\text{th}$ entry is the number of pairs of codewords with distance $i$. We investigate the structure of the distance distribution for cyclic orbit codes, which are subspace codes…

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…

Let $\Lambda_s$ denote the inhomogeneous Lipschitz space of order $s\in(0,\infty)$ on $\mathbb{R}^n$. This article characterizes the distance $d(f, V)_{\Lambda_s}: = \inf_{g\in V} \|f-g\|_{\Lambda_s}$ from a function $f\in \Lambda_s$ to a…