相关论文: On a topological version of Pach's overlap theorem

Let $k$ be a perfect field and let $X\subset {\mathbb P}^N$ be a hypersurface of degree $d$ defined over $k$ and containing a linear subspace $L$ defined over an algebraic closure $\overline{k}$ with $\mathrm{codim}_{{\mathbb P}^N}L=r$. We…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Fix positive integers $n,r,d$. We show that if $n,r,d$ satisfy a suitable inequality, then any smooth hypersurface $X\subset \mathbb{P}^n$ defined over a finite field of characteristic $p$ sufficiently large contains a rational $r$-plane.…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

For any two configurations of ordered points $p=(p_{1},...,\p_{N})$ and $q=(q_{1},...,q_{N})$ in Euclidean space $E^d$ such that $q$ is an expansion of $p$, there exists a continuous expansion from $p$ to $q$ in dimension 2d; Bezdek and…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Sard's theorem asserts that the set of critical values of a smooth map from one Euclidean space to another one has measure zero. A version of this result for infinite-dimensional Banach manifolds was proven by Smale for maps with Fredholm…

For a finite set of points $X$ on the unit hypersphere in $\mathbb{R}^d$ we consider the iteration $u_{i+1}=u_i+\chi_i$, where $\chi_i$ is the point of $X$ farthest from $u_i$. Restricting to the case where the origin is contained in the…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

We quantify the density of rational points in the unit sphere $S^n$, proving analogues of the classical theorems on the embedding of $\q^n$ into $\r^n$. Specifically, we prove a Dirichlet theorem stating that every point $\alpha \in S^n$ is…

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

Let F : P^n --> P^n be a morphism of degree d > 1 defined over C. The dynamical Mordell--Lang conjecture says that the intersection of an orbit O_F(P) and a subvariety X of P^n is usually finite. We consider the number of linear…

We describe relations between maximal subfields in a division ring and in its rational extensions. More precisely, we prove that properties such as being Galois or purely inseparable over the centre generically carry over from one to…

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced…

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…

The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…

We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…