English
Related papers

Related papers: Note on the pinned distance problem over finite fi…

200 papers

Given a finite set $E$, a subset $D\sub E$ (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as $D$ is orthogonal to every $\sub$-minimal element of $\FF$.…

Combinatorics · Mathematics 2013-08-14 Reinhard Diestel , Julian Pott

In this paper, we generalize \cite{IosevichParshall}, \cite{LongPaths} and \cite{cycles} by allowing the \emph{distance} between two points in a finite field vector space to be defined by a general non-degenerate bilinear form or quadratic…

Combinatorics · Mathematics 2023-08-22 Paige Bright , Xinyu Fang , Barrett Heritage , Alex Iosevich , Tingsong Jiang , Hans Parshall , Maxwell Sun

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

Combinatorics · Mathematics 2019-08-21 Bryce McLaughlin , Mohamed Omar

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

Combinatorics · Mathematics 2025-05-13 Sean Dewar , Nora Frankl , Samuel Mansfield , Anthony Nixon , Jonathan Passant , Audie Warren

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…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

Number Theory · Mathematics 2016-02-23 Mikhail Gabdullin

We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…

Number Theory · Mathematics 2008-06-09 Robert M. Guralnick , Thomas J. Tucker , Michael E. Zieve

We prove that if $E \subseteq \mathbb{R}^d$ ($d\geq 2$) is a Lebesgue-measurable set with density larger than $\frac{n-2}{n-1}$, then $E$ contains similar copies of every $n$-point set $P$ at all sufficiently large scales. Moreover,…

Classical Analysis and ODEs · Mathematics 2023-01-03 Kenneth Falconer , Vjekoslav Kovač , Alexia Yavicoli

We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…

Algebraic Geometry · Mathematics 2022-07-22 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

Metric Geometry · Mathematics 2019-04-18 Alexandr Polyanskii

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

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…

Computational Geometry · Computer Science 2014-04-21 Paul Accisano , Alper Üngör

We study the exceptional set estimate for projections in $\mathbb{F}_q^n$. For each $V\in G(k,\mathbb{F}^n_q)$, let $$ \pi_V: \mathbb{F}_q^n\rightarrow V $$ be the projection map. We prove the following result: If $A\subset \mathbb{F}_q^n$…

Classical Analysis and ODEs · Mathematics 2023-06-29 Paige Bright , Shengwen Gan

We prove that if $\Omega\subseteq\mathbb{R}^N$ is a set with finite perimeter with $\mathscr{H}^{N-1}(\partial \Omega\setminus\partial^* \Omega)=0$, then any set of finite perimeter $E\subseteq\mathbb{R}^N$ can be approximated by a…

Functional Analysis · Mathematics 2026-03-20 Alessandro Carbotti , Simone Cito , Domenico Angelo La Manna , Aldo Pratelli , Giorgio Stefani

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

Combinatorics · Mathematics 2022-05-05 Ali Mohammadi , Giorgis Petridis

TO APPEAR IN AEQUATIONES MATHEMATICAE - WITHOUT THEOREM 2. THEOREM 2 IS CORRECTLY PROVED IN PREVIOUS VERSIONS 1 AND 2. AUTHOR'S VERSION 3 (WITH A NEW FIGURE 6A) IS UNNECESSARY. Let F \subseteq R denote the field of numbers which are…

Metric Geometry · Mathematics 2009-09-25 Apoloniusz Tyszka

art, Iosevich, Koh and Rudnev (2007) show, using Fourier analysis method, that the finite Erd\"os-Falconer distance conjecture holds for subsets of the unit sphere in $\mathbbm{F}_q^d$. In this note, we give a graph theoretic proof of this…

Combinatorics · Mathematics 2008-10-09 Le Anh Vinh

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any reductive group scheme $\mathbb{G}$ over $\mathbb{Z}$ such…

Representation Theory · Mathematics 2019-02-20 Alexander Stasinski , Andrea Vera-Gajardo

We prove that a set $A$ of at most $q$ non-collinear points in the finite plane $\mathbb{F}_{q}^{2}$ spans at least $\approx\frac{|A|}{\sqrt{q}}$ directions: this is based on a lower bound contained in [FST13], which we prove again together…

Combinatorics · Mathematics 2022-12-13 Daniele Dona

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt