English
Related papers

Related papers: Hamming Distances in Vector Spaces over Finite Fie…

200 papers

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

Combinatorics · Mathematics 2013-04-22 Doowon Koh , Hae-Sang Sun

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…

Combinatorics · Mathematics 2025-05-15 Jonathan M. Fraser

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…

Combinatorics · Mathematics 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…

Combinatorics · Mathematics 2019-05-13 Alex Iosevich , Doowon Koh , Thang Pham

We study an extension of the Falconer distance problem in the multiparameter setting. Given $\ell\geq 1$ and $\mathbb{R}^{d}=\mathbb{R}^{d_1}\times\cdots \times\mathbb{R}^{d_\ell}$, $d_i\geq 2$. For any compact set $E\subset \mathbb{R}^{d}$…

Classical Analysis and ODEs · Mathematics 2022-02-25 Xiumin Du , Yumeng Ou , Ruixiang Zhang

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

For a prime power $q$, we study the distribution of determinent of matrices with restricted entries over a finite field $\mathbbm{F}_q$ of $q$ elements. More precisely, let $N_d (\mathcal{A}; t)$ be the number of $d \times d$ matrices with…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

We prove an upper bound on long-range distillable entanglement in $D$ spatial dimensions. Namely, it must decay faster than $1/r$, where $r$ is the distance between entangled regions. For states that are asymptotically rotationally…

Quantum Physics · Physics 2025-08-12 Jonah Kudler-Flam , Vladimir Narovlansky , Nikita Sopenko

We describe a setup for obtaining uncertainty relations for arbitrary pairs of observables related by Fourier transform. The physical examples discussed here are standard position and momentum, number and angle, finite qudit systems, and…

Quantum Physics · Physics 2016-01-18 Reinhard F. Werner

We prove that the finite field Fourier extension operator for the paraboloid is bounded from $L^2\to L^r$ for $r\geq \frac{2d+4}{d}$ in even dimensions $d\ge 8$, which is the optimal $L^2$ estimate. For $d=6$ we obtain the optimal range $r>…

Classical Analysis and ODEs · Mathematics 2017-12-18 Alex Iosevich , Doowon Koh , Mark Lewko

Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…

Number Theory · Mathematics 2023-10-05 Angel Kumchev , Nathan McNew , Ariana Park

Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d,…

Databases · Computer Science 2009-09-01 Chris Giannella

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

Information Theory · Computer Science 2026-04-10 Xianhong Xie , Yi Ouyang , Shenxing Zhang

The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…

Computational Geometry · Computer Science 2021-05-06 Brendan Mumey

Let $\mathbb{F}_q$ be a finite field of odd characteristic containing $q$ elements and integer $n\ge 1$. In this paper, the explicit factorization of $x^{2^nd}-1$ over $\mathbb{F}_q$ is obtained when $d$ is an odd divisor of $q+1$.

Combinatorics · Mathematics 2018-07-03 Manjit Singh

In this paper, we describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5…

Information Theory · Computer Science 2012-02-03 Alexander M. Romanov

Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…

Number Theory · Mathematics 2018-11-29 Takashi Taniguchi , Frank Thorne

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

Metric Geometry · Mathematics 2014-06-26 Mark Herman , Jonathan Pakianathan

In this paper, we study flag codes on the vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum…

Information Theory · Computer Science 2020-11-05 Clementa Alonso-González , Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà