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

In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…

We show that if a compact set $E\subset \mathbb{R}^d$ has Hausdorff dimension larger than $\frac{d}{2}+\frac{1}{4}-\frac{1}{8d+4}$, where $d\geq 3$, then there is a point $x\in E$ such that the pinned distance set $\Delta_x(E)$ has positive…

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

Let $\mathbb{F}_q$ be a finite field of order $q$. In this paper, we study the distribution of rectangles in a given set in $\mathbb{F}_q^2$. More precisely, for any $0<\delta\le 1$, we prove that there exists an integer $q_0=q_0(\delta)$…

We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…

We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

For any $i,j \ge 0$ with $i+j =1$, let $\bad(i,j)$ denote the set of points $(x,y) \in \R^2$ for which $ \max \{\|qx\|^{1/i}, \|qy\|^{1/j} \} > c/q $ for all $ q \in \N $. Here $c = c(x,y)$ is a positive constant. Our main result implies…

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Basic properties of the center of distances of a set are investigated. Computation of the center for achievement sets is particularly aimed at. A new sufficient condition for the center of distances of the set of subsums of a fast…

We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

We establish that if $d \geq 2k + 6$ and $q$ is odd and sufficiently large with respect to $\alpha \in (0,1)$, then every set $A\subseteq \mathbf{F}_q^d$ of size $|A| \geq \alpha q^d$ will contain an isometric copy of every spherical…

In this paper we prove a conjecture of J. Andrade, S. J. Miller, K. Pratt and M. Trinh, showing the existence of a non trivial infinite $F$-set over $\mathbb F_q[x]$ for every fixed $q$. We also provide the proof of a refinement of the…

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

We prove a sharp analogue of Minkowski's inhomogeneous approximation theorem over fields of power series $\mathbb{F}_q((T^{-1}))$. Furthermore, we study the approximation to a given point $\underline{y}$ in $\mathbb{F}_q((T^{-1}))^2$ by the…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

We show that if $\mathcal{E}$ is a subset of the $d$-dimensional vector space over a finite field $\mathbbm{F}_q$ ($d \geq 3$) of cardinality $|\mathcal{E}| \geq (d-1)q^{d - 1}$, then the set of volumes of $d$-dimensional parallelepipeds…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…